Submission #905990


Source Code Expand

#include <cstdio>
#include <algorithm>
using namespace std;

static const auto NMAX = 100;

static int N, C[NMAX];

static bool solve() {
	int D;
	for(D = N; C[--D] == 0;);
	for(auto i = 0; i <= D; i++) {
		auto j = max(i, D - i);
		if(--C[j] < 0) return false;
	}
	auto b = (D + 1) / 2;
	for(auto i = 0; i <= b; i++) if(C[i] != 0) return false;
	return true;
}

static void input() {
	scanf("%d", &N);
	for(auto i = 0; i < N; i++) {
		int x;
		scanf("%d", &x);
		C[x]++;
	}
}

int main() {
	input();
	puts(solve() ? "Possible" : "Impossible");
	return 0;
}

Submission Info

Submission Time
Task C - Tree Restoring
User arosusti
Language C++14 (GCC 5.4.1)
Score 700
Code Size 590 Byte
Status AC
Exec Time 1 ms
Memory 128 KiB

Compile Error

./Main.cpp: In function ‘void input()’:
./Main.cpp:22:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:25:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 6
AC × 45
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 KiB
almostline1 AC 1 ms 128 KiB
almostline2 AC 1 ms 128 KiB
almostline3 AC 1 ms 128 KiB
can0 AC 1 ms 128 KiB
can1 AC 1 ms 128 KiB
can2 AC 1 ms 128 KiB
can3 AC 1 ms 128 KiB
can4 AC 1 ms 128 KiB
can5 AC 1 ms 128 KiB
can6 AC 1 ms 128 KiB
deg0 AC 1 ms 128 KiB
deg1 AC 1 ms 128 KiB
deg2 AC 1 ms 128 KiB
deg3 AC 1 ms 128 KiB
example0 AC 1 ms 128 KiB
example1 AC 1 ms 128 KiB
example2 AC 1 ms 128 KiB
example3 AC 1 ms 128 KiB
example4 AC 1 ms 128 KiB
example5 AC 1 ms 128 KiB
handmade0 AC 1 ms 128 KiB
line0 AC 1 ms 128 KiB
line1 AC 1 ms 128 KiB
line2 AC 1 ms 128 KiB
line3 AC 1 ms 128 KiB
ng10 AC 1 ms 128 KiB
ng11 AC 1 ms 128 KiB
ng12 AC 1 ms 128 KiB
ng13 AC 1 ms 128 KiB
ng20 AC 1 ms 128 KiB
ng21 AC 1 ms 128 KiB
ng22 AC 1 ms 128 KiB
ng23 AC 1 ms 128 KiB
plus0 AC 1 ms 128 KiB
plus1 AC 1 ms 128 KiB
plus2 AC 1 ms 128 KiB
plus3 AC 1 ms 128 KiB
rand0 AC 1 ms 128 KiB
rand1 AC 1 ms 128 KiB
rand2 AC 1 ms 128 KiB
star0 AC 1 ms 128 KiB
star1 AC 1 ms 128 KiB
star2 AC 1 ms 128 KiB
star3 AC 1 ms 128 KiB