Submission #905116
Source Code Expand
#define _USE_MATH_DEFINES #include <algorithm> #include <cstdio> #include <functional> #include <iostream> #include <cfloat> #include <climits> #include <cstdlib> #include <cstring> #include <cmath> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <time.h> #include <vector> #include <random> #include <list> using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> i_i; typedef pair<ll, int> ll_i; typedef pair<int, ll> i_ll; typedef pair<double, int> d_i; typedef pair<ll, ll> ll_ll; typedef pair<double, double> d_d; struct edge { int u, v; ll w; }; #define rep(i, N) for (int i = 0; i < (int)(N); i++) #define pb push_back int INF = INT_MAX / 10; ll MOD = 1000000007; ll _MOD = 1000000009; double EPS = 1e-10; int main() { int N; cin >> N; vector<int> d(N); rep(u, N) cin >> d[u]; int D = 0; rep(u, N) D = max(D, d[u]); if (D == 1) { cout << (N == 2 ? "Possible" : "Impossible") << endl; return 0; } vector<int> a(N); rep(u, N) a[d[u]]++; rep(i, D + 1) a[max(i, D - i)]--; int lb = (D + 1) / 2 + 1; rep(k, N) if ((k < lb && a[k] > 0) || a[k] < 0) { cout << "Impossible" << endl; return 0; } cout << "Possible" << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Tree Restoring |
User | sugim48 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1341 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
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 | 3 ms | 256 KB |
almostline1 | AC | 3 ms | 256 KB |
almostline2 | AC | 3 ms | 256 KB |
almostline3 | AC | 3 ms | 256 KB |
can0 | AC | 3 ms | 256 KB |
can1 | AC | 3 ms | 256 KB |
can2 | AC | 3 ms | 256 KB |
can3 | AC | 3 ms | 256 KB |
can4 | AC | 3 ms | 256 KB |
can5 | AC | 3 ms | 256 KB |
can6 | AC | 3 ms | 256 KB |
deg0 | AC | 3 ms | 256 KB |
deg1 | AC | 3 ms | 256 KB |
deg2 | AC | 3 ms | 256 KB |
deg3 | AC | 3 ms | 256 KB |
example0 | AC | 2 ms | 256 KB |
example1 | AC | 3 ms | 256 KB |
example2 | AC | 2 ms | 256 KB |
example3 | AC | 3 ms | 256 KB |
example4 | AC | 3 ms | 256 KB |
example5 | AC | 3 ms | 256 KB |
handmade0 | AC | 3 ms | 256 KB |
line0 | AC | 3 ms | 256 KB |
line1 | AC | 2 ms | 256 KB |
line2 | AC | 3 ms | 256 KB |
line3 | AC | 3 ms | 256 KB |
ng10 | AC | 3 ms | 256 KB |
ng11 | AC | 3 ms | 256 KB |
ng12 | AC | 3 ms | 256 KB |
ng13 | AC | 3 ms | 256 KB |
ng20 | AC | 3 ms | 256 KB |
ng21 | AC | 3 ms | 256 KB |
ng22 | AC | 3 ms | 256 KB |
ng23 | AC | 3 ms | 256 KB |
plus0 | AC | 3 ms | 256 KB |
plus1 | AC | 3 ms | 256 KB |
plus2 | AC | 2 ms | 256 KB |
plus3 | AC | 3 ms | 256 KB |
rand0 | AC | 3 ms | 256 KB |
rand1 | AC | 3 ms | 256 KB |
rand2 | AC | 3 ms | 256 KB |
star0 | AC | 3 ms | 256 KB |
star1 | AC | 3 ms | 256 KB |
star2 | AC | 3 ms | 256 KB |
star3 | AC | 3 ms | 256 KB |