Submission #2238662
Source Code Expand
#include <stdio.h> #define MN 105 int n,mx=0,a[MN]; bool b[MN],ans=true; inline int max(int a,int b){return a>b?a:b;} int main(){ scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); mx=max(mx,a[i]); } mx++; // printf("mx=%d\n",mx); for(int i=1;i<=n;i++){ if(a[i]+1<mx-a[i]){ ans=false; // printf("%d is too close\n",a[i]); } if(!b[a[i]+1]){ b[a[i]+1]=true; // printf("b[%d] (type=1) become true with %d\n",a[i]+1,i); continue; } else if(!b[mx-a[i]]){ b[mx-a[i]]=true; // printf("b[%d] (type=2) become true with %d\n",mx-a[i],i); continue; } if((mx%2==1)&&a[i]+1==mx-a[i]){ ans=false; // printf("%d has been placed\n",a[i]+1); } if((mx%2==0)&&a[i]+1==mx-a[i]+1){ ans=false; } } for(int i=1;i<=mx;i++){ if(!b[i])ans=false; } puts(ans?"Possible":"Impossible"); }
Submission Info
Submission Time | |
---|---|
Task | C - Tree Restoring |
User | vjudge2 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 829 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:7:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:9:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a[i]); ^
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 |