oj.uz

답안 #910240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910240 2024-01-18T02:42:40 Z marvinthang 봉쇄 시간 (IOI23_closing) C++17
83 / 100
 1000 ms 2097152 KB 
/*************************************
*    author: marvinthang             *
*    created: 18.01.2024 09:24:21    *
*************************************/

#include "closing.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 << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { return a > b ? a = b, true : false; }
template <class A, class B> bool maximize(A &a, B b)  { return a < b ? a = b, true : false; }

// end of template

int max_score(int N, int X, int Y, long long K, vector <int> U, vector <int> V, vector <int> W) {
    vector <long long> dx(N), dy(N);
    vector <int> par(N);
    vector <vector <pair <int, int>>> adj(N);
    REP(i, N - 1) {
        adj[U[i]].emplace_back(W[i], V[i]);
        adj[V[i]].emplace_back(W[i], U[i]);
    } 
    function<void(int, vector <long long> &)> dfs = [&] (int u, vector <long long> &dist) {
        for (auto [w, v]: adj[u]) if (v != par[u]) {
            par[v] = u;
            dist[v] = dist[u] + w;
            dfs(v, dist);
        }
    };
    par[X] = -1; dfs(X, dx);
    par[Y] = -1; dfs(Y, dy);

    vector <long long> values(ALL(dx));
    values.insert(values.end(), ALL(dy));
    sort(ALL(values));
    int res = 0;
    long long cur = K;
    for (long long c: values) {
        cur -= c;
        if (cur < 0) break;
        ++res;
    }

    if (dx[Y] > K + K) return res;

    vector <bool> on_path(N);
    for (; X != Y; X = par[X]) on_path[X] = true;
    on_path[X] = true;

    vector dp(N + 1, vector(N + N + 1, K + 1));
    dp[0][0] = 0;
    REP(i, N) REP(j, i + i + 1) if (dp[i][j] <= K) {
        minimize(dp[i + 1][j + 1], dp[i][j] + min(dx[i], dy[i]));
        minimize(dp[i + 1][j + 2], dp[i][j] + max(dx[i], dy[i]));
        if (!on_path[i]) minimize(dp[i + 1][j], dp[i][j]);
    }
    REPD(j, N + N + 1) if (dp[N][j] <= K) {
        maximize(res, j);
        break;
    }
    return res;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 32080 KB Output is correct
2 Correct 171 ms 39140 KB Output is correct
3 Correct 80 ms 2900 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 0 ms 348 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 0 ms 348 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 2 ms 3676 KB Output is correct
21 Correct 3 ms 4132 KB Output is correct
22 Correct 4 ms 4440 KB Output is correct
23 Correct 4 ms 4444 KB Output is correct
24 Correct 3 ms 4444 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 0 ms 348 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 2 ms 3676 KB Output is correct
21 Correct 3 ms 4132 KB Output is correct
22 Correct 4 ms 4440 KB Output is correct
23 Correct 4 ms 4444 KB Output is correct
24 Correct 3 ms 4444 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 81 ms 141836 KB Output is correct
27 Correct 61 ms 122704 KB Output is correct
28 Correct 75 ms 124648 KB Output is correct
29 Correct 77 ms 134532 KB Output is correct
30 Correct 61 ms 121564 KB Output is correct
31 Correct 73 ms 142244 KB Output is correct
32 Correct 72 ms 142116 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 0 ms 344 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 1 ms 348 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 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 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

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 0 ms 344 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 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 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 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
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 568 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 572 KB Output is correct
47 Correct 0 ms 604 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

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 0 ms 344 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 3 ms 4444 KB Output is correct
21 Correct 2 ms 3676 KB Output is correct
22 Correct 3 ms 4132 KB Output is correct
23 Correct 4 ms 4440 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 3 ms 4444 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
35 Correct 0 ms 344 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 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 0 ms 348 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 568 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 572 KB Output is correct
54 Correct 0 ms 604 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 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 1 ms 576 KB Output is correct
60 Correct 1 ms 600 KB Output is correct
61 Correct 1 ms 644 KB Output is correct
62 Correct 1 ms 644 KB Output is correct
63 Correct 3 ms 4440 KB Output is correct
64 Correct 3 ms 3928 KB Output is correct
65 Correct 2 ms 3672 KB Output is correct
66 Correct 3 ms 3932 KB Output is correct
67 Correct 3 ms 4188 KB Output is correct
68 Correct 2 ms 3676 KB Output is correct
69 Correct 3 ms 4188 KB Output is correct
70 Correct 2 ms 3916 KB Output is correct
71 Correct 2 ms 3932 KB Output is correct
72 Correct 3 ms 4188 KB Output is correct
73 Correct 2 ms 2648 KB Output is correct
74 Correct 2 ms 3164 KB Output is correct
75 Correct 1 ms 604 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 0 ms 344 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 3 ms 4444 KB Output is correct
21 Correct 2 ms 3676 KB Output is correct
22 Correct 3 ms 4132 KB Output is correct
23 Correct 4 ms 4440 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 81 ms 141836 KB Output is correct
28 Correct 61 ms 122704 KB Output is correct
29 Correct 75 ms 124648 KB Output is correct
30 Correct 77 ms 134532 KB Output is correct
31 Correct 61 ms 121564 KB Output is correct
32 Correct 73 ms 142244 KB Output is correct
33 Correct 72 ms 142116 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 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 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 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 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 0 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 568 KB Output is correct
55 Correct 1 ms 344 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 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 604 KB Output is correct
61 Correct 1 ms 572 KB Output is correct
62 Correct 0 ms 604 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 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 576 KB Output is correct
68 Correct 1 ms 600 KB Output is correct
69 Correct 1 ms 644 KB Output is correct
70 Correct 1 ms 644 KB Output is correct
71 Correct 3 ms 4440 KB Output is correct
72 Correct 3 ms 3928 KB Output is correct
73 Correct 2 ms 3672 KB Output is correct
74 Correct 3 ms 3932 KB Output is correct
75 Correct 3 ms 4188 KB Output is correct
76 Correct 2 ms 3676 KB Output is correct
77 Correct 3 ms 4188 KB Output is correct
78 Correct 2 ms 3916 KB Output is correct
79 Correct 2 ms 3932 KB Output is correct
80 Correct 3 ms 4188 KB Output is correct
81 Correct 2 ms 2648 KB Output is correct
82 Correct 2 ms 3164 KB Output is correct
83 Correct 1 ms 604 KB Output is correct
84 Correct 2 ms 344 KB Output is correct
85 Correct 6 ms 1628 KB Output is correct
86 Correct 3 ms 648 KB Output is correct
87 Correct 4 ms 824 KB Output is correct
88 Correct 4 ms 844 KB Output is correct
89 Correct 80 ms 141904 KB Output is correct
90 Correct 68 ms 116348 KB Output is correct
91 Correct 73 ms 140372 KB Output is correct
92 Correct 63 ms 122116 KB Output is correct
93 Correct 62 ms 124756 KB Output is correct
94 Correct 70 ms 128588 KB Output is correct
95 Correct 75 ms 134944 KB Output is correct
96 Correct 58 ms 118104 KB Output is correct
97 Correct 81 ms 134580 KB Output is correct
98 Correct 68 ms 130640 KB Output is correct
99 Correct 83 ms 141760 KB Output is correct
100 Correct 40 ms 68700 KB Output is correct
101 Correct 9 ms 4316 KB Output is correct

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 0 ms 344 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 3 ms 4444 KB Output is correct
21 Correct 2 ms 3676 KB Output is correct
22 Correct 3 ms 4132 KB Output is correct
23 Correct 4 ms 4440 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 81 ms 141836 KB Output is correct
28 Correct 61 ms 122704 KB Output is correct
29 Correct 75 ms 124648 KB Output is correct
30 Correct 77 ms 134532 KB Output is correct
31 Correct 61 ms 121564 KB Output is correct
32 Correct 73 ms 142244 KB Output is correct
33 Correct 72 ms 142116 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 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 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 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 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 0 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 568 KB Output is correct
55 Correct 1 ms 344 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 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 604 KB Output is correct
61 Correct 1 ms 572 KB Output is correct
62 Correct 0 ms 604 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 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 576 KB Output is correct
68 Correct 1 ms 600 KB Output is correct
69 Correct 1 ms 644 KB Output is correct
70 Correct 1 ms 644 KB Output is correct
71 Correct 3 ms 4440 KB Output is correct
72 Correct 3 ms 3928 KB Output is correct
73 Correct 2 ms 3672 KB Output is correct
74 Correct 3 ms 3932 KB Output is correct
75 Correct 3 ms 4188 KB Output is correct
76 Correct 2 ms 3676 KB Output is correct
77 Correct 3 ms 4188 KB Output is correct
78 Correct 2 ms 3916 KB Output is correct
79 Correct 2 ms 3932 KB Output is correct
80 Correct 3 ms 4188 KB Output is correct
81 Correct 2 ms 2648 KB Output is correct
82 Correct 2 ms 3164 KB Output is correct
83 Correct 1 ms 604 KB Output is correct
84 Correct 2 ms 344 KB Output is correct
85 Correct 6 ms 1628 KB Output is correct
86 Correct 3 ms 648 KB Output is correct
87 Correct 4 ms 824 KB Output is correct
88 Correct 4 ms 844 KB Output is correct
89 Correct 80 ms 141904 KB Output is correct
90 Correct 68 ms 116348 KB Output is correct
91 Correct 73 ms 140372 KB Output is correct
92 Correct 63 ms 122116 KB Output is correct
93 Correct 62 ms 124756 KB Output is correct
94 Correct 70 ms 128588 KB Output is correct
95 Correct 75 ms 134944 KB Output is correct
96 Correct 58 ms 118104 KB Output is correct
97 Correct 81 ms 134580 KB Output is correct
98 Correct 68 ms 130640 KB Output is correct
99 Correct 83 ms 141760 KB Output is correct
100 Correct 40 ms 68700 KB Output is correct
101 Correct 9 ms 4316 KB Output is correct
102 Correct 150 ms 3228 KB Output is correct
103 Correct 556 ms 5520 KB Output is correct
104 Execution timed out 1089 ms 2097152 KB Time limit exceeded
105 Halted 0 ms 0 KB -