Submission #996158


Source Code Expand

#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long int lli;
typedef pair<lli, lli> P;
lli MOD = 1000000007;
int main()
{
    lli n;
    cin >> n;
    lli a[105];
    rep(i, n) cin >> a[i];
    sort(a, a + n);
    reverse(a, a + n);
    if (n == 2) {
        if (a[0] == 1 && a[1] == 1) {
            cout << "Possible" << endl;
        } else {
            cout << "Impossible" << endl;
        }
        return 0;
    }
    map<lli, lli> m;
    if (a[0] % 2 == 0) {
        m[a[0] / 2]++;
        rep(i, a[0] / 2)
        {
            rep(j, 2)
            {
                m[i + a[0] / 2 + 1]++;
            }
        }
        rep(i, n)
        {
            m[a[i]]--;
        }
        for (auto s : m) {
            if (s.second > 0) {
                cout << "Impossible" << endl;
                return 0;
            } else if (s.second < 0) {
                if (s.first < a[0] / 2 + 1) {
                    cout << "Impossible" << endl;
                    return 0;
                }
            }
        }
    }
    if (a[0] % 2 == 1) {
        rep(i, a[0] / 2)
        {
            rep(j, 2)
            {
                m[i + a[0] / 2 + 1]++;
            }
        }
        rep(i, n)
        {
            m[a[i]]--;
        }
        for (auto s : m) {
            if (s.second > 0) {
                cout << "Impossible" << endl;
                return 0;
            } else if (s.second < 0) {
                if (s.first < a[0] / 2 + 2) {
                    cout << "Impossible" << endl;
                    return 0;
                }
            }
        }
    }
    cout << "Possible" << endl;
}

Submission Info

Submission Time
Task C - Tree Restoring
User uenoku
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1940 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

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 2 ms 256 KB
almostline1 AC 2 ms 256 KB
almostline2 AC 2 ms 256 KB
almostline3 AC 2 ms 256 KB
can0 AC 2 ms 256 KB
can1 AC 2 ms 256 KB
can2 AC 2 ms 256 KB
can3 AC 2 ms 256 KB
can4 AC 2 ms 256 KB
can5 AC 2 ms 256 KB
can6 AC 2 ms 256 KB
deg0 AC 2 ms 256 KB
deg1 AC 2 ms 256 KB
deg2 AC 2 ms 256 KB
deg3 AC 2 ms 256 KB
example0 AC 2 ms 256 KB
example1 AC 2 ms 256 KB
example2 AC 2 ms 256 KB
example3 AC 2 ms 256 KB
example4 AC 2 ms 256 KB
example5 AC 2 ms 256 KB
handmade0 AC 2 ms 256 KB
line0 AC 2 ms 256 KB
line1 AC 2 ms 256 KB
line2 AC 2 ms 256 KB
line3 AC 2 ms 256 KB
ng10 AC 2 ms 256 KB
ng11 AC 2 ms 256 KB
ng12 AC 2 ms 256 KB
ng13 AC 2 ms 256 KB
ng20 AC 2 ms 256 KB
ng21 AC 2 ms 256 KB
ng22 AC 2 ms 256 KB
ng23 AC 2 ms 256 KB
plus0 AC 2 ms 256 KB
plus1 AC 2 ms 256 KB
plus2 AC 2 ms 256 KB
plus3 AC 2 ms 256 KB
rand0 AC 2 ms 256 KB
rand1 AC 2 ms 256 KB
rand2 AC 2 ms 256 KB
star0 AC 2 ms 256 KB
star1 AC 2 ms 256 KB
star2 AC 2 ms 256 KB
star3 AC 2 ms 256 KB