Submission #4043221
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; typedef vector<int> vi; #define REP(i, n) for (int i = 0; i < n; ++i) const int MAX = 111; int N; vi A; int main() { cin >> N; A = vi(N); REP (i, N) cin >> A[i]; sort(A.begin(), A.end()); bool ans = true; int mx = A[N-1]; int mn, idx; if (mx%2) { // 最大が奇数なら、最小はmx/2+1で2つだけある ans = (A[0] == A[1] && A[0] == mx/2+1); mn = A[0]; idx = 0; } else { // 偶数なら、最小はmx/2で1つだけ ans = (A[0] != A[1] && A[0] == mx/2); mn = A[1]; idx = 1; } for (int x = mn; x <= mx; x++) { int f = 0; while (idx < N && A[idx] == x) { f++; idx++; } ans &= (f>=2); } cout << ((ans)?"Possible":"Impossible") << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Tree Restoring |
User | tnyo43 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 920 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 |