Submission #1818002


Source Code Expand

#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x)  cerr << #x << " = " << (x) << endl;
//const int INF = 1e8;
using namespace std;

int main(){
	int n;
	cin >> n;

	vector<int> a(n);
	map<int,int> m;
	rep(i,n){
		cin >> a[i];
		m[ a[i] ]++;
	}

	vector<pair<int, int>> v(all(m));
	//for(auto i : v){ cout << i.first << ' ' << i.second << endl; }

	bool f = true;
	if(v[0].second == 1){ //中心が頂点
		if(v[0].first + 1 != v.size()){
			f = false;
		}
		range(i,1,v.size()){
			if(max(2, v[i - 1].second) > v[i].second){
				f = false;
			}else if(v[i - 1].first + 1 != v[i].first){
				f = false;
			}
		}
	}else if(v[0].second == 2){ //中心が辺
		if(v[0].first == 1 && v.size() > 1){
			f = false;
		}
		range(i,1,v.size()){
			if(v[i - 1].second > v[i].second){
				f = false;
			}else if(v[i - 1].first + 1 != v[i].first){
				f = false;
			}
		}
	}else{
		f = false;
	}

	if(f) cout << "Possible" << endl;
	else cout << "Impossible" << endl;
}

Submission Info

Submission Time
Task C - Tree Restoring
User noy72
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1135 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 6
AC × 28
WA × 17
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 WA 1 ms 256 KB
almostline1 WA 1 ms 256 KB
almostline2 WA 1 ms 256 KB
almostline3 WA 1 ms 256 KB
can0 WA 1 ms 256 KB
can1 WA 1 ms 256 KB
can2 WA 1 ms 256 KB
can3 WA 1 ms 256 KB
can4 WA 1 ms 256 KB
can5 WA 1 ms 256 KB
can6 WA 1 ms 256 KB
deg0 WA 1 ms 256 KB
deg1 WA 1 ms 256 KB
deg2 WA 1 ms 256 KB
deg3 WA 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 WA 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 WA 1 ms 256 KB