Submission #1689078
Source Code Expand
//#define __USE_MINGW_ANSI_STDIO 0 #include <bits/stdc++.h> using namespace std; typedef long long ll; // #define int ll typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<ll> VL; typedef vector<VL> VVL; typedef pair<int, int> PII; #define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i) #define REP(i, n) FOR(i, 0, n) #define ALL(x) x.begin(), x.end() #define IN(a, b, x) (a<=x&&x<b) #define MP make_pair #define PB push_back #ifdef int const int INF = (1LL<<30); #else const ll INF = (1LL<<60); #endif const double PI = 3.14159265359; const double EPS = 1e-12; const int MOD = 1000000007; template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); } template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); } int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; int a[105], cnt[105]; signed main(void) { int n; cin >> n; int ma = 0; REP(i, n) { int a; cin >> a; cnt[a]++; chmax(ma, a); } if(ma%2==0) { for(int i=ma; i>=0; --i) { if(i > ma/2) { if(cnt[i] < 2) { cout << "Impossible" << endl; return 0; } } else if(i == ma/2) { if(cnt[i] != 1) { cout << "Impossible" << endl; return 0; } } else { if(cnt[i]) { cout << "Impossible" << endl; return 0; } } } } else { for(int i=ma; i>=0; --i) { if(i >= ma/2+1) { if(cnt[i] < 2) { cout << "Impossible" << endl; return 0; } } else { if(cnt[i]) { cout << "Impossible" << endl; return 0; } } } } cout << "Possible" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tree Restoring |
User | ferin_tech |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1780 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0, example1, example2, example3, example4, example5 |
All | almostline0, almostline1, almostline2, almostline3, can0, can1, can2, can3, can4, can5, can6, deg0, deg1, deg2, deg3, example0, example1, example2, example3, example4, example5, handmade0, line0, line1, line2, line3, ng10, ng11, ng12, ng13, ng20, ng21, ng22, ng23, plus0, plus1, plus2, plus3, rand0, rand1, rand2, star0, star1, star2, star3 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
almostline0 | AC | 1 ms | 256 KB |
almostline1 | AC | 1 ms | 256 KB |
almostline2 | AC | 1 ms | 256 KB |
almostline3 | AC | 1 ms | 256 KB |
can0 | AC | 1 ms | 256 KB |
can1 | AC | 1 ms | 256 KB |
can2 | AC | 1 ms | 256 KB |
can3 | AC | 1 ms | 256 KB |
can4 | AC | 1 ms | 256 KB |
can5 | AC | 1 ms | 256 KB |
can6 | AC | 1 ms | 256 KB |
deg0 | AC | 1 ms | 256 KB |
deg1 | AC | 1 ms | 256 KB |
deg2 | AC | 1 ms | 256 KB |
deg3 | AC | 1 ms | 256 KB |
example0 | AC | 1 ms | 256 KB |
example1 | AC | 1 ms | 256 KB |
example2 | AC | 1 ms | 256 KB |
example3 | AC | 1 ms | 256 KB |
example4 | AC | 1 ms | 256 KB |
example5 | AC | 1 ms | 256 KB |
handmade0 | AC | 1 ms | 256 KB |
line0 | AC | 1 ms | 256 KB |
line1 | AC | 1 ms | 256 KB |
line2 | AC | 1 ms | 256 KB |
line3 | AC | 1 ms | 256 KB |
ng10 | WA | 1 ms | 256 KB |
ng11 | AC | 1 ms | 256 KB |
ng12 | WA | 1 ms | 256 KB |
ng13 | AC | 1 ms | 256 KB |
ng20 | AC | 1 ms | 256 KB |
ng21 | AC | 1 ms | 256 KB |
ng22 | AC | 1 ms | 256 KB |
ng23 | AC | 1 ms | 256 KB |
plus0 | AC | 1 ms | 256 KB |
plus1 | AC | 1 ms | 256 KB |
plus2 | AC | 1 ms | 256 KB |
plus3 | AC | 1 ms | 256 KB |
rand0 | AC | 1 ms | 256 KB |
rand1 | AC | 1 ms | 256 KB |
rand2 | AC | 1 ms | 256 KB |
star0 | AC | 1 ms | 256 KB |
star1 | AC | 1 ms | 256 KB |
star2 | AC | 1 ms | 256 KB |
star3 | AC | 1 ms | 256 KB |