Submission #906376
Source Code Expand
#include <cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <vector> #include <string> #include <map> #include <set> #include <cassert> using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++) #define per(i,a,n) for (int i=n-1;i>=a;i--) #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define se second #define SZ(x) ((int)(x).size()) typedef vector<int> VI; typedef long long ll; typedef pair<int,int> PII; const ll mod=1000000007; ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;} // head const int N=201000; int n,a[N],cnt[N]; bool check() { int m=a[n-1]; if (m==1) { if (cnt[m]!=2) return 0; } rep(i,1,m+1) { if (2*i<m) { if (cnt[i]!=0) return 0; } if (2*i==m) { if (cnt[i]!=1) return 0; } if (2*i==m+1) { if (cnt[i]!=2) return 0; } if (2*i>m) { if (cnt[i]<=1) return 0; } } return 1; } int main() { scanf("%d",&n); rep(i,0,n) scanf("%d",a+i),cnt[a[i]]++; sort(a,a+n); puts(check()?"Possible":"Impossible"); }
Submission Info
Submission Time | |
---|---|
Task | C - Tree Restoring |
User | apiad |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1120 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:42:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:43:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] rep(i,0,n) scanf("%d",a+i),cnt[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 |