oj.uz

Submission #914328

# Submission time Handle Problem Language Result Execution time Memory
914328 2024-01-21T16:12:40 Z marvinthang Beech Tree (IOI23_beechtree) C++17
100 / 100
 586 ms 105552 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 <set <pair <int, int>>> order(N);
    vector <int> sz(N, 1);
    vector <vector <pair <int, int>>> adj(N);
    vector <int> res(N, 1);
    REPD(u, N) {
        if (res[u]) {
            sort(ALL(adj[u]));
            REP(i, (int) adj[u].size() - 1) if (adj[u][i].fi == adj[u][i + 1].fi) {
                res[u] = 0;
                break;
            }
            if (res[u]) {
                order[u].emplace(sz[u], u);
                --C[u];
                if (u) {
                    sz[P[u]] += sz[u];
                    adj[P[u]].emplace_back(C[u], u);
                }
                continue;
            }
        }
        if (u) res[P[u]] = 0;
    }
    auto is_subtree = [&] (int u, int v) {
        for (auto &[w, x]: adj[v]) {
            auto p = lower_bound(ALL(adj[u]), pair{w, -1});
            if (p == adj[u].end() || p->fi != w || sz[p->se] < sz[x]) return false;
        }
        return true;
    };
    FORD(u, N, 1) {
        if (!res[u]) {
            res[P[u]] = 0;
            continue;
        }
        if (!res[P[u]]) continue;
        if (order[u].size() > order[P[u]].size()) order[u].swap(order[P[u]]);
        for (auto &v: order[u]) {
            auto it = order[P[u]].insert(v).fi;
            if (it != order[P[u]].begin() && !is_subtree(v.se, prev(it)->se)) {
                res[P[u]] = 0;
                break;
            }
            if (next(it) != order[P[u]].end() && !is_subtree(next(it)->se, v.se)) {
                res[P[u]] = 0;
                break;
            }
        }
    }
    return res;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory 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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
7 Correct 1 ms 344 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 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 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 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 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 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 1 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 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 0 ms 348 KB Output is correct
7 Correct 83 ms 34768 KB Output is correct
8 Correct 78 ms 34732 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 123 ms 44112 KB Output is correct
18 Correct 104 ms 41184 KB Output is correct
19 Correct 83 ms 36292 KB Output is correct
20 Correct 78 ms 34640 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 392 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 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 61 ms 22620 KB Output is correct
16 Correct 59 ms 19796 KB Output is correct
17 Correct 70 ms 24148 KB Output is correct
18 Correct 78 ms 25424 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 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 83 ms 34768 KB Output is correct
6 Correct 78 ms 34732 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 104 ms 37400 KB Output is correct
12 Correct 109 ms 34900 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory 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 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 1 ms 344 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 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 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 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 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 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 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 392 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 0 ms 348 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 600 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 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 1 ms 380 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 1 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 0 ms 348 KB Output is correct
3 Correct 1 ms 344 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 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 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 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 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 3 ms 1052 KB Output is correct
35 Correct 2 ms 1024 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 1 ms 604 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory 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 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 1 ms 344 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 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 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 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 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 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 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 860 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 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 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 392 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 344 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 2 ms 604 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 2 ms 604 KB Output is correct
63 Correct 1 ms 604 KB Output is correct
64 Correct 1 ms 600 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 380 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 1 ms 860 KB Output is correct
76 Correct 1 ms 604 KB Output is correct
77 Correct 1 ms 600 KB Output is correct
78 Correct 1 ms 604 KB Output is correct
79 Correct 1 ms 860 KB Output is correct
80 Correct 1 ms 860 KB Output is correct
81 Correct 2 ms 1116 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 1 ms 860 KB Output is correct
84 Correct 3 ms 1052 KB Output is correct
85 Correct 2 ms 1024 KB Output is correct
86 Correct 2 ms 860 KB Output is correct
87 Correct 2 ms 860 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 2 ms 860 KB Output is correct
90 Correct 2 ms 860 KB Output is correct
91 Correct 2 ms 1116 KB Output is correct
92 Correct 2 ms 856 KB Output is correct
93 Correct 2 ms 860 KB Output is correct
94 Correct 3 ms 860 KB Output is correct
95 Correct 2 ms 860 KB Output is correct
96 Correct 2 ms 860 KB Output is correct
97 Correct 1 ms 860 KB Output is correct
98 Correct 1 ms 604 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 0 ms 348 KB Output is correct
3 Correct 1 ms 344 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 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 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 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 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 3 ms 1052 KB Output is correct
35 Correct 2 ms 1024 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 134 ms 44268 KB Output is correct
40 Correct 101 ms 40352 KB Output is correct
41 Correct 99 ms 39120 KB Output is correct
42 Correct 75 ms 34752 KB Output is correct
43 Correct 140 ms 47576 KB Output is correct
44 Correct 120 ms 46804 KB Output is correct
45 Correct 586 ms 97464 KB Output is correct
46 Correct 239 ms 76312 KB Output is correct
47 Correct 211 ms 67472 KB Output is correct
48 Correct 167 ms 55380 KB Output is correct
49 Correct 122 ms 44460 KB Output is correct
50 Correct 558 ms 105552 KB Output is correct
51 Correct 295 ms 87364 KB Output is correct
52 Correct 247 ms 70868 KB Output is correct
53 Correct 174 ms 56252 KB Output is correct
54 Correct 121 ms 43860 KB Output is correct
55 Correct 96 ms 38224 KB Output is correct
56 Correct 99 ms 38488 KB Output is correct
57 Correct 96 ms 38264 KB Output is correct
58 Correct 93 ms 38368 KB Output is correct
59 Correct 92 ms 38228 KB Output is correct
60 Correct 95 ms 38224 KB Output is correct
61 Correct 100 ms 38072 KB Output is correct
62 Correct 98 ms 37972 KB Output is correct
63 Correct 130 ms 47968 KB Output is correct
64 Correct 105 ms 42068 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory 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 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 1 ms 344 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 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 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 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 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 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 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 83 ms 34768 KB Output is correct
39 Correct 78 ms 34732 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 468 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 860 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 123 ms 44112 KB Output is correct
49 Correct 104 ms 41184 KB Output is correct
50 Correct 83 ms 36292 KB Output is correct
51 Correct 78 ms 34640 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 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 392 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 344 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 2 ms 604 KB Output is correct
63 Correct 1 ms 604 KB Output is correct
64 Correct 1 ms 604 KB Output is correct
65 Correct 2 ms 604 KB Output is correct
66 Correct 61 ms 22620 KB Output is correct
67 Correct 59 ms 19796 KB Output is correct
68 Correct 70 ms 24148 KB Output is correct
69 Correct 78 ms 25424 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 1 ms 604 KB Output is correct
74 Correct 104 ms 37400 KB Output is correct
75 Correct 109 ms 34900 KB Output is correct
76 Correct 1 ms 600 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 1 ms 380 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 1 ms 348 KB Output is correct
87 Correct 1 ms 860 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1 ms 600 KB Output is correct
90 Correct 1 ms 604 KB Output is correct
91 Correct 1 ms 860 KB Output is correct
92 Correct 1 ms 860 KB Output is correct
93 Correct 2 ms 1116 KB Output is correct
94 Correct 2 ms 860 KB Output is correct
95 Correct 1 ms 860 KB Output is correct
96 Correct 3 ms 1052 KB Output is correct
97 Correct 2 ms 1024 KB Output is correct
98 Correct 2 ms 860 KB Output is correct
99 Correct 2 ms 860 KB Output is correct
100 Correct 1 ms 604 KB Output is correct
101 Correct 2 ms 860 KB Output is correct
102 Correct 2 ms 860 KB Output is correct
103 Correct 2 ms 1116 KB Output is correct
104 Correct 2 ms 856 KB Output is correct
105 Correct 2 ms 860 KB Output is correct
106 Correct 3 ms 860 KB Output is correct
107 Correct 2 ms 860 KB Output is correct
108 Correct 2 ms 860 KB Output is correct
109 Correct 1 ms 860 KB Output is correct
110 Correct 1 ms 604 KB Output is correct
111 Correct 134 ms 44268 KB Output is correct
112 Correct 101 ms 40352 KB Output is correct
113 Correct 99 ms 39120 KB Output is correct
114 Correct 75 ms 34752 KB Output is correct
115 Correct 140 ms 47576 KB Output is correct
116 Correct 120 ms 46804 KB Output is correct
117 Correct 586 ms 97464 KB Output is correct
118 Correct 239 ms 76312 KB Output is correct
119 Correct 211 ms 67472 KB Output is correct
120 Correct 167 ms 55380 KB Output is correct
121 Correct 122 ms 44460 KB Output is correct
122 Correct 558 ms 105552 KB Output is correct
123 Correct 295 ms 87364 KB Output is correct
124 Correct 247 ms 70868 KB Output is correct
125 Correct 174 ms 56252 KB Output is correct
126 Correct 121 ms 43860 KB Output is correct
127 Correct 96 ms 38224 KB Output is correct
128 Correct 99 ms 38488 KB Output is correct
129 Correct 96 ms 38264 KB Output is correct
130 Correct 93 ms 38368 KB Output is correct
131 Correct 92 ms 38228 KB Output is correct
132 Correct 95 ms 38224 KB Output is correct
133 Correct 100 ms 38072 KB Output is correct
134 Correct 98 ms 37972 KB Output is correct
135 Correct 130 ms 47968 KB Output is correct
136 Correct 105 ms 42068 KB Output is correct
137 Correct 166 ms 52880 KB Output is correct
138 Correct 124 ms 48212 KB Output is correct
139 Correct 565 ms 98644 KB Output is correct
140 Correct 260 ms 79752 KB Output is correct
141 Correct 209 ms 66388 KB Output is correct
142 Correct 178 ms 54868 KB Output is correct
143 Correct 124 ms 43484 KB Output is correct
144 Correct 410 ms 93004 KB Output is correct
145 Correct 259 ms 78520 KB Output is correct
146 Correct 219 ms 69468 KB Output is correct
147 Correct 177 ms 56148 KB Output is correct
148 Correct 112 ms 42176 KB Output is correct
149 Correct 100 ms 37960 KB Output is correct
150 Correct 98 ms 37972 KB Output is correct
151 Correct 98 ms 38324 KB Output is correct
152 Correct 94 ms 38300 KB Output is correct
153 Correct 94 ms 38224 KB Output is correct
154 Correct 100 ms 38344 KB Output is correct
155 Correct 95 ms 38224 KB Output is correct
156 Correct 93 ms 38084 KB Output is correct
157 Correct 136 ms 47952 KB Output is correct
158 Correct 108 ms 41868 KB Output is correct