Submission #1354631
Source Code Expand
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <iostream> #include <algorithm> #include <vector> #include <stack> #include <deque> #include <queue> #include <set> #include <map> #include <unordered_map> #include <bitset> #include <string> #define pb push_back #define sz(V) ((int)(V).size()) #define allv(V) ((V).begin()),((V).end()) #define befv(V) ((V)[(sz(V)-2)]) #define upmin(ans,ansx) (ans)=min((ans),(ansx)) #define upmax(ans,ansx) (ans)=max((ans),(ansx)) #define INF (1100000099) #define INFLL (1100000000000000099ll) #define MOD (1000000009) #define MAXN (105) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<ld, ld> pdd; inline void fuk() { puts("Impossible"); exit(0); } int Cnt[MAXN]; int A[MAXN]; int N, L; int main() { scanf("%d", &N); for(int i = 1; i <= N; i++) scanf("%d", &A[i]); L = *max_element(A+1, A+N+1); for(int i = 1; i <= N; i++) Cnt[A[i]]++; if(Cnt[L] < 2) fuk(); for(int i = (L+1)/2; i <= L; i++) { if(i*2 == L) Cnt[i]--; else Cnt[i] -= 2; if(Cnt[i] < 0) fuk(); } for(int i = 1; i <= (L+1)/2; i++) if(Cnt[i]) fuk(); puts("Possible"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tree Restoring |
User | youngyojun |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1291 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:38:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); for(int i = 1; i <= N; i++) scanf("%d", &A[i]); ^ ./Main.cpp:38:68: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); for(int i = 1; i <= N; i++) 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 | 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 | 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 | AC | 1 ms | 256 KB |
star2 | AC | 1 ms | 256 KB |
star3 | AC | 1 ms | 256 KB |