Submission #911272
Source Code Expand
#include <cstdio> #include <algorithm> using namespace std; int ap[128]; inline void out () { printf ("Impossible\n"); exit (0); } int main () { // freopen ("file.in", "r", stdin); int n; scanf ("%d", &n); int ma = 0; for (int i = 1; i <= n; ++i) { int x; scanf ("%d", &x); ++ap[x]; ma = max (ma, x); } int mi = (ma + 1) >> 1; for (int i = 1; i < mi; ++i) if (ap[i]) out (); for (int i = mi + 1; i <= ma; ++i) if (ap[i] <= 1) out (); if (ap[mi] != (ma & 1) + 1) out (); printf ("Possible\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tree Restoring |
User | Theodor1000 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 669 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:19:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%d", &n); ^ ./Main.cpp:25:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%d", &x); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 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 | 128 KB |
almostline1 | AC | 1 ms | 128 KB |
almostline2 | AC | 1 ms | 128 KB |
almostline3 | AC | 1 ms | 128 KB |
can0 | AC | 1 ms | 128 KB |
can1 | AC | 1 ms | 128 KB |
can2 | AC | 1 ms | 128 KB |
can3 | AC | 1 ms | 128 KB |
can4 | AC | 1 ms | 128 KB |
can5 | AC | 1 ms | 128 KB |
can6 | AC | 1 ms | 128 KB |
deg0 | AC | 1 ms | 128 KB |
deg1 | AC | 1 ms | 128 KB |
deg2 | AC | 1 ms | 128 KB |
deg3 | AC | 1 ms | 128 KB |
example0 | AC | 1 ms | 128 KB |
example1 | AC | 1 ms | 128 KB |
example2 | AC | 1 ms | 128 KB |
example3 | AC | 1 ms | 128 KB |
example4 | AC | 1 ms | 128 KB |
example5 | AC | 1 ms | 128 KB |
handmade0 | AC | 1 ms | 128 KB |
line0 | AC | 1 ms | 128 KB |
line1 | AC | 1 ms | 128 KB |
line2 | AC | 1 ms | 128 KB |
line3 | AC | 1 ms | 128 KB |
ng10 | AC | 1 ms | 128 KB |
ng11 | AC | 1 ms | 128 KB |
ng12 | AC | 1 ms | 128 KB |
ng13 | AC | 1 ms | 128 KB |
ng20 | AC | 1 ms | 128 KB |
ng21 | AC | 1 ms | 128 KB |
ng22 | AC | 1 ms | 128 KB |
ng23 | AC | 1 ms | 128 KB |
plus0 | AC | 1 ms | 128 KB |
plus1 | AC | 1 ms | 128 KB |
plus2 | AC | 1 ms | 128 KB |
plus3 | AC | 1 ms | 128 KB |
rand0 | AC | 1 ms | 128 KB |
rand1 | AC | 1 ms | 128 KB |
rand2 | AC | 1 ms | 128 KB |
star0 | AC | 1 ms | 128 KB |
star1 | AC | 1 ms | 128 KB |
star2 | AC | 1 ms | 128 KB |
star3 | AC | 1 ms | 128 KB |