oj.uz

Submission #914348

# Submission time Handle Problem Language Result Execution time Memory
914348 2024-01-21T17:20:14 Z marvinthang Beech Tree (IOI23_beechtree) C++17
100 / 100
 177 ms 56984 KB 
/*************************************
*    author: marvinthang             *
*    created: 21.01.2024 19:34:55    *
*************************************/

#include "beechtree.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

vector <int> beechtree(int N, int M, vector <int> P, vector <int> C) {
    vector <vector <int>> adj(N);
    vector <int> sz(N, 1), res(N, 1), heavy(N, -1);
    vector <bool> is_head(N, true);
    REPD(u, N) {
        --C[u];
        if (heavy[u] != -1) is_head[heavy[u]] = false;
        if (u) {
            sz[P[u]] += sz[u];
            adj[P[u]].push_back(u);
            if (heavy[P[u]] == -1 || sz[heavy[P[u]]] < sz[u]) heavy[P[u]] = u;
        }
    }
    vector <pair <int, int>> val;
    vector <int> cnt(N + 1);
    REP(u, N) if (is_head[u]) {
        val.emplace_back(u, u);
        ++cnt[sz[u]];
        for (int i = (int) val.size() - 1; i < (int) val.size(); ++i) {
            for (int &v: adj[val[i].fi]) {
                ++cnt[sz[v]];
                val.emplace_back(v, u);
            }
        }
    }
    partial_sum(ALL(cnt), cnt.begin());
    vector <pair <int, int>> sorted_val(cnt.back());
    vector <vector <int>> order(N);
    for (auto &v: val) sorted_val[--cnt[sz[v.fi]]] = v;
    for (auto &[v, u]: sorted_val) order[u].push_back(v);

    vector <int> tin(N), tout(N);
    function<void(int)> dfs1 = [&] (int u) {
        static int t = 0;
        tin[u] = t++;
        for (int &v: adj[u]) dfs1(v);
            tout[u] = t;
    };
    dfs1(0);
    vector <int> color_sz(M, 0);

    REPD(u, N) {
        if (res[u]) {
            for (int &v: adj[u]) {
                if (color_sz[C[v]]) {
                    res[u] = 0;
                    break;
                }
                color_sz[C[v]] = 1;
            }
            for (int &v: adj[u]) color_sz[C[v]] = 0;
        }
        if (u && !res[u]) res[P[u]] = 0;
    }
    function<void(int)> dfs2 = [&] (int u) {
        auto check_subtree = [&] (int v) {
            int last = -1;
            for (int &w: order[u]) if (tin[v] <= tin[w] && tin[w] < tout[v]) {
                int cnt = (int) adj[last].size();
                for (int &v: adj[w]) {
                    if (color_sz[C[v]] > sz[v]) {
                        if (last != -1) for (int &v: adj[last]) color_sz[C[v]] = 0;
                        return true;
                    }
                    cnt -= !!color_sz[C[v]];
                }
                if (last != -1 && cnt) {
                    for (int &v: adj[last]) color_sz[C[v]] = 0;
                    return true;
                }
                for (int &v: adj[w]) color_sz[C[v]] = sz[v];
                last = w;
            }
            for (int &v: adj[last]) color_sz[C[v]] = 0;
            return false;
        };
        vector <int> path;
        for (int v = u; v != -1; v = heavy[v]) path.push_back(v);
        int tl = 0;
        while (tl < (int) path.size() && !res[path[tl]]) ++tl;
        auto p = partition_point(tl + ALL(path), check_subtree);
        if (p != path.end()) res[*p] = 1;
        for (auto it = path.begin(); it != p; ++it) {
            for (int &v: adj[*it]) if (v != heavy[*it]) dfs2(v);
            res[*it] = 0;
        }
    };
    dfs2(0);
    FOR(i, 1, N) if (res[P[i]]) res[i] = 1;
    return res;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 102 ms 43100 KB Output is correct
8 Correct 87 ms 42868 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 ms 1824 KB Output is correct
14 Correct 2 ms 1628 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 2 ms 1628 KB Output is correct
17 Correct 102 ms 42952 KB Output is correct
18 Correct 97 ms 42948 KB Output is correct
19 Correct 90 ms 43080 KB Output is correct
20 Correct 85 ms 43048 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 1644 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 42 ms 20936 KB Output is correct
16 Correct 40 ms 20424 KB Output is correct
17 Correct 43 ms 19908 KB Output is correct
18 Correct 41 ms 20424 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 102 ms 43100 KB Output is correct
6 Correct 87 ms 42868 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 106 ms 36932 KB Output is correct
12 Correct 78 ms 35768 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 496 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 0 ms 348 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 692 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 600 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 2 ms 1824 KB Output is correct
43 Correct 2 ms 1628 KB Output is correct
44 Correct 1 ms 1628 KB Output is correct
45 Correct 2 ms 1628 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 496 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 1644 KB Output is correct
57 Correct 1 ms 1372 KB Output is correct
58 Correct 1 ms 1372 KB Output is correct
59 Correct 1 ms 1372 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 2 ms 1372 KB Output is correct
63 Correct 1 ms 1372 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 1 ms 604 KB Output is correct
76 Correct 1 ms 604 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 1 ms 604 KB Output is correct
79 Correct 1 ms 600 KB Output is correct
80 Correct 2 ms 604 KB Output is correct
81 Correct 1 ms 604 KB Output is correct
82 Correct 1 ms 604 KB Output is correct
83 Correct 1 ms 692 KB Output is correct
84 Correct 2 ms 860 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 2 ms 604 KB Output is correct
87 Correct 1 ms 604 KB Output is correct
88 Correct 1 ms 600 KB Output is correct
89 Correct 1 ms 1372 KB Output is correct
90 Correct 2 ms 1372 KB Output is correct
91 Correct 2 ms 1372 KB Output is correct
92 Correct 2 ms 1368 KB Output is correct
93 Correct 2 ms 1368 KB Output is correct
94 Correct 2 ms 1628 KB Output is correct
95 Correct 2 ms 1628 KB Output is correct
96 Correct 2 ms 1372 KB Output is correct
97 Correct 1 ms 1372 KB Output is correct
98 Correct 2 ms 1372 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 692 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 111 ms 42440 KB Output is correct
40 Correct 95 ms 42324 KB Output is correct
41 Correct 89 ms 42184 KB Output is correct
42 Correct 81 ms 42068 KB Output is correct
43 Correct 114 ms 39340 KB Output is correct
44 Correct 97 ms 35524 KB Output is correct
45 Correct 177 ms 53172 KB Output is correct
46 Correct 139 ms 50116 KB Output is correct
47 Correct 121 ms 44176 KB Output is correct
48 Correct 115 ms 39868 KB Output is correct
49 Correct 97 ms 36028 KB Output is correct
50 Correct 150 ms 56984 KB Output is correct
51 Correct 143 ms 54704 KB Output is correct
52 Correct 123 ms 48420 KB Output is correct
53 Correct 110 ms 40776 KB Output is correct
54 Correct 105 ms 36040 KB Output is correct
55 Correct 84 ms 36808 KB Output is correct
56 Correct 83 ms 35784 KB Output is correct
57 Correct 87 ms 36292 KB Output is correct
58 Correct 90 ms 36036 KB Output is correct
59 Correct 91 ms 36288 KB Output is correct
60 Correct 100 ms 35668 KB Output is correct
61 Correct 111 ms 36340 KB Output is correct
62 Correct 95 ms 36800 KB Output is correct
63 Correct 88 ms 35784 KB Output is correct
64 Correct 93 ms 35604 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 102 ms 43100 KB Output is correct
39 Correct 87 ms 42868 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 2 ms 1824 KB Output is correct
45 Correct 2 ms 1628 KB Output is correct
46 Correct 1 ms 1628 KB Output is correct
47 Correct 2 ms 1628 KB Output is correct
48 Correct 102 ms 42952 KB Output is correct
49 Correct 97 ms 42948 KB Output is correct
50 Correct 90 ms 43080 KB Output is correct
51 Correct 85 ms 43048 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 496 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 1644 KB Output is correct
63 Correct 1 ms 1372 KB Output is correct
64 Correct 1 ms 1372 KB Output is correct
65 Correct 1 ms 1372 KB Output is correct
66 Correct 42 ms 20936 KB Output is correct
67 Correct 40 ms 20424 KB Output is correct
68 Correct 43 ms 19908 KB Output is correct
69 Correct 41 ms 20424 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 2 ms 1372 KB Output is correct
73 Correct 1 ms 1372 KB Output is correct
74 Correct 106 ms 36932 KB Output is correct
75 Correct 78 ms 35768 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 1 ms 348 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 1 ms 604 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1 ms 604 KB Output is correct
90 Correct 1 ms 604 KB Output is correct
91 Correct 1 ms 600 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 1 ms 604 KB Output is correct
94 Correct 1 ms 604 KB Output is correct
95 Correct 1 ms 692 KB Output is correct
96 Correct 2 ms 860 KB Output is correct
97 Correct 1 ms 604 KB Output is correct
98 Correct 2 ms 604 KB Output is correct
99 Correct 1 ms 604 KB Output is correct
100 Correct 1 ms 600 KB Output is correct
101 Correct 1 ms 1372 KB Output is correct
102 Correct 2 ms 1372 KB Output is correct
103 Correct 2 ms 1372 KB Output is correct
104 Correct 2 ms 1368 KB Output is correct
105 Correct 2 ms 1368 KB Output is correct
106 Correct 2 ms 1628 KB Output is correct
107 Correct 2 ms 1628 KB Output is correct
108 Correct 2 ms 1372 KB Output is correct
109 Correct 1 ms 1372 KB Output is correct
110 Correct 2 ms 1372 KB Output is correct
111 Correct 111 ms 42440 KB Output is correct
112 Correct 95 ms 42324 KB Output is correct
113 Correct 89 ms 42184 KB Output is correct
114 Correct 81 ms 42068 KB Output is correct
115 Correct 114 ms 39340 KB Output is correct
116 Correct 97 ms 35524 KB Output is correct
117 Correct 177 ms 53172 KB Output is correct
118 Correct 139 ms 50116 KB Output is correct
119 Correct 121 ms 44176 KB Output is correct
120 Correct 115 ms 39868 KB Output is correct
121 Correct 97 ms 36028 KB Output is correct
122 Correct 150 ms 56984 KB Output is correct
123 Correct 143 ms 54704 KB Output is correct
124 Correct 123 ms 48420 KB Output is correct
125 Correct 110 ms 40776 KB Output is correct
126 Correct 105 ms 36040 KB Output is correct
127 Correct 84 ms 36808 KB Output is correct
128 Correct 83 ms 35784 KB Output is correct
129 Correct 87 ms 36292 KB Output is correct
130 Correct 90 ms 36036 KB Output is correct
131 Correct 91 ms 36288 KB Output is correct
132 Correct 100 ms 35668 KB Output is correct
133 Correct 111 ms 36340 KB Output is correct
134 Correct 95 ms 36800 KB Output is correct
135 Correct 88 ms 35784 KB Output is correct
136 Correct 93 ms 35604 KB Output is correct
137 Correct 97 ms 38460 KB Output is correct
138 Correct 95 ms 36652 KB Output is correct
139 Correct 151 ms 45112 KB Output is correct
140 Correct 147 ms 45240 KB Output is correct
141 Correct 133 ms 42284 KB Output is correct
142 Correct 131 ms 39356 KB Output is correct
143 Correct 102 ms 35068 KB Output is correct
144 Correct 128 ms 51376 KB Output is correct
145 Correct 129 ms 51316 KB Output is correct
146 Correct 116 ms 47792 KB Output is correct
147 Correct 108 ms 41660 KB Output is correct
148 Correct 98 ms 34952 KB Output is correct
149 Correct 92 ms 36244 KB Output is correct
150 Correct 88 ms 36228 KB Output is correct
151 Correct 94 ms 37308 KB Output is correct
152 Correct 95 ms 37056 KB Output is correct
153 Correct 102 ms 35904 KB Output is correct
154 Correct 101 ms 37436 KB Output is correct
155 Correct 97 ms 36024 KB Output is correct
156 Correct 100 ms 37100 KB Output is correct
157 Correct 95 ms 36296 KB Output is correct
158 Correct 92 ms 36296 KB Output is correct