oj.uz

답안 #999160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999160 2024-06-15T07:31:51 Z mdn2002 봉쇄 시간 (IOI23_closing) C++17
83 / 100
 1000 ms 567888 KB 
/*
Mayoeba Yabureru
*/
#include<bits/stdc++.h>
using namespace std;

long long dp[3003][6003][2][2];
int max_score(int n, int x, int y, long long k, vector<int> U, vector<int> V, vector<int> W) {
    x ++, y ++;
    vector dis(n + 1, vector<long long>(2));
    vector<vector<pair<int, long long>>> gr(n + 1);

    for (int i = 0; i < n - 1; i ++) {
        int u = U[i] + 1, v = V[i] + 1, w = W[i];
        gr[u].push_back({v, w});
        gr[v].push_back({u, w});
    }

    function<void(int, int, int)> dfs = [&] (int v, int p, int wt) {
        for (auto [u, w] : gr[v]) {
            if (u == p) continue;
            dis[u][wt] = dis[v][wt] + w;
            dfs(u, v, wt);
        }
    };
    dfs(x, 0, 0), dfs(y, 0, 1);

    vector<int> vc, path, onpath(n + 1);
    function<void(int, int)> go = [&] (int v, int p) {
        vc.push_back(v);
        if (v == y) path = vc;
        for (auto [u, w] : gr[v]) {
            if (u == p) continue;
            go(u, v);
        }
        vc.pop_back();
    };
    go(x, 0);

    long long minstart = 0, mn = 1e15;
    for (int i = 1; i <= n; i ++) {
        if (max(dis[i][0], dis[i][1]) < mn) {
            minstart = i;
            mn = max(dis[i][0], dis[i][1]);
        }
    }

    long long sum = max(dis[minstart][0], dis[minstart][1]);
    for (auto x : path) {
        onpath[x] += 1;
        if (x == minstart) break;
        sum += dis[x][0];
    }
    for (int i = path.size() - 1; i >= 0; i --) {
        int x = path[i];
        onpath[x] += 2;
        if (x == minstart) break;
        sum += dis[x][1];
    }

    int ans = 0;
    function f = [&] {
        vector<int> did(n + 1);
        multiset<pair<long long, int>> s;
        for (int i = 1; i <= n; i ++) {
            s.insert({dis[i][0], i});
            s.insert({dis[i][1], i});
        }
        int cnt = 0;
        vector<int> v;

        while (s.size()) {
            auto [x, y] = *s.begin();
            s.erase(s.begin());
            if (did[y]) continue;
            if (x > k) break;
            k -= x;
            did[y] = 1;
            cnt ++;
        }
        if (k >= 0) return cnt;
        return -100000000;
    };

    long long kk = k;
    ans = f();
    k = kk;
    if (sum > k) return ans;
    for (int i = 1; i <= n; i ++) {
        for (int j = 0; j <= 2 * n; j ++) {
            dp[i][j][0][0] = dp[i][j][0][1] = dp[i][j][1][0] = dp[i][j][1][1] = 1e16;
        }
    }
    vector dpp(2 * (n + 1), vector (2, vector<long long>(2, 1e16)));

    vector<int> siz(n + 1);
    function<void(int, int)> calcsiz = [&] (int x, int p) {
        siz[x] = 1;
        for (auto [u, w] : gr[x]) {
            if (u == p) continue;
            calcsiz(u, x);
            siz[x] += siz[u];
        }
    };
    calcsiz(minstart, 0);

    map<vector<int>, int> did;
    function<void(int, int, int, int)> calc = [&] (int x, int p, int rx, int ry) {
        if (did[{x, rx, ry}]) return;
        did[{x, rx, ry}] = 1;
        if (rx == 0 && ry == 0) dp[x][0][rx][ry] = 0;
        if (rx && ry == 0) dp[x][1][rx][ry] = min(dp[x][1][rx][ry], dis[x][0]);
        if (ry && rx == 0) dp[x][1][rx][ry] = min(dp[x][1][rx][ry], dis[x][1]);
        if (rx && ry) dp[x][2][rx][ry] = min(dp[x][2][rx][ry], max(dis[x][0], dis[x][1]));

        int sumsiz = 1;
        for (auto [u, w] : gr[x]) {
            if (u == p) continue;
            calc(u, x, rx, ry);
            if (rx && ry) {
                if (onpath[u] == 0) calc(u, x, 0, 0);
                if (onpath[u] != 1) calc(u, x, 0, 1);
                if (onpath[u] != 2) calc(u, x, 1, 0);
            }
            else if (rx && onpath[u] != 1) calc(u, x, 0, ry);
            else if (ry && onpath[u] != 2) calc(u, x, rx, 0);

            for (int i = 0; i <= rx; i ++) {
                for (int j = 0; j <= ry; j ++) {
                    for (int z = 2 * siz[u]; z >= 0; z --) {
                        for (int k = 2 * sumsiz; k >= 0; k --) {
                            dpp[k + z][rx][ry] = min(dpp[k + z][rx][ry], dp[x][k][rx][ry] + dp[u][z][i][j]);
                        }
                    }
                }
            }
            sumsiz += siz[u];
            for (int z = 0; z <= 2 * sumsiz; z ++) {
                dp[x][z][rx][ry] = dpp[z][rx][ry];
                dpp[z][rx][ry] = 1e16;
            }
        }
    };
    calc(minstart, 0, 1, 1);

    for (int i = 0; i <= 2 * n; i ++) {
        if (k >= dp[minstart][i][1][1]) ans = max(ans, i);
    }
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 67672 KB Output is correct
2 Correct 298 ms 76756 KB Output is correct
3 Correct 110 ms 5204 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 1 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 1 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 3 ms 22876 KB Output is correct
13 Correct 2 ms 20828 KB Output is correct
14 Correct 2 ms 20824 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 20 ms 97372 KB Output is correct
20 Correct 19 ms 89176 KB Output is correct
21 Correct 15 ms 93072 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 1 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 3 ms 22876 KB Output is correct
13 Correct 2 ms 20828 KB Output is correct
14 Correct 2 ms 20824 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 20 ms 97372 KB Output is correct
20 Correct 19 ms 89176 KB Output is correct
21 Correct 15 ms 93072 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 12 ms 12636 KB Output is correct
26 Correct 619 ms 567888 KB Output is correct
27 Correct 537 ms 512492 KB Output is correct
28 Correct 358 ms 517620 KB Output is correct
29 Correct 436 ms 552020 KB Output is correct
30 Correct 2 ms 3420 KB Output is correct
31 Correct 2 ms 3676 KB Output is correct
32 Correct 2 ms 3420 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 0 ms 4444 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 2 ms 20828 KB Output is correct
15 Correct 2 ms 20824 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 0 ms 4444 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6488 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 0 ms 2396 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 10588 KB Output is correct
39 Correct 2 ms 23024 KB Output is correct
40 Correct 2 ms 20828 KB Output is correct
41 Correct 2 ms 22876 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 3 ms 20828 KB Output is correct
44 Correct 2 ms 20828 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 3 ms 20828 KB Output is correct
47 Correct 3 ms 22876 KB Output is correct
48 Correct 2 ms 18780 KB Output is correct
49 Correct 2 ms 14684 KB Output is correct
50 Correct 1 ms 8540 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 2 ms 20828 KB Output is correct
15 Correct 2 ms 20824 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 20 ms 97372 KB Output is correct
21 Correct 19 ms 89176 KB Output is correct
22 Correct 15 ms 93072 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 0 ms 4444 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6488 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 0 ms 2396 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6492 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 1 ms 6492 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 1 ms 6492 KB Output is correct
44 Correct 1 ms 6492 KB Output is correct
45 Correct 1 ms 10588 KB Output is correct
46 Correct 2 ms 23024 KB Output is correct
47 Correct 2 ms 20828 KB Output is correct
48 Correct 2 ms 22876 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 3 ms 20828 KB Output is correct
51 Correct 2 ms 20828 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 3 ms 20828 KB Output is correct
54 Correct 3 ms 22876 KB Output is correct
55 Correct 2 ms 18780 KB Output is correct
56 Correct 2 ms 14684 KB Output is correct
57 Correct 1 ms 8540 KB Output is correct
58 Correct 2 ms 8540 KB Output is correct
59 Correct 4 ms 20976 KB Output is correct
60 Correct 5 ms 23036 KB Output is correct
61 Correct 6 ms 31324 KB Output is correct
62 Correct 6 ms 31324 KB Output is correct
63 Correct 19 ms 97192 KB Output is correct
64 Correct 16 ms 90968 KB Output is correct
65 Correct 15 ms 89056 KB Output is correct
66 Correct 15 ms 90972 KB Output is correct
67 Correct 1 ms 2396 KB Output is correct
68 Correct 17 ms 88980 KB Output is correct
69 Correct 18 ms 97120 KB Output is correct
70 Correct 1 ms 2396 KB Output is correct
71 Correct 1 ms 2396 KB Output is correct
72 Correct 15 ms 95244 KB Output is correct
73 Correct 14 ms 76632 KB Output is correct
74 Correct 14 ms 80732 KB Output is correct
75 Correct 4 ms 22872 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 2 ms 20828 KB Output is correct
15 Correct 2 ms 20824 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 20 ms 97372 KB Output is correct
21 Correct 19 ms 89176 KB Output is correct
22 Correct 15 ms 93072 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 12 ms 12636 KB Output is correct
27 Correct 619 ms 567888 KB Output is correct
28 Correct 537 ms 512492 KB Output is correct
29 Correct 358 ms 517620 KB Output is correct
30 Correct 436 ms 552020 KB Output is correct
31 Correct 2 ms 3420 KB Output is correct
32 Correct 2 ms 3676 KB Output is correct
33 Correct 2 ms 3420 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 0 ms 4444 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6488 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 1 ms 6492 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 1 ms 6492 KB Output is correct
44 Correct 0 ms 2396 KB Output is correct
45 Correct 1 ms 6492 KB Output is correct
46 Correct 1 ms 6492 KB Output is correct
47 Correct 1 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 1 ms 6492 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Correct 1 ms 6492 KB Output is correct
52 Correct 1 ms 6492 KB Output is correct
53 Correct 1 ms 10588 KB Output is correct
54 Correct 2 ms 23024 KB Output is correct
55 Correct 2 ms 20828 KB Output is correct
56 Correct 2 ms 22876 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 3 ms 20828 KB Output is correct
59 Correct 2 ms 20828 KB Output is correct
60 Correct 1 ms 2396 KB Output is correct
61 Correct 3 ms 20828 KB Output is correct
62 Correct 3 ms 22876 KB Output is correct
63 Correct 2 ms 18780 KB Output is correct
64 Correct 2 ms 14684 KB Output is correct
65 Correct 1 ms 8540 KB Output is correct
66 Correct 2 ms 8540 KB Output is correct
67 Correct 4 ms 20976 KB Output is correct
68 Correct 5 ms 23036 KB Output is correct
69 Correct 6 ms 31324 KB Output is correct
70 Correct 6 ms 31324 KB Output is correct
71 Correct 19 ms 97192 KB Output is correct
72 Correct 16 ms 90968 KB Output is correct
73 Correct 15 ms 89056 KB Output is correct
74 Correct 15 ms 90972 KB Output is correct
75 Correct 1 ms 2396 KB Output is correct
76 Correct 17 ms 88980 KB Output is correct
77 Correct 18 ms 97120 KB Output is correct
78 Correct 1 ms 2396 KB Output is correct
79 Correct 1 ms 2396 KB Output is correct
80 Correct 15 ms 95244 KB Output is correct
81 Correct 14 ms 76632 KB Output is correct
82 Correct 14 ms 80732 KB Output is correct
83 Correct 4 ms 22872 KB Output is correct
84 Correct 11 ms 12632 KB Output is correct
85 Correct 32 ms 56104 KB Output is correct
86 Correct 17 ms 23132 KB Output is correct
87 Correct 22 ms 31372 KB Output is correct
88 Correct 19 ms 31372 KB Output is correct
89 Correct 492 ms 567244 KB Output is correct
90 Correct 422 ms 490836 KB Output is correct
91 Correct 437 ms 566168 KB Output is correct
92 Correct 459 ms 510552 KB Output is correct
93 Correct 3 ms 3164 KB Output is correct
94 Correct 459 ms 531540 KB Output is correct
95 Correct 390 ms 553040 KB Output is correct
96 Correct 3 ms 3416 KB Output is correct
97 Correct 367 ms 550956 KB Output is correct
98 Correct 354 ms 538708 KB Output is correct
99 Correct 729 ms 567388 KB Output is correct
100 Correct 197 ms 335440 KB Output is correct
101 Correct 55 ms 97328 KB Output is correct

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 2 ms 20828 KB Output is correct
15 Correct 2 ms 20824 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 20 ms 97372 KB Output is correct
21 Correct 19 ms 89176 KB Output is correct
22 Correct 15 ms 93072 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 12 ms 12636 KB Output is correct
27 Correct 619 ms 567888 KB Output is correct
28 Correct 537 ms 512492 KB Output is correct
29 Correct 358 ms 517620 KB Output is correct
30 Correct 436 ms 552020 KB Output is correct
31 Correct 2 ms 3420 KB Output is correct
32 Correct 2 ms 3676 KB Output is correct
33 Correct 2 ms 3420 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 0 ms 4444 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6488 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 1 ms 6492 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 1 ms 6492 KB Output is correct
44 Correct 0 ms 2396 KB Output is correct
45 Correct 1 ms 6492 KB Output is correct
46 Correct 1 ms 6492 KB Output is correct
47 Correct 1 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 1 ms 6492 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Correct 1 ms 6492 KB Output is correct
52 Correct 1 ms 6492 KB Output is correct
53 Correct 1 ms 10588 KB Output is correct
54 Correct 2 ms 23024 KB Output is correct
55 Correct 2 ms 20828 KB Output is correct
56 Correct 2 ms 22876 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 3 ms 20828 KB Output is correct
59 Correct 2 ms 20828 KB Output is correct
60 Correct 1 ms 2396 KB Output is correct
61 Correct 3 ms 20828 KB Output is correct
62 Correct 3 ms 22876 KB Output is correct
63 Correct 2 ms 18780 KB Output is correct
64 Correct 2 ms 14684 KB Output is correct
65 Correct 1 ms 8540 KB Output is correct
66 Correct 2 ms 8540 KB Output is correct
67 Correct 4 ms 20976 KB Output is correct
68 Correct 5 ms 23036 KB Output is correct
69 Correct 6 ms 31324 KB Output is correct
70 Correct 6 ms 31324 KB Output is correct
71 Correct 19 ms 97192 KB Output is correct
72 Correct 16 ms 90968 KB Output is correct
73 Correct 15 ms 89056 KB Output is correct
74 Correct 15 ms 90972 KB Output is correct
75 Correct 1 ms 2396 KB Output is correct
76 Correct 17 ms 88980 KB Output is correct
77 Correct 18 ms 97120 KB Output is correct
78 Correct 1 ms 2396 KB Output is correct
79 Correct 1 ms 2396 KB Output is correct
80 Correct 15 ms 95244 KB Output is correct
81 Correct 14 ms 76632 KB Output is correct
82 Correct 14 ms 80732 KB Output is correct
83 Correct 4 ms 22872 KB Output is correct
84 Correct 11 ms 12632 KB Output is correct
85 Correct 32 ms 56104 KB Output is correct
86 Correct 17 ms 23132 KB Output is correct
87 Correct 22 ms 31372 KB Output is correct
88 Correct 19 ms 31372 KB Output is correct
89 Correct 492 ms 567244 KB Output is correct
90 Correct 422 ms 490836 KB Output is correct
91 Correct 437 ms 566168 KB Output is correct
92 Correct 459 ms 510552 KB Output is correct
93 Correct 3 ms 3164 KB Output is correct
94 Correct 459 ms 531540 KB Output is correct
95 Correct 390 ms 553040 KB Output is correct
96 Correct 3 ms 3416 KB Output is correct
97 Correct 367 ms 550956 KB Output is correct
98 Correct 354 ms 538708 KB Output is correct
99 Correct 729 ms 567388 KB Output is correct
100 Correct 197 ms 335440 KB Output is correct
101 Correct 55 ms 97328 KB Output is correct
102 Correct 815 ms 25684 KB Output is correct
103 Execution timed out 1048 ms 80976 KB Time limit exceeded
104 Halted 0 ms 0 KB -