oj.uz

답안 #914347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914347 2024-01-21T17:17:41 Z marvinthang 참나무 (IOI23_beechtree) C++17
100 / 100
 218 ms 58284 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

# 결과 실행 시간 메모리 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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 516 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 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 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 1 ms 600 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 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 348 KB Output is correct
26 Correct 0 ms 420 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 516 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 85 ms 42952 KB Output is correct
8 Correct 84 ms 42952 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 2 ms 1628 KB Output is correct
14 Correct 1 ms 1624 KB Output is correct
15 Correct 2 ms 1628 KB Output is correct
16 Correct 2 ms 1628 KB Output is correct
17 Correct 104 ms 42948 KB Output is correct
18 Correct 94 ms 43076 KB Output is correct
19 Correct 88 ms 42948 KB Output is correct
20 Correct 95 ms 43088 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 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 428 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1372 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 44 ms 20424 KB Output is correct
16 Correct 39 ms 18632 KB Output is correct
17 Correct 40 ms 20424 KB Output is correct
18 Correct 41 ms 19656 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 85 ms 42952 KB Output is correct
6 Correct 84 ms 42952 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct
11 Correct 103 ms 37428 KB Output is correct
12 Correct 76 ms 34740 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 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 344 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 516 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 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 1 ms 600 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 420 KB Output is correct
30 Correct 1 ms 344 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 344 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 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 600 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 428 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 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 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 348 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 1 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 420 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 600 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 2 ms 604 KB Output is correct
30 Correct 1 ms 600 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 604 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 2 ms 704 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 2 ms 604 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 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 344 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 516 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 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 1 ms 600 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 420 KB Output is correct
30 Correct 1 ms 344 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 344 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 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 2 ms 1628 KB Output is correct
43 Correct 1 ms 1624 KB Output is correct
44 Correct 2 ms 1628 KB Output is correct
45 Correct 2 ms 1628 KB Output is correct
46 Correct 0 ms 600 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 428 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 1372 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 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 2 ms 1372 KB Output is correct
63 Correct 2 ms 1372 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 1 ms 600 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 2 ms 604 KB Output is correct
80 Correct 1 ms 600 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 604 KB Output is correct
84 Correct 1 ms 860 KB Output is correct
85 Correct 2 ms 704 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 1 ms 604 KB Output is correct
88 Correct 2 ms 604 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 1624 KB Output is correct
93 Correct 2 ms 1372 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 2 ms 1368 KB Output is correct
98 Correct 2 ms 1372 KB Output is correct

Subtask #8
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 1 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 420 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 600 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 2 ms 604 KB Output is correct
30 Correct 1 ms 600 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 604 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 2 ms 704 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 98 ms 42316 KB Output is correct
40 Correct 94 ms 42076 KB Output is correct
41 Correct 104 ms 42312 KB Output is correct
42 Correct 99 ms 42320 KB Output is correct
43 Correct 96 ms 39212 KB Output is correct
44 Correct 101 ms 36036 KB Output is correct
45 Correct 218 ms 53484 KB Output is correct
46 Correct 144 ms 50096 KB Output is correct
47 Correct 128 ms 44328 KB Output is correct
48 Correct 123 ms 39964 KB Output is correct
49 Correct 118 ms 35516 KB Output is correct
50 Correct 186 ms 58284 KB Output is correct
51 Correct 149 ms 55724 KB Output is correct
52 Correct 116 ms 48936 KB Output is correct
53 Correct 107 ms 41408 KB Output is correct
54 Correct 97 ms 34232 KB Output is correct
55 Correct 85 ms 36292 KB Output is correct
56 Correct 87 ms 35780 KB Output is correct
57 Correct 87 ms 35776 KB Output is correct
58 Correct 98 ms 36024 KB Output is correct
59 Correct 93 ms 35520 KB Output is correct
60 Correct 96 ms 36976 KB Output is correct
61 Correct 96 ms 35120 KB Output is correct
62 Correct 104 ms 36056 KB Output is correct
63 Correct 88 ms 35528 KB Output is correct
64 Correct 86 ms 35408 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 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 344 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 516 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 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 1 ms 600 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 420 KB Output is correct
30 Correct 1 ms 344 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 344 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 85 ms 42952 KB Output is correct
39 Correct 84 ms 42952 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 2 ms 1628 KB Output is correct
45 Correct 1 ms 1624 KB Output is correct
46 Correct 2 ms 1628 KB Output is correct
47 Correct 2 ms 1628 KB Output is correct
48 Correct 104 ms 42948 KB Output is correct
49 Correct 94 ms 43076 KB Output is correct
50 Correct 88 ms 42948 KB Output is correct
51 Correct 95 ms 43088 KB Output is correct
52 Correct 0 ms 600 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 0 ms 428 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1 ms 1372 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 44 ms 20424 KB Output is correct
67 Correct 39 ms 18632 KB Output is correct
68 Correct 40 ms 20424 KB Output is correct
69 Correct 41 ms 19656 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 2 ms 1372 KB Output is correct
73 Correct 2 ms 1372 KB Output is correct
74 Correct 103 ms 37428 KB Output is correct
75 Correct 76 ms 34740 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 1 ms 348 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 1 ms 348 KB Output is correct
87 Correct 1 ms 600 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 2 ms 604 KB Output is correct
92 Correct 1 ms 600 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 604 KB Output is correct
96 Correct 1 ms 860 KB Output is correct
97 Correct 2 ms 704 KB Output is correct
98 Correct 1 ms 604 KB Output is correct
99 Correct 1 ms 604 KB Output is correct
100 Correct 2 ms 604 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 1624 KB Output is correct
105 Correct 2 ms 1372 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 2 ms 1368 KB Output is correct
110 Correct 2 ms 1372 KB Output is correct
111 Correct 98 ms 42316 KB Output is correct
112 Correct 94 ms 42076 KB Output is correct
113 Correct 104 ms 42312 KB Output is correct
114 Correct 99 ms 42320 KB Output is correct
115 Correct 96 ms 39212 KB Output is correct
116 Correct 101 ms 36036 KB Output is correct
117 Correct 218 ms 53484 KB Output is correct
118 Correct 144 ms 50096 KB Output is correct
119 Correct 128 ms 44328 KB Output is correct
120 Correct 123 ms 39964 KB Output is correct
121 Correct 118 ms 35516 KB Output is correct
122 Correct 186 ms 58284 KB Output is correct
123 Correct 149 ms 55724 KB Output is correct
124 Correct 116 ms 48936 KB Output is correct
125 Correct 107 ms 41408 KB Output is correct
126 Correct 97 ms 34232 KB Output is correct
127 Correct 85 ms 36292 KB Output is correct
128 Correct 87 ms 35780 KB Output is correct
129 Correct 87 ms 35776 KB Output is correct
130 Correct 98 ms 36024 KB Output is correct
131 Correct 93 ms 35520 KB Output is correct
132 Correct 96 ms 36976 KB Output is correct
133 Correct 96 ms 35120 KB Output is correct
134 Correct 104 ms 36056 KB Output is correct
135 Correct 88 ms 35528 KB Output is correct
136 Correct 86 ms 35408 KB Output is correct
137 Correct 108 ms 37936 KB Output is correct
138 Correct 103 ms 37064 KB Output is correct
139 Correct 149 ms 44980 KB Output is correct
140 Correct 135 ms 45240 KB Output is correct
141 Correct 141 ms 42532 KB Output is correct
142 Correct 148 ms 39436 KB Output is correct
143 Correct 103 ms 35016 KB Output is correct
144 Correct 126 ms 52144 KB Output is correct
145 Correct 144 ms 52280 KB Output is correct
146 Correct 116 ms 46744 KB Output is correct
147 Correct 112 ms 41912 KB Output is correct
148 Correct 111 ms 35196 KB Output is correct
149 Correct 92 ms 36292 KB Output is correct
150 Correct 87 ms 36760 KB Output is correct
151 Correct 91 ms 36916 KB Output is correct
152 Correct 105 ms 36576 KB Output is correct
153 Correct 99 ms 37056 KB Output is correct
154 Correct 96 ms 36292 KB Output is correct
155 Correct 97 ms 36900 KB Output is correct
156 Correct 116 ms 37236 KB Output is correct
157 Correct 90 ms 36808 KB Output is correct
158 Correct 88 ms 36504 KB Output is correct