oj.uz

Submission #746522

# Submission time Handle Problem Language Result Execution time Memory
746522 2023-05-22T16:06:00 Z ThMinh_ Maze (JOI23_ho_t3) C++14
59 / 100
 510 ms 245236 KB 
#include<bits/stdc++.h>
#define forin(i,a,b) for(int i=a;i<=b;++i)
using namespace std;
const int N = 6e6 + 10;
int r, c, n, x, y, u, v, dp;
int row[4] = {0, -1, 0, 1};
int col[4] = {1, 0, -1, 0};
string s[N];
vector<vector<int>> f, par1, par2, vis, red;
queue<pair<int, int>> tmp;
void create(vector<vector<int>> &a) {
    a.resize(r + 2);
    forin(i,1,r + 1) a[i].resize(c + 2);
}
int root1(int i, int j) {
    return (par1[i][j] == j) ? j : par1[i][j] = root1(i, par1[i][j]);
}
int root2(int i, int j) {
    return (par2[i][j] == i) ? i : par2[i][j] = root2(par2[i][j], j);
}
bool check(int i, int j) {
    if(i < 1 || r < i || j < 1 || c < j) return 0;
    return 1;
}
void up(int x, int y) {
    if(!check(x, y)) return;
    if(f[x][y]) return;
    f[x][y] = dp + 1;
    par1[x][y] = y + 1;
    par2[x][y] = x + 1;
    tmp.push({x, y});
}
void bfs(int x, int y, queue<pair<int, int>> &p) {
    queue<pair<int, int>> q;
    q.push({x, y});
    while(!q.empty()) {
        int x1, y1; tie(x1, y1) = q.front(); q.pop();
        f[x1][y1] = dp;
        forin(k,0,3) {
            int u1 = x1 + row[k];
            int v1 = y1 + col[k];
            if(!check(u1, v1) || red[u1][v1]) continue;
            bool ok = 0;
            ok |= (s[u1][v1] == '.');
            ok |= (f[u1][v1] == dp);
            if(!ok) continue;
            red[u1][v1] = 1;
            if(s[u1][v1] == '.') up(u1, v1);
            p.push({u1, v1});
            q.push({u1, v1});
        }
    }
}
int main () {
    cin.tie(0)->sync_with_stdio(0);
    if(fopen("Task.inp","r")) {
        freopen("Task.inp","r",stdin);
        freopen("WA.out","w",stdout);
    }
    cin>>r>>c>>n;
    create(f);
    create(vis);
    create(red);
    cin>>x>>y;
    cin>>u>>v;
    forin(i,1,r) {
        cin>>s[i];
        s[i] = " " + s[i];
    }
    create(par1);
    create(par2);
    forin(i,1,r + 1) forin(j,1,c + 1) {
        par1[i][j] = j;
        par2[i][j] = i;
    }
    up(x, y);
    while(true) {
        dp++;
        queue<pair<int, int>> q;
        while(!tmp.empty()) {
            int x1, y1; tie(x1, y1) = tmp.front(); tmp.pop();
            if(red[x1][y1]) continue;
            red[x1][y1] = 1;
            q.push({x1, y1});
            bfs(x1, y1, q);
        }
        while(!q.empty()) {
            int x1, y1; tie(x1, y1) = q.front(); q.pop();
            vis[x1][y1] = 1;
            vector<int> vt;
            forin(k,0,3) {
                int u1 = x1 + row[k];
                int v1 = y1 + col[k];
                if(!check(u1, v1) || !vis[u1][v1]) continue;
                vt.push_back(k);
            }
            if(vt.empty()) {
                forin(i,-n,n) forin(j,-n,n) if(!(abs(i) == n && abs(j) == n) && check(x1 + i, y1 + j)) {
                    up(x1 + i, y1 + j);
                }
            }
            else if(vt.size() == 1) {
                int k = vt[0];
                int t = - (row[k] + col[k]);
                if(row[k]) {
                    up(x1 + t * (n - 1), y1 + n);
                    up(x1 + t * (n - 1), y1 - n);
                    int u1 = x1 + t * n;
                    int v1 = max(1, y1 - n + 1);
                    if(!check(u1, v1)) continue;
                    while(true) {
                        v1 = root1(u1, v1);
                        if(v1 > min(c, y1 + n - 1)) break;
                        up(u1, v1);
                    }
                }
                else {
                    up(x1 + n, y1 + t * (n - 1));
                    up(x1 - n, y1 + t * (n - 1));
                    int u1 = max(1, x1 - n + 1);
                    int v1 = y1 + t * n;
                    if(!check(u1, v1)) continue;
                    while(true) {
                        u1 = root2(u1, v1);
                        if(u1 > min(r, x1 + n - 1)) break;
                        up(u1, v1);
                    }
                }
            }
            else if((vt[0] - vt[1]) % 2) {
                if(vt[0] % 2) swap(vt[0], vt[1]);
                int t1 = - (row[vt[1]] + col[vt[1]]);
                int t2 = - (row[vt[0]] + col[vt[0]]);
                up(x1 + t1 * (n - 1), y1 + n);
                up(x1 + t1 * (n - 1), y1 - n);
                up(x1 + n, y1 + t2 * (n - 1));
                up(x1 - n, y1 + t2 * (n - 1));
            }
        }
        if(f[u][v]) return cout<<f[u][v] - 1, 0;
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen("Task.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         freopen("WA.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 188164 KB Output is correct
2 Correct 88 ms 188168 KB Output is correct
3 Correct 91 ms 188196 KB Output is correct
4 Correct 89 ms 188108 KB Output is correct
5 Correct 90 ms 188152 KB Output is correct
6 Correct 89 ms 188312 KB Output is correct
7 Correct 91 ms 188292 KB Output is correct
8 Correct 91 ms 188212 KB Output is correct
9 Correct 85 ms 188112 KB Output is correct
10 Correct 87 ms 188172 KB Output is correct
11 Correct 84 ms 188172 KB Output is correct
12 Correct 93 ms 188068 KB Output is correct
13 Correct 89 ms 188108 KB Output is correct
14 Correct 90 ms 188168 KB Output is correct
15 Correct 84 ms 188136 KB Output is correct
16 Correct 89 ms 188108 KB Output is correct
17 Correct 87 ms 188184 KB Output is correct
18 Correct 85 ms 188104 KB Output is correct
19 Correct 95 ms 189468 KB Output is correct
20 Correct 108 ms 190028 KB Output is correct
21 Correct 109 ms 190432 KB Output is correct
22 Correct 95 ms 189516 KB Output is correct
23 Correct 121 ms 189468 KB Output is correct
24 Correct 96 ms 190716 KB Output is correct
25 Correct 107 ms 190880 KB Output is correct
26 Correct 90 ms 189564 KB Output is correct
27 Correct 97 ms 189520 KB Output is correct
28 Correct 94 ms 189540 KB Output is correct
29 Correct 124 ms 191384 KB Output is correct
30 Correct 94 ms 189996 KB Output is correct
31 Correct 110 ms 193796 KB Output is correct
32 Correct 121 ms 191448 KB Output is correct
33 Correct 121 ms 191436 KB Output is correct
34 Correct 113 ms 194316 KB Output is correct
35 Correct 123 ms 194408 KB Output is correct
36 Correct 118 ms 191700 KB Output is correct
37 Correct 112 ms 191560 KB Output is correct
38 Correct 88 ms 191436 KB Output is correct
39 Correct 510 ms 219884 KB Output is correct
40 Correct 97 ms 191820 KB Output is correct
41 Correct 104 ms 195696 KB Output is correct
42 Correct 143 ms 192788 KB Output is correct
43 Correct 117 ms 195768 KB Output is correct
44 Incorrect 149 ms 206300 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 188056 KB Output is correct
2 Correct 89 ms 188196 KB Output is correct
3 Correct 87 ms 188092 KB Output is correct
4 Correct 88 ms 188224 KB Output is correct
5 Correct 97 ms 188268 KB Output is correct
6 Correct 103 ms 188164 KB Output is correct
7 Correct 88 ms 188080 KB Output is correct
8 Correct 89 ms 188184 KB Output is correct
9 Correct 94 ms 188164 KB Output is correct
10 Correct 101 ms 188148 KB Output is correct
11 Correct 89 ms 188104 KB Output is correct
12 Correct 88 ms 188196 KB Output is correct
13 Correct 97 ms 188116 KB Output is correct
14 Correct 92 ms 188084 KB Output is correct
15 Correct 88 ms 188168 KB Output is correct
16 Correct 88 ms 188176 KB Output is correct
17 Correct 96 ms 188104 KB Output is correct
18 Correct 95 ms 188092 KB Output is correct
19 Correct 84 ms 188088 KB Output is correct
20 Correct 88 ms 188304 KB Output is correct
21 Correct 87 ms 188140 KB Output is correct
22 Correct 88 ms 188172 KB Output is correct
23 Correct 95 ms 188060 KB Output is correct
24 Correct 100 ms 188080 KB Output is correct
25 Correct 91 ms 188124 KB Output is correct
26 Correct 87 ms 188180 KB Output is correct
27 Correct 88 ms 188144 KB Output is correct
28 Correct 98 ms 188088 KB Output is correct
29 Correct 91 ms 188104 KB Output is correct
30 Correct 90 ms 188264 KB Output is correct
31 Correct 87 ms 188192 KB Output is correct
32 Correct 90 ms 188120 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 188068 KB Output is correct
2 Correct 95 ms 188248 KB Output is correct
3 Correct 98 ms 188172 KB Output is correct
4 Correct 88 ms 188076 KB Output is correct
5 Correct 89 ms 188108 KB Output is correct
6 Correct 86 ms 188176 KB Output is correct
7 Correct 89 ms 188160 KB Output is correct
8 Correct 91 ms 188080 KB Output is correct
9 Correct 102 ms 188124 KB Output is correct
10 Correct 109 ms 188104 KB Output is correct
11 Correct 90 ms 188152 KB Output is correct
12 Correct 86 ms 188168 KB Output is correct
13 Correct 92 ms 188068 KB Output is correct
14 Correct 88 ms 188108 KB Output is correct
15 Correct 86 ms 188072 KB Output is correct
16 Correct 92 ms 188292 KB Output is correct
17 Correct 94 ms 188140 KB Output is correct
18 Correct 97 ms 188100 KB Output is correct
19 Correct 92 ms 188048 KB Output is correct
20 Correct 95 ms 188100 KB Output is correct
21 Correct 91 ms 188260 KB Output is correct
22 Correct 89 ms 188156 KB Output is correct
23 Correct 94 ms 188152 KB Output is correct
24 Correct 94 ms 188236 KB Output is correct
25 Correct 91 ms 188992 KB Output is correct
26 Correct 99 ms 190072 KB Output is correct
27 Correct 102 ms 190412 KB Output is correct
28 Correct 97 ms 190456 KB Output is correct
29 Correct 94 ms 189940 KB Output is correct
30 Correct 94 ms 189928 KB Output is correct
31 Correct 94 ms 189496 KB Output is correct
32 Correct 101 ms 189608 KB Output is correct
33 Correct 95 ms 189460 KB Output is correct
34 Correct 114 ms 192304 KB Output is correct
35 Correct 121 ms 193896 KB Output is correct
36 Correct 115 ms 193880 KB Output is correct
37 Correct 114 ms 192704 KB Output is correct
38 Correct 100 ms 192672 KB Output is correct
39 Correct 188 ms 202784 KB Output is correct
40 Correct 351 ms 230920 KB Output is correct
41 Correct 405 ms 245236 KB Output is correct
42 Correct 350 ms 244972 KB Output is correct
43 Correct 139 ms 233112 KB Output is correct
44 Correct 153 ms 233076 KB Output is correct
45 Correct 290 ms 235804 KB Output is correct
46 Correct 322 ms 235756 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 188056 KB Output is correct
2 Correct 89 ms 188196 KB Output is correct
3 Correct 87 ms 188092 KB Output is correct
4 Correct 88 ms 188224 KB Output is correct
5 Correct 97 ms 188268 KB Output is correct
6 Correct 103 ms 188164 KB Output is correct
7 Correct 88 ms 188080 KB Output is correct
8 Correct 89 ms 188184 KB Output is correct
9 Correct 94 ms 188164 KB Output is correct
10 Correct 101 ms 188148 KB Output is correct
11 Correct 89 ms 188104 KB Output is correct
12 Correct 88 ms 188196 KB Output is correct
13 Correct 97 ms 188116 KB Output is correct
14 Correct 92 ms 188084 KB Output is correct
15 Correct 88 ms 188168 KB Output is correct
16 Correct 88 ms 188176 KB Output is correct
17 Correct 96 ms 188104 KB Output is correct
18 Correct 95 ms 188092 KB Output is correct
19 Correct 84 ms 188088 KB Output is correct
20 Correct 88 ms 188304 KB Output is correct
21 Correct 87 ms 188140 KB Output is correct
22 Correct 88 ms 188172 KB Output is correct
23 Correct 95 ms 188060 KB Output is correct
24 Correct 100 ms 188080 KB Output is correct
25 Correct 91 ms 188124 KB Output is correct
26 Correct 87 ms 188180 KB Output is correct
27 Correct 88 ms 188144 KB Output is correct
28 Correct 98 ms 188088 KB Output is correct
29 Correct 91 ms 188104 KB Output is correct
30 Correct 90 ms 188264 KB Output is correct
31 Correct 87 ms 188192 KB Output is correct
32 Correct 90 ms 188120 KB Output is correct
33 Correct 100 ms 189492 KB Output is correct
34 Correct 97 ms 188140 KB Output is correct
35 Correct 97 ms 188316 KB Output is correct
36 Correct 94 ms 189024 KB Output is correct
37 Correct 93 ms 190156 KB Output is correct
38 Correct 99 ms 189992 KB Output is correct
39 Correct 117 ms 190484 KB Output is correct
40 Correct 114 ms 189448 KB Output is correct
41 Correct 125 ms 189436 KB Output is correct
42 Correct 100 ms 190404 KB Output is correct
43 Correct 90 ms 189900 KB Output is correct
44 Correct 94 ms 189968 KB Output is correct
45 Correct 111 ms 190656 KB Output is correct
46 Correct 96 ms 190672 KB Output is correct
47 Correct 97 ms 189956 KB Output is correct
48 Correct 97 ms 189548 KB Output is correct
49 Correct 98 ms 189524 KB Output is correct
50 Correct 97 ms 189480 KB Output is correct
51 Correct 108 ms 189508 KB Output is correct
52 Correct 96 ms 189516 KB Output is correct
53 Correct 88 ms 189456 KB Output is correct
54 Correct 95 ms 189524 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 188056 KB Output is correct
2 Correct 89 ms 188196 KB Output is correct
3 Correct 87 ms 188092 KB Output is correct
4 Correct 88 ms 188224 KB Output is correct
5 Correct 97 ms 188268 KB Output is correct
6 Correct 103 ms 188164 KB Output is correct
7 Correct 88 ms 188080 KB Output is correct
8 Correct 89 ms 188184 KB Output is correct
9 Correct 94 ms 188164 KB Output is correct
10 Correct 101 ms 188148 KB Output is correct
11 Correct 89 ms 188104 KB Output is correct
12 Correct 88 ms 188196 KB Output is correct
13 Correct 97 ms 188116 KB Output is correct
14 Correct 92 ms 188084 KB Output is correct
15 Correct 88 ms 188168 KB Output is correct
16 Correct 88 ms 188176 KB Output is correct
17 Correct 96 ms 188104 KB Output is correct
18 Correct 95 ms 188092 KB Output is correct
19 Correct 84 ms 188088 KB Output is correct
20 Correct 88 ms 188304 KB Output is correct
21 Correct 87 ms 188140 KB Output is correct
22 Correct 88 ms 188172 KB Output is correct
23 Correct 95 ms 188060 KB Output is correct
24 Correct 100 ms 188080 KB Output is correct
25 Correct 91 ms 188124 KB Output is correct
26 Correct 87 ms 188180 KB Output is correct
27 Correct 88 ms 188144 KB Output is correct
28 Correct 98 ms 188088 KB Output is correct
29 Correct 91 ms 188104 KB Output is correct
30 Correct 90 ms 188264 KB Output is correct
31 Correct 87 ms 188192 KB Output is correct
32 Correct 90 ms 188120 KB Output is correct
33 Correct 100 ms 189492 KB Output is correct
34 Correct 97 ms 188140 KB Output is correct
35 Correct 97 ms 188316 KB Output is correct
36 Correct 94 ms 189024 KB Output is correct
37 Correct 93 ms 190156 KB Output is correct
38 Correct 99 ms 189992 KB Output is correct
39 Correct 117 ms 190484 KB Output is correct
40 Correct 114 ms 189448 KB Output is correct
41 Correct 125 ms 189436 KB Output is correct
42 Correct 100 ms 190404 KB Output is correct
43 Correct 90 ms 189900 KB Output is correct
44 Correct 94 ms 189968 KB Output is correct
45 Correct 111 ms 190656 KB Output is correct
46 Correct 96 ms 190672 KB Output is correct
47 Correct 97 ms 189956 KB Output is correct
48 Correct 97 ms 189548 KB Output is correct
49 Correct 98 ms 189524 KB Output is correct
50 Correct 97 ms 189480 KB Output is correct
51 Correct 108 ms 189508 KB Output is correct
52 Correct 96 ms 189516 KB Output is correct
53 Correct 88 ms 189456 KB Output is correct
54 Correct 95 ms 189524 KB Output is correct
55 Correct 122 ms 191436 KB Output is correct
56 Correct 104 ms 190116 KB Output is correct
57 Correct 112 ms 192252 KB Output is correct
58 Correct 111 ms 191428 KB Output is correct
59 Correct 118 ms 193948 KB Output is correct
60 Correct 121 ms 191436 KB Output is correct
61 Correct 119 ms 191568 KB Output is correct
62 Correct 111 ms 193940 KB Output is correct
63 Correct 92 ms 192604 KB Output is correct
64 Correct 97 ms 192636 KB Output is correct
65 Correct 113 ms 194360 KB Output is correct
66 Correct 122 ms 194356 KB Output is correct
67 Correct 123 ms 192960 KB Output is correct
68 Correct 107 ms 191560 KB Output is correct
69 Correct 113 ms 191500 KB Output is correct
70 Correct 136 ms 191500 KB Output is correct
71 Correct 109 ms 191692 KB Output is correct
72 Correct 107 ms 191712 KB Output is correct
73 Correct 121 ms 191584 KB Output is correct
74 Correct 111 ms 191480 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 188164 KB Output is correct
2 Correct 88 ms 188168 KB Output is correct
3 Correct 91 ms 188196 KB Output is correct
4 Correct 89 ms 188108 KB Output is correct
5 Correct 90 ms 188152 KB Output is correct
6 Correct 89 ms 188312 KB Output is correct
7 Correct 91 ms 188292 KB Output is correct
8 Correct 91 ms 188212 KB Output is correct
9 Correct 85 ms 188112 KB Output is correct
10 Correct 87 ms 188172 KB Output is correct
11 Correct 84 ms 188172 KB Output is correct
12 Correct 93 ms 188068 KB Output is correct
13 Correct 89 ms 188108 KB Output is correct
14 Correct 90 ms 188168 KB Output is correct
15 Correct 84 ms 188136 KB Output is correct
16 Correct 89 ms 188108 KB Output is correct
17 Correct 87 ms 188184 KB Output is correct
18 Correct 85 ms 188104 KB Output is correct
19 Correct 95 ms 189468 KB Output is correct
20 Correct 108 ms 190028 KB Output is correct
21 Correct 109 ms 190432 KB Output is correct
22 Correct 95 ms 189516 KB Output is correct
23 Correct 121 ms 189468 KB Output is correct
24 Correct 96 ms 190716 KB Output is correct
25 Correct 107 ms 190880 KB Output is correct
26 Correct 90 ms 189564 KB Output is correct
27 Correct 97 ms 189520 KB Output is correct
28 Correct 94 ms 189540 KB Output is correct
29 Correct 124 ms 191384 KB Output is correct
30 Correct 94 ms 189996 KB Output is correct
31 Correct 110 ms 193796 KB Output is correct
32 Correct 121 ms 191448 KB Output is correct
33 Correct 121 ms 191436 KB Output is correct
34 Correct 113 ms 194316 KB Output is correct
35 Correct 123 ms 194408 KB Output is correct
36 Correct 118 ms 191700 KB Output is correct
37 Correct 112 ms 191560 KB Output is correct
38 Correct 88 ms 191436 KB Output is correct
39 Correct 510 ms 219884 KB Output is correct
40 Correct 97 ms 191820 KB Output is correct
41 Correct 104 ms 195696 KB Output is correct
42 Correct 143 ms 192788 KB Output is correct
43 Correct 117 ms 195768 KB Output is correct
44 Incorrect 149 ms 206300 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 188164 KB Output is correct
2 Correct 88 ms 188168 KB Output is correct
3 Correct 91 ms 188196 KB Output is correct
4 Correct 89 ms 188108 KB Output is correct
5 Correct 90 ms 188152 KB Output is correct
6 Correct 89 ms 188312 KB Output is correct
7 Correct 91 ms 188292 KB Output is correct
8 Correct 91 ms 188212 KB Output is correct
9 Correct 85 ms 188112 KB Output is correct
10 Correct 87 ms 188172 KB Output is correct
11 Correct 84 ms 188172 KB Output is correct
12 Correct 93 ms 188068 KB Output is correct
13 Correct 89 ms 188108 KB Output is correct
14 Correct 90 ms 188168 KB Output is correct
15 Correct 84 ms 188136 KB Output is correct
16 Correct 89 ms 188108 KB Output is correct
17 Correct 87 ms 188184 KB Output is correct
18 Correct 85 ms 188104 KB Output is correct
19 Correct 95 ms 189468 KB Output is correct
20 Correct 108 ms 190028 KB Output is correct
21 Correct 109 ms 190432 KB Output is correct
22 Correct 95 ms 189516 KB Output is correct
23 Correct 121 ms 189468 KB Output is correct
24 Correct 96 ms 190716 KB Output is correct
25 Correct 107 ms 190880 KB Output is correct
26 Correct 90 ms 189564 KB Output is correct
27 Correct 97 ms 189520 KB Output is correct
28 Correct 94 ms 189540 KB Output is correct
29 Correct 124 ms 191384 KB Output is correct
30 Correct 94 ms 189996 KB Output is correct
31 Correct 110 ms 193796 KB Output is correct
32 Correct 121 ms 191448 KB Output is correct
33 Correct 121 ms 191436 KB Output is correct
34 Correct 113 ms 194316 KB Output is correct
35 Correct 123 ms 194408 KB Output is correct
36 Correct 118 ms 191700 KB Output is correct
37 Correct 112 ms 191560 KB Output is correct
38 Correct 88 ms 191436 KB Output is correct
39 Correct 510 ms 219884 KB Output is correct
40 Correct 97 ms 191820 KB Output is correct
41 Correct 104 ms 195696 KB Output is correct
42 Correct 143 ms 192788 KB Output is correct
43 Correct 117 ms 195768 KB Output is correct
44 Incorrect 149 ms 206300 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 188164 KB Output is correct
2 Correct 88 ms 188168 KB Output is correct
3 Correct 91 ms 188196 KB Output is correct
4 Correct 89 ms 188108 KB Output is correct
5 Correct 90 ms 188152 KB Output is correct
6 Correct 89 ms 188312 KB Output is correct
7 Correct 91 ms 188292 KB Output is correct
8 Correct 91 ms 188212 KB Output is correct
9 Correct 85 ms 188112 KB Output is correct
10 Correct 87 ms 188172 KB Output is correct
11 Correct 84 ms 188172 KB Output is correct
12 Correct 93 ms 188068 KB Output is correct
13 Correct 89 ms 188108 KB Output is correct
14 Correct 90 ms 188168 KB Output is correct
15 Correct 84 ms 188136 KB Output is correct
16 Correct 89 ms 188108 KB Output is correct
17 Correct 87 ms 188184 KB Output is correct
18 Correct 85 ms 188104 KB Output is correct
19 Correct 95 ms 189468 KB Output is correct
20 Correct 108 ms 190028 KB Output is correct
21 Correct 109 ms 190432 KB Output is correct
22 Correct 95 ms 189516 KB Output is correct
23 Correct 121 ms 189468 KB Output is correct
24 Correct 96 ms 190716 KB Output is correct
25 Correct 107 ms 190880 KB Output is correct
26 Correct 90 ms 189564 KB Output is correct
27 Correct 97 ms 189520 KB Output is correct
28 Correct 94 ms 189540 KB Output is correct
29 Correct 124 ms 191384 KB Output is correct
30 Correct 94 ms 189996 KB Output is correct
31 Correct 110 ms 193796 KB Output is correct
32 Correct 121 ms 191448 KB Output is correct
33 Correct 121 ms 191436 KB Output is correct
34 Correct 113 ms 194316 KB Output is correct
35 Correct 123 ms 194408 KB Output is correct
36 Correct 118 ms 191700 KB Output is correct
37 Correct 112 ms 191560 KB Output is correct
38 Correct 88 ms 191436 KB Output is correct
39 Correct 510 ms 219884 KB Output is correct
40 Correct 97 ms 191820 KB Output is correct
41 Correct 104 ms 195696 KB Output is correct
42 Correct 143 ms 192788 KB Output is correct
43 Correct 117 ms 195768 KB Output is correct
44 Incorrect 149 ms 206300 KB Output isn't correct
45 Halted 0 ms 0 KB -