oj.uz

Submission #823728

# Submission time Handle Problem Language Result Execution time Memory
823728 2023-08-13T03:23:21 Z yeyso Rainforest Jumps (APIO21_jumps) C++14
60 / 100
 4000 ms 135852 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>
vector<vector<int>> adj;
vector<vector<int>> radj;
int n = 0;
vector<vector<int>> st0;
vector<vector<int>> st1;
vector<int> visited;
vector<int> h;
void dfs0(int u, int v){
    if(!visited[u]){
        visited[u] = 1;
        st0[u][0] = v;
        for(int z = 1; z <= ceil(log2(n)); z ++){
            st0[u][z] = st0[st0[u][z-1]][z-1];
        }
        for(int i = 0; i < radj[u].size(); i ++){
            
            int highedge = 1;
            for(int j = 0; j < adj[radj[u][i]].size(); j ++){
                if(h[adj[radj[u][i]][j]] > h[u]){
                    highedge = 0;
                    //break;
                }
            }
            if(highedge){
                dfs0(radj[u][i], u);
            }
        }
    }
}
void dfs1(int u, int v){
    if(!visited[u]){
        visited[u] = 1;
        st1[u][0] = v;
        //cout << h[u] << " " << h[v] << "\n";
        for(int z = 1; z <= ceil(log2(n)); z ++){
            st1[u][z] = st1[st1[u][z-1]][z-1];
        }
        for(int i = 0; i < radj[u].size(); i ++){
            int lowedge = 1;
            for(int j = 0; j < adj[radj[u][i]].size(); j ++){
                if(h[adj[radj[u][i]][j]] < h[u]){
                    lowedge = 0;
                    //break;
                }
            }
            if(lowedge){
                dfs1(radj[u][i], u);
            }
        }
    }
}
int subtask1 = 1;
void init(int N, vector<int> H) {
    n = N;
    h = H;
    stack<pair<int, int>> s;
    vector<vector<int>> adj0(N, vector<int>());
    int highest = 0;
    int idx = 0;
    vector<vector<int>> radj0(N, vector<int>());
    // Monotonic stack to construct adjacency list in O(n)
    for (int i = 0; i < N; i ++) {
        if(i > 0){
            if(H[i] != i + 1){
                subtask1 = 0;
            }
        }
        while (!s.empty() && s.top().first < H[i]){
            s.pop();
        }
        if (!s.empty()){
            adj0[i].push_back(s.top().second);
            radj0[s.top().second].push_back(i);
        }
        s.push({H[i], i});
 
        if(H[i] > highest){
            highest = H[i];
            idx = i;
        }
    }
    while(!s.empty()){
        s.pop();
    }
    for (int i = N - 1; i >= 0; i --) {
        while (!s.empty() && s.top().first < H[i]){
            s.pop();
        }
        if (!s.empty()){
            adj0[i].push_back(s.top().second);
            radj0[s.top().second].push_back(i);
        }
        s.push({H[i], i});
    }
 
    adj = adj0;
    radj = radj0;
    vector<vector<int>> st(N, vector<int>(ceil(log2(n)) + 1, 0));
    st0 = st;
    st1 = st;
    vector<int> v(N, 0);
    visited = v;
    dfs0(idx, idx);
    visited = v;
    dfs1(idx, idx);
    /*for(int i = 0; i < st1.size(); i ++){
        for(int j = 0; j < st1[i].size(); j ++){
            cout << h[st1[i][j]] << " ";
        } cout << "\n";
    }*/
}
 
int minimum_jumps(int A, int B, int C, int D) {
    // In this case, our O(logn) algorithm for subtask 5
    if(A == B and C == D){
        int jumps = 0;
        int u = A;
        for (int i = ceil(log2(n)); i >= 0; --i) {
            if(h[st0[u][i]] < h[C]){
                u = st0[u][i];
                jumps += (1 << i);
            }
        }
        // If the first sparse table is all we need, we're done
        if(st0[u][0] == C){
            return jumps + 1;
        } else {
            // Add one jump to start at the next sparse table
        for (int i = ceil(log2(n)); i >= 0; --i) {
                if(h[st1[u][i]] < h[C]){
                    u = st1[u][i];
                    jumps += (1 << i);
                }
            }
    
            if(st1[u][0] == C){
                return jumps + 1;
            }
        }
        return -1;
    // Otherwise, if it's subtask 1, we do our dumb solution
    } else if(subtask1){
        return C - B;
        // Now it's only subtask 2, 3 or 4 so we do BFS
    } else {
        //return u;
    /*if(jumps){
        return jumps + 1;
    } else {
        return 0;
    }*/
        queue<pair<int, int>> q;
        for(int i = A; i <= B; i ++){
            q.push({0, i});
        }
        int node = 0; int dist = 0;
        vector<int> vi(n, 0);
        while(!q.empty()){
            node = q.front().second;
            dist = q.front().first;
            //cout << node << "\n";
            q.pop();
            if(node >= C && node <= D){
                return dist;
                //break;
            }
            if(!vi[node]){
                vi[node] = 1;
                for(int i = 0; i < adj[node].size(); i ++){
                    q.push({dist + 1, adj[node][i]});
                }
            }
        }

        return -1;
    }
}

Compilation message

jumps.cpp: In function 'void dfs0(int, int)':
jumps.cpp:19:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         for(int i = 0; i < radj[u].size(); i ++){
      |                        ~~^~~~~~~~~~~~~~~~
jumps.cpp:22:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |             for(int j = 0; j < adj[radj[u][i]].size(); j ++){
      |                            ~~^~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp: In function 'void dfs1(int, int)':
jumps.cpp:42:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for(int i = 0; i < radj[u].size(); i ++){
      |                        ~~^~~~~~~~~~~~~~~~
jumps.cpp:44:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             for(int j = 0; j < adj[radj[u][i]].size(); j ++){
      |                            ~~^~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:173:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |                 for(int i = 0; i < adj[node].size(); i ++){
      |                                ~~^~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 238 ms 108012 KB Output is correct
4 Correct 895 ms 135852 KB Output is correct
5 Correct 824 ms 63776 KB Output is correct
6 Correct 974 ms 135736 KB Output is correct
7 Correct 655 ms 92840 KB Output is correct
8 Correct 850 ms 135696 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 3 ms 336 KB Output is correct
46 Correct 2 ms 336 KB Output is correct
47 Correct 2 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 2 ms 336 KB Output is correct
50 Correct 2 ms 308 KB Output is correct
51 Correct 3 ms 336 KB Output is correct
52 Correct 3 ms 336 KB Output is correct
53 Correct 3 ms 336 KB Output is correct
54 Correct 2 ms 336 KB Output is correct
55 Correct 2 ms 336 KB Output is correct
56 Correct 2 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 31 ms 1108 KB Output is correct
59 Correct 42 ms 1244 KB Output is correct
60 Correct 9 ms 592 KB Output is correct
61 Correct 44 ms 1232 KB Output is correct
62 Correct 13 ms 336 KB Output is correct
63 Correct 41 ms 1236 KB Output is correct
64 Correct 13 ms 1372 KB Output is correct
65 Correct 51 ms 1360 KB Output is correct
66 Correct 45 ms 1428 KB Output is correct
67 Correct 45 ms 1240 KB Output is correct
68 Correct 53 ms 1424 KB Output is correct
69 Correct 59 ms 1436 KB Output is correct
70 Correct 33 ms 1360 KB Output is correct
71 Correct 0 ms 208 KB Output is correct
72 Correct 1 ms 208 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 2 ms 336 KB Output is correct
75 Correct 3 ms 336 KB Output is correct
76 Correct 2 ms 336 KB Output is correct
77 Correct 2 ms 336 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 1 ms 336 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 2 ms 336 KB Output is correct
85 Correct 2 ms 336 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 0 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 0 ms 336 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 384 KB Output is correct
93 Correct 1 ms 336 KB Output is correct
94 Correct 4 ms 336 KB Output is correct
95 Correct 41 ms 1232 KB Output is correct
96 Correct 60 ms 1360 KB Output is correct
97 Correct 44 ms 1244 KB Output is correct
98 Correct 68 ms 1432 KB Output is correct
99 Correct 43 ms 1436 KB Output is correct
100 Correct 0 ms 336 KB Output is correct
101 Correct 1 ms 592 KB Output is correct
102 Correct 9 ms 1256 KB Output is correct
103 Correct 15 ms 1432 KB Output is correct
104 Correct 12 ms 1244 KB Output is correct
105 Correct 18 ms 1360 KB Output is correct
106 Correct 9 ms 1360 KB Output is correct
107 Correct 1 ms 336 KB Output is correct
108 Correct 1 ms 720 KB Output is correct
109 Correct 2 ms 1232 KB Output is correct
110 Correct 3 ms 1360 KB Output is correct
111 Correct 3 ms 1232 KB Output is correct
112 Correct 2 ms 1364 KB Output is correct
113 Correct 3 ms 1332 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 236 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 221 ms 92680 KB Output is correct
6 Correct 287 ms 115136 KB Output is correct
7 Correct 127 ms 54268 KB Output is correct
8 Correct 291 ms 115016 KB Output is correct
9 Correct 35 ms 16068 KB Output is correct
10 Correct 282 ms 115016 KB Output is correct
11 Correct 309 ms 135672 KB Output is correct
12 Correct 261 ms 131496 KB Output is correct
13 Correct 237 ms 131200 KB Output is correct
14 Correct 298 ms 115620 KB Output is correct
15 Correct 397 ms 134200 KB Output is correct
16 Correct 311 ms 135656 KB Output is correct
17 Correct 304 ms 135536 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 3 ms 1260 KB Output is correct
28 Correct 2 ms 1360 KB Output is correct
29 Correct 2 ms 1232 KB Output is correct
30 Correct 3 ms 1448 KB Output is correct
31 Correct 2 ms 1448 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 277 ms 114916 KB Output is correct
34 Correct 264 ms 115132 KB Output is correct
35 Correct 244 ms 131952 KB Output is correct
36 Correct 267 ms 115628 KB Output is correct
37 Correct 343 ms 134196 KB Output is correct
38 Correct 257 ms 134524 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 193 ms 61348 KB Output is correct
41 Correct 256 ms 115144 KB Output is correct
42 Correct 260 ms 133400 KB Output is correct
43 Correct 265 ms 115628 KB Output is correct
44 Correct 381 ms 134144 KB Output is correct
45 Correct 241 ms 134648 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 243 ms 48464 KB Output is correct
5 Correct 1058 ms 115152 KB Output is correct
6 Correct 552 ms 17712 KB Output is correct
7 Correct 1046 ms 115028 KB Output is correct
8 Correct 531 ms 36612 KB Output is correct
9 Correct 951 ms 115128 KB Output is correct
10 Correct 1145 ms 135732 KB Output is correct
11 Correct 1016 ms 134524 KB Output is correct
12 Correct 1016 ms 133676 KB Output is correct
13 Correct 969 ms 115612 KB Output is correct
14 Correct 1153 ms 134192 KB Output is correct
15 Correct 1110 ms 134404 KB Output is correct
16 Correct 886 ms 134300 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 19 ms 1236 KB Output is correct
28 Correct 16 ms 1360 KB Output is correct
29 Correct 20 ms 1232 KB Output is correct
30 Correct 17 ms 1360 KB Output is correct
31 Correct 14 ms 1440 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 141 ms 61356 KB Output is correct
34 Correct 295 ms 115152 KB Output is correct
35 Correct 256 ms 133372 KB Output is correct
36 Correct 265 ms 115584 KB Output is correct
37 Correct 346 ms 134156 KB Output is correct
38 Correct 243 ms 134588 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 243 ms 48464 KB Output is correct
5 Correct 1058 ms 115152 KB Output is correct
6 Correct 552 ms 17712 KB Output is correct
7 Correct 1046 ms 115028 KB Output is correct
8 Correct 531 ms 36612 KB Output is correct
9 Correct 951 ms 115128 KB Output is correct
10 Correct 1145 ms 135732 KB Output is correct
11 Correct 1016 ms 134524 KB Output is correct
12 Correct 1016 ms 133676 KB Output is correct
13 Correct 969 ms 115612 KB Output is correct
14 Correct 1153 ms 134192 KB Output is correct
15 Correct 1110 ms 134404 KB Output is correct
16 Correct 886 ms 134300 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 19 ms 1236 KB Output is correct
28 Correct 16 ms 1360 KB Output is correct
29 Correct 20 ms 1232 KB Output is correct
30 Correct 17 ms 1360 KB Output is correct
31 Correct 14 ms 1440 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 141 ms 61356 KB Output is correct
34 Correct 295 ms 115152 KB Output is correct
35 Correct 256 ms 133372 KB Output is correct
36 Correct 265 ms 115584 KB Output is correct
37 Correct 346 ms 134156 KB Output is correct
38 Correct 243 ms 134588 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 321 ms 48508 KB Output is correct
43 Correct 1083 ms 115172 KB Output is correct
44 Correct 560 ms 17724 KB Output is correct
45 Correct 937 ms 115140 KB Output is correct
46 Correct 520 ms 36616 KB Output is correct
47 Correct 980 ms 115124 KB Output is correct
48 Correct 968 ms 135692 KB Output is correct
49 Correct 1096 ms 134500 KB Output is correct
50 Correct 1014 ms 133640 KB Output is correct
51 Correct 1041 ms 115580 KB Output is correct
52 Correct 1267 ms 134216 KB Output is correct
53 Correct 1101 ms 134408 KB Output is correct
54 Correct 989 ms 134360 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Execution timed out 4070 ms 114688 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 238 ms 108012 KB Output is correct
4 Correct 895 ms 135852 KB Output is correct
5 Correct 824 ms 63776 KB Output is correct
6 Correct 974 ms 135736 KB Output is correct
7 Correct 655 ms 92840 KB Output is correct
8 Correct 850 ms 135696 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 2 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 3 ms 336 KB Output is correct
25 Correct 3 ms 336 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 3 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 2 ms 336 KB Output is correct
39 Correct 2 ms 336 KB Output is correct
40 Correct 2 ms 336 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 0 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 1 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 0 ms 208 KB Output is correct
49 Correct 0 ms 208 KB Output is correct
50 Correct 0 ms 208 KB Output is correct
51 Correct 0 ms 208 KB Output is correct
52 Correct 2 ms 208 KB Output is correct
53 Correct 3 ms 336 KB Output is correct
54 Correct 2 ms 336 KB Output is correct
55 Correct 2 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 2 ms 336 KB Output is correct
58 Correct 2 ms 308 KB Output is correct
59 Correct 3 ms 336 KB Output is correct
60 Correct 3 ms 336 KB Output is correct
61 Correct 3 ms 336 KB Output is correct
62 Correct 2 ms 336 KB Output is correct
63 Correct 2 ms 336 KB Output is correct
64 Correct 2 ms 336 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 31 ms 1108 KB Output is correct
67 Correct 42 ms 1244 KB Output is correct
68 Correct 9 ms 592 KB Output is correct
69 Correct 44 ms 1232 KB Output is correct
70 Correct 13 ms 336 KB Output is correct
71 Correct 41 ms 1236 KB Output is correct
72 Correct 13 ms 1372 KB Output is correct
73 Correct 51 ms 1360 KB Output is correct
74 Correct 45 ms 1428 KB Output is correct
75 Correct 45 ms 1240 KB Output is correct
76 Correct 53 ms 1424 KB Output is correct
77 Correct 59 ms 1436 KB Output is correct
78 Correct 33 ms 1360 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 3 ms 336 KB Output is correct
84 Correct 2 ms 336 KB Output is correct
85 Correct 2 ms 336 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 1 ms 208 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 1 ms 336 KB Output is correct
91 Correct 2 ms 336 KB Output is correct
92 Correct 2 ms 336 KB Output is correct
93 Correct 2 ms 336 KB Output is correct
94 Correct 0 ms 208 KB Output is correct
95 Correct 0 ms 336 KB Output is correct
96 Correct 1 ms 336 KB Output is correct
97 Correct 1 ms 336 KB Output is correct
98 Correct 0 ms 336 KB Output is correct
99 Correct 1 ms 336 KB Output is correct
100 Correct 1 ms 384 KB Output is correct
101 Correct 1 ms 336 KB Output is correct
102 Correct 4 ms 336 KB Output is correct
103 Correct 41 ms 1232 KB Output is correct
104 Correct 60 ms 1360 KB Output is correct
105 Correct 44 ms 1244 KB Output is correct
106 Correct 68 ms 1432 KB Output is correct
107 Correct 43 ms 1436 KB Output is correct
108 Correct 0 ms 336 KB Output is correct
109 Correct 1 ms 592 KB Output is correct
110 Correct 9 ms 1256 KB Output is correct
111 Correct 15 ms 1432 KB Output is correct
112 Correct 12 ms 1244 KB Output is correct
113 Correct 18 ms 1360 KB Output is correct
114 Correct 9 ms 1360 KB Output is correct
115 Correct 1 ms 336 KB Output is correct
116 Correct 1 ms 720 KB Output is correct
117 Correct 2 ms 1232 KB Output is correct
118 Correct 3 ms 1360 KB Output is correct
119 Correct 3 ms 1232 KB Output is correct
120 Correct 2 ms 1364 KB Output is correct
121 Correct 3 ms 1332 KB Output is correct
122 Correct 0 ms 208 KB Output is correct
123 Correct 1 ms 236 KB Output is correct
124 Correct 0 ms 208 KB Output is correct
125 Correct 0 ms 208 KB Output is correct
126 Correct 221 ms 92680 KB Output is correct
127 Correct 287 ms 115136 KB Output is correct
128 Correct 127 ms 54268 KB Output is correct
129 Correct 291 ms 115016 KB Output is correct
130 Correct 35 ms 16068 KB Output is correct
131 Correct 282 ms 115016 KB Output is correct
132 Correct 309 ms 135672 KB Output is correct
133 Correct 261 ms 131496 KB Output is correct
134 Correct 237 ms 131200 KB Output is correct
135 Correct 298 ms 115620 KB Output is correct
136 Correct 397 ms 134200 KB Output is correct
137 Correct 311 ms 135656 KB Output is correct
138 Correct 304 ms 135536 KB Output is correct
139 Correct 1 ms 208 KB Output is correct
140 Correct 1 ms 336 KB Output is correct
141 Correct 0 ms 336 KB Output is correct
142 Correct 0 ms 336 KB Output is correct
143 Correct 1 ms 336 KB Output is correct
144 Correct 1 ms 336 KB Output is correct
145 Correct 1 ms 320 KB Output is correct
146 Correct 1 ms 336 KB Output is correct
147 Correct 2 ms 720 KB Output is correct
148 Correct 3 ms 1260 KB Output is correct
149 Correct 2 ms 1360 KB Output is correct
150 Correct 2 ms 1232 KB Output is correct
151 Correct 3 ms 1448 KB Output is correct
152 Correct 2 ms 1448 KB Output is correct
153 Correct 0 ms 208 KB Output is correct
154 Correct 277 ms 114916 KB Output is correct
155 Correct 264 ms 115132 KB Output is correct
156 Correct 244 ms 131952 KB Output is correct
157 Correct 267 ms 115628 KB Output is correct
158 Correct 343 ms 134196 KB Output is correct
159 Correct 257 ms 134524 KB Output is correct
160 Correct 1 ms 208 KB Output is correct
161 Correct 193 ms 61348 KB Output is correct
162 Correct 256 ms 115144 KB Output is correct
163 Correct 260 ms 133400 KB Output is correct
164 Correct 265 ms 115628 KB Output is correct
165 Correct 381 ms 134144 KB Output is correct
166 Correct 241 ms 134648 KB Output is correct
167 Correct 1 ms 208 KB Output is correct
168 Correct 0 ms 208 KB Output is correct
169 Correct 1 ms 208 KB Output is correct
170 Correct 243 ms 48464 KB Output is correct
171 Correct 1058 ms 115152 KB Output is correct
172 Correct 552 ms 17712 KB Output is correct
173 Correct 1046 ms 115028 KB Output is correct
174 Correct 531 ms 36612 KB Output is correct
175 Correct 951 ms 115128 KB Output is correct
176 Correct 1145 ms 135732 KB Output is correct
177 Correct 1016 ms 134524 KB Output is correct
178 Correct 1016 ms 133676 KB Output is correct
179 Correct 969 ms 115612 KB Output is correct
180 Correct 1153 ms 134192 KB Output is correct
181 Correct 1110 ms 134404 KB Output is correct
182 Correct 886 ms 134300 KB Output is correct
183 Correct 0 ms 208 KB Output is correct
184 Correct 0 ms 208 KB Output is correct
185 Correct 1 ms 208 KB Output is correct
186 Correct 2 ms 336 KB Output is correct
187 Correct 2 ms 336 KB Output is correct
188 Correct 2 ms 336 KB Output is correct
189 Correct 2 ms 336 KB Output is correct
190 Correct 1 ms 336 KB Output is correct
191 Correct 0 ms 336 KB Output is correct
192 Correct 2 ms 592 KB Output is correct
193 Correct 19 ms 1236 KB Output is correct
194 Correct 16 ms 1360 KB Output is correct
195 Correct 20 ms 1232 KB Output is correct
196 Correct 17 ms 1360 KB Output is correct
197 Correct 14 ms 1440 KB Output is correct
198 Correct 0 ms 208 KB Output is correct
199 Correct 141 ms 61356 KB Output is correct
200 Correct 295 ms 115152 KB Output is correct
201 Correct 256 ms 133372 KB Output is correct
202 Correct 265 ms 115584 KB Output is correct
203 Correct 346 ms 134156 KB Output is correct
204 Correct 243 ms 134588 KB Output is correct
205 Correct 0 ms 208 KB Output is correct
206 Correct 0 ms 208 KB Output is correct
207 Correct 0 ms 208 KB Output is correct
208 Correct 321 ms 48508 KB Output is correct
209 Correct 1083 ms 115172 KB Output is correct
210 Correct 560 ms 17724 KB Output is correct
211 Correct 937 ms 115140 KB Output is correct
212 Correct 520 ms 36616 KB Output is correct
213 Correct 980 ms 115124 KB Output is correct
214 Correct 968 ms 135692 KB Output is correct
215 Correct 1096 ms 134500 KB Output is correct
216 Correct 1014 ms 133640 KB Output is correct
217 Correct 1041 ms 115580 KB Output is correct
218 Correct 1267 ms 134216 KB Output is correct
219 Correct 1101 ms 134408 KB Output is correct
220 Correct 989 ms 134360 KB Output is correct
221 Correct 0 ms 208 KB Output is correct
222 Execution timed out 4070 ms 114688 KB Time limit exceeded
223 Halted 0 ms 0 KB -