oj.uz

Submission #850436

# Submission time Handle Problem Language Result Execution time Memory
850436 2023-09-16T14:44:25 Z eltu0815 Closing Time (IOI23_closing) C++17
83 / 100
 1000 ms 36808 KB 
#include "closing.h"

#include <bits/stdc++.h>
#define MAX 200005
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

int visited[MAX], parent[MAX];
vector<pii> graph[MAX];

ll tmp[MAX];
ll cost1[MAX], cost2[MAX];
ll dist1[MAX], dist2[MAX];

void init(int node, int par) {
    parent[node] = par;
    for(auto [v, w] : graph[node]) if(v != par) init(v, node);
}

void dfs(int node, int par, ll dist[]) {
    for(auto [v, w] : graph[node]) if(v != par) {
        dist[v] = dist[node] + w;
        dfs(v, node, dist);
    }
}

ll c[MAX];
vector<int> path;

int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
    path.clear();
    for(int i = 0; i < N; ++i) graph[i].clear();
    for(int i = 0; i < N; ++i) dist1[i] = dist2[i] = visited[i] = c[i] = 0;
    for(int i = 0; i < N - 1; ++i) {
        graph[U[i]].push_back({V[i], W[i]});
        graph[V[i]].push_back({U[i], W[i]});
    }
    
    init(0, -1);
    dfs(X, -1, dist1);
    dfs(Y, -1, dist2);
    
    int mx = 0; ll sum = 0;
    priority_queue<pair<ll, int> > pq;
    pq.push({0, X}); pq.push({0, Y});
    while(!pq.empty()) {
        ll d = -pq.top().first;
        int node = pq.top().second;
        pq.pop();
        
        if(sum + d > K) break;
        ++mx; sum += d; visited[node] = 1;
        for(auto [v, w] : graph[node]) {
            if(visited[v]) continue;
            pq.push({-(d + w), v});
        }
    }
    
    if(dist1[Y] > 2 * K) return mx;
    
    int node = X;
    for(int i = 0; i < N; ++i) visited[i] = 0;
    while(node != -1) visited[node]++, node = parent[node];
    
    node = Y; int flag = 0;
    while(node != -1) {
        if(visited[node] == 1 && !flag) flag = 1;
        else if(flag) visited[node]--;
        else visited[node]++;
        node = parent[node];
    }
    
    node = X;
    while(node != -1 && visited[node]) {
        path.push_back(node);
        node = parent[node];
    }
    path.pop_back();
    
    node = Y;
    vector<int> path2;
    while(node != -1 && visited[node]) {
        path2.push_back(node);
        node = parent[node];
    }
    reverse(path2.begin(), path2.end());
    for(auto v : path2) path.push_back(v);
    
    int p = 0, q = path.size() - 1, r; cost1[0] = 0;
    for(int i = 1; i <= 2 * N; ++i) cost1[i] = (ll)(2e18);
    for(int i = 1; i <= 2 * N; ++i) {
        int u = p == (int)path.size() ? -1 : path[p];
        int v = q == -1 ? -1 : path[q];
        
        if(u == -1 && v == -1) break;
        if(u == v) r = i;
        if(u == -1) {
            cost1[i] = cost1[i - 1] + dist2[v] - c[v];
            c[v] = dist2[v]; --q;
        }
        else if(v == -1) {
            cost1[i] = cost1[i - 1] + dist1[u] - c[u];
            c[u] = dist1[u]; ++p;
        }
        else if(dist1[u] - c[u] <= dist2[v] - c[v]) {
            cost1[i] = cost1[i - 1] + dist1[u] - c[u];
            c[u] = dist1[u]; ++p;
        }
        else {
            cost1[i] = cost1[i - 1] + dist2[v] - c[v];
            c[v] = dist2[v]; --q;
        }
    }
    for(int i = 0; i < r; ++i) cost1[i] = (ll)(2e18);
    
    for(int i = 1; i <= 2 * N; ++i) cost2[i] = (ll)(2e18);
    for(int i = 0; i < N; ++i) {
        if(visited[i]) continue;
        for(int j = 0; j <= 2 * N; ++j) tmp[j] = cost2[j];
        for(int j = 1; j <= 2 * N; ++j) {
            tmp[j] = min(tmp[j], cost2[j - 1] + min(dist1[i], dist2[i]));
            if(j >= 2) tmp[j] = min(tmp[j], cost2[j - 2] + max(dist1[i], dist2[i]));
        }
        for(int j = 0; j <= 2 * N; ++j) cost2[j] = tmp[j];
    }
    
    for(int i = 2 * N, p = 0; i >= 0; --i) {
        while(p < 2 * N && cost1[i] + cost2[p + 1] <= K) ++p;
        if(cost1[i] + cost2[p] <= K) mx = max(mx, i + p);
    }
    return mx;
}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:92:37: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   92 |     int p = 0, q = path.size() - 1, r; cost1[0] = 0;
      |                                     ^

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 30456 KB Output is correct
2 Correct 92 ms 34540 KB Output is correct
3 Correct 55 ms 13140 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 3 ms 14680 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 3 ms 14680 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 3 ms 14680 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 3 ms 14680 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 12632 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 3 ms 14680 KB Output is correct
20 Correct 3 ms 14680 KB Output is correct
21 Correct 3 ms 14680 KB Output is correct
22 Correct 3 ms 14680 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 3 ms 14680 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 3 ms 14680 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 12632 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 3 ms 14680 KB Output is correct
20 Correct 3 ms 14680 KB Output is correct
21 Correct 3 ms 14680 KB Output is correct
22 Correct 3 ms 14680 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 4 ms 14680 KB Output is correct
26 Correct 32 ms 14936 KB Output is correct
27 Correct 29 ms 14936 KB Output is correct
28 Correct 4 ms 15192 KB Output is correct
29 Correct 13 ms 15428 KB Output is correct
30 Correct 23 ms 14936 KB Output is correct
31 Correct 3 ms 13144 KB Output is correct
32 Correct 3 ms 13144 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 3 ms 14680 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 3 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 3 ms 14880 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 2 ms 10584 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14680 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 3 ms 14936 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14680 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14680 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 3 ms 14680 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 3 ms 14680 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14680 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 3 ms 14880 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14680 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 10584 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 2 ms 14680 KB Output is correct
27 Correct 2 ms 14680 KB Output is correct
28 Correct 2 ms 14680 KB Output is correct
29 Correct 3 ms 14684 KB Output is correct
30 Correct 2 ms 14680 KB Output is correct
31 Correct 2 ms 14680 KB Output is correct
32 Correct 3 ms 14936 KB Output is correct
33 Correct 2 ms 14680 KB Output is correct
34 Correct 2 ms 14680 KB Output is correct
35 Correct 2 ms 14680 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 3 ms 14680 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 2 ms 14680 KB Output is correct
40 Correct 2 ms 14680 KB Output is correct
41 Correct 3 ms 14680 KB Output is correct
42 Correct 2 ms 14684 KB Output is correct
43 Correct 2 ms 14680 KB Output is correct
44 Correct 2 ms 14680 KB Output is correct
45 Correct 2 ms 14680 KB Output is correct
46 Correct 2 ms 14680 KB Output is correct
47 Correct 2 ms 14680 KB Output is correct
48 Correct 2 ms 14936 KB Output is correct
49 Correct 3 ms 14680 KB Output is correct
50 Correct 2 ms 14684 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 3 ms 14680 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 3 ms 14680 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14680 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 3 ms 14680 KB Output is correct
21 Correct 3 ms 14680 KB Output is correct
22 Correct 3 ms 14680 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 2 ms 14680 KB Output is correct
27 Correct 3 ms 14880 KB Output is correct
28 Correct 2 ms 14680 KB Output is correct
29 Correct 2 ms 14680 KB Output is correct
30 Correct 2 ms 14680 KB Output is correct
31 Correct 2 ms 10584 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 2 ms 14680 KB Output is correct
34 Correct 2 ms 14680 KB Output is correct
35 Correct 2 ms 14680 KB Output is correct
36 Correct 3 ms 14684 KB Output is correct
37 Correct 2 ms 14680 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 3 ms 14936 KB Output is correct
40 Correct 2 ms 14680 KB Output is correct
41 Correct 2 ms 14680 KB Output is correct
42 Correct 2 ms 14680 KB Output is correct
43 Correct 2 ms 14680 KB Output is correct
44 Correct 3 ms 14680 KB Output is correct
45 Correct 2 ms 14680 KB Output is correct
46 Correct 2 ms 14680 KB Output is correct
47 Correct 2 ms 14680 KB Output is correct
48 Correct 3 ms 14680 KB Output is correct
49 Correct 2 ms 14684 KB Output is correct
50 Correct 2 ms 14680 KB Output is correct
51 Correct 2 ms 14680 KB Output is correct
52 Correct 2 ms 14680 KB Output is correct
53 Correct 2 ms 14680 KB Output is correct
54 Correct 2 ms 14680 KB Output is correct
55 Correct 2 ms 14936 KB Output is correct
56 Correct 3 ms 14680 KB Output is correct
57 Correct 2 ms 14684 KB Output is correct
58 Correct 2 ms 14680 KB Output is correct
59 Correct 3 ms 14684 KB Output is correct
60 Correct 3 ms 14936 KB Output is correct
61 Correct 3 ms 14680 KB Output is correct
62 Correct 3 ms 14680 KB Output is correct
63 Correct 4 ms 14680 KB Output is correct
64 Correct 4 ms 14680 KB Output is correct
65 Correct 3 ms 14680 KB Output is correct
66 Correct 3 ms 14680 KB Output is correct
67 Correct 3 ms 14680 KB Output is correct
68 Correct 3 ms 14684 KB Output is correct
69 Correct 3 ms 14680 KB Output is correct
70 Correct 3 ms 14680 KB Output is correct
71 Correct 3 ms 14680 KB Output is correct
72 Correct 3 ms 14840 KB Output is correct
73 Correct 4 ms 14684 KB Output is correct
74 Correct 3 ms 14680 KB Output is correct
75 Correct 3 ms 14680 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 3 ms 14680 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 3 ms 14680 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14680 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 3 ms 14680 KB Output is correct
21 Correct 3 ms 14680 KB Output is correct
22 Correct 3 ms 14680 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 4 ms 14680 KB Output is correct
27 Correct 32 ms 14936 KB Output is correct
28 Correct 29 ms 14936 KB Output is correct
29 Correct 4 ms 15192 KB Output is correct
30 Correct 13 ms 15428 KB Output is correct
31 Correct 23 ms 14936 KB Output is correct
32 Correct 3 ms 13144 KB Output is correct
33 Correct 3 ms 13144 KB Output is correct
34 Correct 2 ms 14680 KB Output is correct
35 Correct 3 ms 14880 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 2 ms 14680 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 2 ms 10584 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 2 ms 14680 KB Output is correct
42 Correct 2 ms 14680 KB Output is correct
43 Correct 2 ms 14680 KB Output is correct
44 Correct 3 ms 14684 KB Output is correct
45 Correct 2 ms 14680 KB Output is correct
46 Correct 2 ms 14680 KB Output is correct
47 Correct 3 ms 14936 KB Output is correct
48 Correct 2 ms 14680 KB Output is correct
49 Correct 2 ms 14680 KB Output is correct
50 Correct 2 ms 14680 KB Output is correct
51 Correct 2 ms 14680 KB Output is correct
52 Correct 3 ms 14680 KB Output is correct
53 Correct 2 ms 14680 KB Output is correct
54 Correct 2 ms 14680 KB Output is correct
55 Correct 2 ms 14680 KB Output is correct
56 Correct 3 ms 14680 KB Output is correct
57 Correct 2 ms 14684 KB Output is correct
58 Correct 2 ms 14680 KB Output is correct
59 Correct 2 ms 14680 KB Output is correct
60 Correct 2 ms 14680 KB Output is correct
61 Correct 2 ms 14680 KB Output is correct
62 Correct 2 ms 14680 KB Output is correct
63 Correct 2 ms 14936 KB Output is correct
64 Correct 3 ms 14680 KB Output is correct
65 Correct 2 ms 14684 KB Output is correct
66 Correct 2 ms 14680 KB Output is correct
67 Correct 3 ms 14684 KB Output is correct
68 Correct 3 ms 14936 KB Output is correct
69 Correct 3 ms 14680 KB Output is correct
70 Correct 3 ms 14680 KB Output is correct
71 Correct 4 ms 14680 KB Output is correct
72 Correct 4 ms 14680 KB Output is correct
73 Correct 3 ms 14680 KB Output is correct
74 Correct 3 ms 14680 KB Output is correct
75 Correct 3 ms 14680 KB Output is correct
76 Correct 3 ms 14684 KB Output is correct
77 Correct 3 ms 14680 KB Output is correct
78 Correct 3 ms 14680 KB Output is correct
79 Correct 3 ms 14680 KB Output is correct
80 Correct 3 ms 14840 KB Output is correct
81 Correct 4 ms 14684 KB Output is correct
82 Correct 3 ms 14680 KB Output is correct
83 Correct 3 ms 14680 KB Output is correct
84 Correct 4 ms 14680 KB Output is correct
85 Correct 6 ms 14680 KB Output is correct
86 Correct 4 ms 14680 KB Output is correct
87 Correct 4 ms 14680 KB Output is correct
88 Correct 4 ms 14680 KB Output is correct
89 Correct 37 ms 14936 KB Output is correct
90 Correct 40 ms 14936 KB Output is correct
91 Correct 30 ms 14936 KB Output is correct
92 Correct 28 ms 14936 KB Output is correct
93 Correct 28 ms 14940 KB Output is correct
94 Correct 10 ms 15192 KB Output is correct
95 Correct 9 ms 15192 KB Output is correct
96 Correct 17 ms 14936 KB Output is correct
97 Correct 22 ms 14936 KB Output is correct
98 Correct 31 ms 14936 KB Output is correct
99 Correct 33 ms 14936 KB Output is correct
100 Correct 20 ms 14940 KB Output is correct
101 Correct 7 ms 14680 KB Output is correct

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 3 ms 14680 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 3 ms 14680 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14680 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 3 ms 14680 KB Output is correct
21 Correct 3 ms 14680 KB Output is correct
22 Correct 3 ms 14680 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 4 ms 14680 KB Output is correct
27 Correct 32 ms 14936 KB Output is correct
28 Correct 29 ms 14936 KB Output is correct
29 Correct 4 ms 15192 KB Output is correct
30 Correct 13 ms 15428 KB Output is correct
31 Correct 23 ms 14936 KB Output is correct
32 Correct 3 ms 13144 KB Output is correct
33 Correct 3 ms 13144 KB Output is correct
34 Correct 2 ms 14680 KB Output is correct
35 Correct 3 ms 14880 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 2 ms 14680 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 2 ms 10584 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 2 ms 14680 KB Output is correct
42 Correct 2 ms 14680 KB Output is correct
43 Correct 2 ms 14680 KB Output is correct
44 Correct 3 ms 14684 KB Output is correct
45 Correct 2 ms 14680 KB Output is correct
46 Correct 2 ms 14680 KB Output is correct
47 Correct 3 ms 14936 KB Output is correct
48 Correct 2 ms 14680 KB Output is correct
49 Correct 2 ms 14680 KB Output is correct
50 Correct 2 ms 14680 KB Output is correct
51 Correct 2 ms 14680 KB Output is correct
52 Correct 3 ms 14680 KB Output is correct
53 Correct 2 ms 14680 KB Output is correct
54 Correct 2 ms 14680 KB Output is correct
55 Correct 2 ms 14680 KB Output is correct
56 Correct 3 ms 14680 KB Output is correct
57 Correct 2 ms 14684 KB Output is correct
58 Correct 2 ms 14680 KB Output is correct
59 Correct 2 ms 14680 KB Output is correct
60 Correct 2 ms 14680 KB Output is correct
61 Correct 2 ms 14680 KB Output is correct
62 Correct 2 ms 14680 KB Output is correct
63 Correct 2 ms 14936 KB Output is correct
64 Correct 3 ms 14680 KB Output is correct
65 Correct 2 ms 14684 KB Output is correct
66 Correct 2 ms 14680 KB Output is correct
67 Correct 3 ms 14684 KB Output is correct
68 Correct 3 ms 14936 KB Output is correct
69 Correct 3 ms 14680 KB Output is correct
70 Correct 3 ms 14680 KB Output is correct
71 Correct 4 ms 14680 KB Output is correct
72 Correct 4 ms 14680 KB Output is correct
73 Correct 3 ms 14680 KB Output is correct
74 Correct 3 ms 14680 KB Output is correct
75 Correct 3 ms 14680 KB Output is correct
76 Correct 3 ms 14684 KB Output is correct
77 Correct 3 ms 14680 KB Output is correct
78 Correct 3 ms 14680 KB Output is correct
79 Correct 3 ms 14680 KB Output is correct
80 Correct 3 ms 14840 KB Output is correct
81 Correct 4 ms 14684 KB Output is correct
82 Correct 3 ms 14680 KB Output is correct
83 Correct 3 ms 14680 KB Output is correct
84 Correct 4 ms 14680 KB Output is correct
85 Correct 6 ms 14680 KB Output is correct
86 Correct 4 ms 14680 KB Output is correct
87 Correct 4 ms 14680 KB Output is correct
88 Correct 4 ms 14680 KB Output is correct
89 Correct 37 ms 14936 KB Output is correct
90 Correct 40 ms 14936 KB Output is correct
91 Correct 30 ms 14936 KB Output is correct
92 Correct 28 ms 14936 KB Output is correct
93 Correct 28 ms 14940 KB Output is correct
94 Correct 10 ms 15192 KB Output is correct
95 Correct 9 ms 15192 KB Output is correct
96 Correct 17 ms 14936 KB Output is correct
97 Correct 22 ms 14936 KB Output is correct
98 Correct 31 ms 14936 KB Output is correct
99 Correct 33 ms 14936 KB Output is correct
100 Correct 20 ms 14940 KB Output is correct
101 Correct 7 ms 14680 KB Output is correct
102 Correct 110 ms 17428 KB Output is correct
103 Correct 271 ms 17232 KB Output is correct
104 Execution timed out 1045 ms 36808 KB Time limit exceeded
105 Halted 0 ms 0 KB -