Submission #1161604
Source Code Expand
#include <cstdio> #include <iostream> #include <cmath> #include <cstring> #include <sstream> #include <algorithm> #include <cstdlib> #include <map> #include <queue> #include <utility> #include <vector> #include <set> #include <memory.h> #include <iomanip> #include <bitset> #include <list> #include <stack> using namespace std; #define mod 1000000007 int main() { int n; cin >> n; int maxa = 0, secmaxa = 0; map<int, int> cnt; for(int i = 1; i < n; i++){ cnt[i] = 0; } for(int i = 0; i < n; i++){ int a; cin >> a; if(a > maxa){ secmaxa = maxa; maxa = a; } else if(a == maxa){ secmaxa = a; } else if(a > secmaxa){ secmaxa = a; } cnt[a]++; } if(maxa != secmaxa){ cout << "Impossible" << endl; return 0; } for(int i = 1; i < maxa; i++){ if(i < maxa / 2){ if(cnt[i] > 0){ cout << "Impossible" << endl; return 0; } } else if(i == maxa / 2){ if((maxa % 2 == 0 && cnt[i] != 1) || (maxa % 2 == 1 && cnt[i] != 2)){ cout << "Impossible" << endl; return 0; } } else { if(cnt[i] < 2){ cout << "Impossible" << endl; return 0; } } } cout << "Possible" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tree Restoring |
User | maple |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1225 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 | WA | 1 ms | 256 KB |
almostline1 | WA | 1 ms | 256 KB |
almostline2 | WA | 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 | WA | 1 ms | 256 KB |
can6 | WA | 1 ms | 256 KB |
deg0 | WA | 1 ms | 256 KB |
deg1 | AC | 1 ms | 256 KB |
deg2 | WA | 1 ms | 256 KB |
deg3 | AC | 1 ms | 256 KB |
example0 | WA | 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 | WA | 1 ms | 256 KB |
line1 | AC | 1 ms | 256 KB |
line2 | WA | 1 ms | 256 KB |
line3 | AC | 1 ms | 256 KB |
ng10 | AC | 1 ms | 256 KB |
ng11 | AC | 1 ms | 256 KB |
ng12 | AC | 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 | WA | 1 ms | 256 KB |
star2 | AC | 1 ms | 256 KB |
star3 | WA | 1 ms | 256 KB |