Submission #59250106


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int a[N], t[N];
int main() {
  int n;
  scanf("%d", &n);
  int mx = 0;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    ++t[a[i]];
    mx = max(mx, a[i]);
  }

  auto solve = [&]() -> bool {
    for (int i = 1; i < (mx + 1) / 2; ++i) {
      if (t[i]) return false;
    }
    if (!(mx & 1) && t[mx / 2] != 1) return false;
    if ((mx & 1) && t[(mx + 1) / 2] != 2) return false;
    for (int i = mx / 2 + 1; i <= mx; ++i) {
      if (t[i] < 2) return false;
    }
    return true;
  };

  puts(solve() ? "Possible" : "Impossible");
}

Submission Info

Submission Time
Task C - Tree Restoring
User Number10
Language C++ 20 (gcc 12.2)
Score 700
Code Size 637 Byte
Status AC
Exec Time 1 ms
Memory 3920 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:7:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    7 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
Main.cpp:10:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   10 |     scanf("%d", &a[i]);
      |     ~~~~~^~~~~~~~~~~~~

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 3588 KiB
almostline1 AC 1 ms 3772 KiB
almostline2 AC 1 ms 3916 KiB
almostline3 AC 1 ms 3580 KiB
can0 AC 1 ms 3744 KiB
can1 AC 1 ms 3580 KiB
can2 AC 1 ms 3644 KiB
can3 AC 1 ms 3664 KiB
can4 AC 1 ms 3616 KiB
can5 AC 1 ms 3688 KiB
can6 AC 1 ms 3772 KiB
deg0 AC 1 ms 3672 KiB
deg1 AC 1 ms 3736 KiB
deg2 AC 1 ms 3680 KiB
deg3 AC 1 ms 3916 KiB
example0 AC 1 ms 3644 KiB
example1 AC 1 ms 3660 KiB
example2 AC 1 ms 3580 KiB
example3 AC 1 ms 3716 KiB
example4 AC 1 ms 3664 KiB
example5 AC 1 ms 3716 KiB
handmade0 AC 1 ms 3660 KiB
line0 AC 1 ms 3668 KiB
line1 AC 1 ms 3700 KiB
line2 AC 1 ms 3684 KiB
line3 AC 1 ms 3680 KiB
ng10 AC 1 ms 3712 KiB
ng11 AC 1 ms 3728 KiB
ng12 AC 1 ms 3740 KiB
ng13 AC 1 ms 3696 KiB
ng20 AC 1 ms 3916 KiB
ng21 AC 1 ms 3768 KiB
ng22 AC 1 ms 3736 KiB
ng23 AC 1 ms 3692 KiB
plus0 AC 1 ms 3580 KiB
plus1 AC 1 ms 3620 KiB
plus2 AC 1 ms 3584 KiB
plus3 AC 1 ms 3716 KiB
rand0 AC 1 ms 3804 KiB
rand1 AC 1 ms 3592 KiB
rand2 AC 1 ms 3692 KiB
star0 AC 1 ms 3660 KiB
star1 AC 1 ms 3920 KiB
star2 AC 1 ms 3676 KiB
star3 AC 1 ms 3664 KiB