oj.uz

Submission #733751

# Submission time Handle Problem Language Result Execution time Memory
733751 2023-05-01T09:00:25 Z minhcool Mars (APIO22_mars) C++17
54 / 100
 519 ms 65832 KB 
#include "mars.h"
#include<bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 35;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
vector<ii> route[N][N][N];
int cnt[N][N][N][N];
ii save[N][N][N][N][105];// cell (i, j) at phase k, the h-th bit will save the value of what node
 
int mx = -1;
 
void prep(int id){// preparing the route for (i, j)
	// in order to get 36, we don't need the SA the path
    if(route[id][0][0].size()) return;
	int n = id;
	for(int i = 0; i < (2 * n + 1); i++){
		for(int j = 0; j < (2 * n + 1); j++){
			route[id][i][j].clear();
			for(int k = 0; k < (2 * n + 1); k++) cnt[id][i][j][k] = 0;
		}
	}
	for(int i = 2 * n; i >= 0; i--){
		for(int j = 2 * n; j >= 0; j--){
			/*
			for(int k = 0; k < n; k++){
				route[id][i][j].pb({i - 2 * max(0, min(k, (i - 1) / 2)), j - 2 * max(0, min(k, (j - 1) / 2))});
			}*/
			route[id][i][j].pb({i, j});
			ii lst = {i, j};
			for(int k = 1; k < n; k++){
				//route[id][i][j].pb({i - 2 * max(0, min(k, (i - 1) / 2)), j - 2 * max(0, min(k, (j - 1) / 2))});
				bool ck = 1;
				vector<pair<int, ii>> cans;
				for(int temp1 = -2; temp1 <= 0; temp1++){
					if(!ck) break;
					for(int temp2 = -2; temp2 <= 0; temp2++){
						if((lst.fi + temp1) < 0 || (lst.se + temp2) < 0) continue;
                        if((lst.fi + temp1) > (2 * n - 2 * k)  || (lst.se + temp2) > (2 * n - 2 * k)) continue;
						//if(cnt[id][lst.fi + temp1][lst.se + temp2][k] >= 100) continue;
						cans.pb({cnt[id][lst.fi + temp1][lst.se + temp2][k] - 7 * temp1 - 3 * temp2, {-(lst.fi + temp1), -(lst.se + temp2)}});
						//ck = 0;
						//break;
					}
				}
				sort(cans.begin(), cans.end());
				route[id][i][j].pb({-cans[0].se.fi, -cans[0].se.se});
				lst = {-cans[0].se.fi, -cans[0].se.se};
              //assert(!ck);
			}
			int itr = 0;
			for(auto it : route[id][i][j]){
				//cout << i << " " << j << " " << it.fi << " " << it.se << " " << itr << "\n";
				save[id][it.fi][it.se][itr][cnt[id][it.fi][it.se][itr]] = {i, j};
				cnt[id][it.fi][it.se][itr]++;
				itr++;
				mx = max(mx, cnt[id][it.fi][it.se][itr]);
			}
		}	
	}
	for(int i = 0; i <= 2 * n; i++){
		for(int j = 0; j <= 2 * n; j++){
			for(int k = 0; k < 1; k++){
				//if(i <= 4 && j <= 4) cout << i << " " << j << " " << k << " " << cnt[id][i][j][n - 2] << " " << cnt[id][i][j][n - 1] << "\n";
				/*
				for(int kk = 0; kk < cnt[id][i][j][k]; kk++){
					//cout << i << " " << j << " " << k << " " << kk << " " << save[i][j][k][kk].fi << " " << save[i][j][k][kk].se << "\n";	
				}*/
			}	
		}
	}
}
 
bool vis[N][N];
int val[N][N];
 
void ff(int i, int j, int n){
	//cout << i << " " << j << "\n";
	if(i < 0 || j < 0 || i >= (2 * n + 1) || j >= (2 * n + 1) || !val[i][j]) return;
	val[i][j] = 0;
	ff(i + 1, j, n);
	ff(i - 1, j, n);
	ff(i, j - 1, n);
	ff(i, j + 1, n);
}
 
string process(vector<vector<string>> a, int i, int j, int k, int n){
	if(!(i + j + k)) mx = -1;
	prep(n);
	//cout << "OK\n";
	for(int ii = 0; ii <= 2 * n; ii++){
		for(int jj = 0; jj <= 2 * n; jj++) vis[ii][jj] = 0;
	}
	for(int ii = 0; ii <= 2; ii++){
		for(int jj = 0; jj <= 2; jj++){
			for(int kk = 0; kk < cnt[n][i + ii][j + jj][k]; kk++){
				int x = save[n][i + ii][j + jj][k][kk].fi, y = save[n][i + ii][j + jj][k][kk].se;
				val[x][y] = a[ii][jj][kk] - '0';
				vis[x][y] = 1;
				//cout << i << " " << j << " " << k << " " << x << " " << y << " " << val[x][y] << "\n";
			}
		}
	}
	if(k == n - 1){
		//exit(0);
		int ans = 0;
		/*
		for(int i = 0; i < (2 * n) + 1; i++){
			for(int j = 0; j < (2 * n) + 1; j++) cout << val[i][j] << " ";
			cout << "\n";
		}*/
		for(int i = 0; i < (2 * n + 1); i++){
			for(int j = 0; j < (2 * n + 1); j++){
				assert(vis[i][j]);
			//	cout << "OK " << i << " " << j << " " << val[i][j] << "\n";
				if(!val[i][j]) continue;
				ans++;
				ff(i, j, n);
			}
		}
		//cout << ans << "\n";
		string temp;
		for(int kk = 0; kk < 100; kk++) temp += '0';
		//cout << mx << "\n";
		for(int kk = 0; kk < 20; kk++) if(ans & (1LL << kk)) temp[kk] = '1';
		return temp;
	}
	else{
		string temp;
		for(int kk = 0; kk < 100; kk++) temp += '0';
		for(int kk = 0; kk < cnt[n][i][j][k + 1]; kk++){
			int x = save[n][i][j][k + 1][kk].fi, y = save[n][i][j][k + 1][kk].se;
			assert(vis[x][y]);
			temp[kk] = char(48 + val[x][y]);
		}
		return temp;
	}
}

Compilation message

mars.cpp:16:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   16 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct
14 Correct 44 ms 24304 KB Output is correct
15 Correct 53 ms 18904 KB Output is correct
16 Correct 53 ms 19112 KB Output is correct
17 Correct 49 ms 18960 KB Output is correct
18 Correct 54 ms 18952 KB Output is correct
19 Correct 55 ms 18944 KB Output is correct
20 Correct 51 ms 18984 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct
14 Correct 44 ms 24304 KB Output is correct
15 Correct 53 ms 18904 KB Output is correct
16 Correct 53 ms 19112 KB Output is correct
17 Correct 49 ms 18960 KB Output is correct
18 Correct 54 ms 18952 KB Output is correct
19 Correct 55 ms 18944 KB Output is correct
20 Correct 51 ms 18984 KB Output is correct
21 Correct 77 ms 22036 KB Output is correct
22 Correct 108 ms 25900 KB Output is correct
23 Correct 104 ms 25864 KB Output is correct
24 Correct 104 ms 25796 KB Output is correct
25 Correct 105 ms 25836 KB Output is correct
26 Correct 103 ms 25904 KB Output is correct
27 Correct 107 ms 25844 KB Output is correct
28 Correct 100 ms 25840 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct
14 Correct 44 ms 24304 KB Output is correct
15 Correct 53 ms 18904 KB Output is correct
16 Correct 53 ms 19112 KB Output is correct
17 Correct 49 ms 18960 KB Output is correct
18 Correct 54 ms 18952 KB Output is correct
19 Correct 55 ms 18944 KB Output is correct
20 Correct 51 ms 18984 KB Output is correct
21 Correct 77 ms 22036 KB Output is correct
22 Correct 108 ms 25900 KB Output is correct
23 Correct 104 ms 25864 KB Output is correct
24 Correct 104 ms 25796 KB Output is correct
25 Correct 105 ms 25836 KB Output is correct
26 Correct 103 ms 25904 KB Output is correct
27 Correct 107 ms 25844 KB Output is correct
28 Correct 100 ms 25840 KB Output is correct
29 Correct 143 ms 30564 KB Output is correct
30 Correct 189 ms 35964 KB Output is correct
31 Correct 200 ms 35964 KB Output is correct
32 Correct 189 ms 35900 KB Output is correct
33 Correct 194 ms 35932 KB Output is correct
34 Correct 194 ms 35956 KB Output is correct
35 Correct 192 ms 35968 KB Output is correct
36 Correct 212 ms 36028 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct
14 Correct 44 ms 24304 KB Output is correct
15 Correct 53 ms 18904 KB Output is correct
16 Correct 53 ms 19112 KB Output is correct
17 Correct 49 ms 18960 KB Output is correct
18 Correct 54 ms 18952 KB Output is correct
19 Correct 55 ms 18944 KB Output is correct
20 Correct 51 ms 18984 KB Output is correct
21 Correct 77 ms 22036 KB Output is correct
22 Correct 108 ms 25900 KB Output is correct
23 Correct 104 ms 25864 KB Output is correct
24 Correct 104 ms 25796 KB Output is correct
25 Correct 105 ms 25836 KB Output is correct
26 Correct 103 ms 25904 KB Output is correct
27 Correct 107 ms 25844 KB Output is correct
28 Correct 100 ms 25840 KB Output is correct
29 Correct 143 ms 30564 KB Output is correct
30 Correct 189 ms 35964 KB Output is correct
31 Correct 200 ms 35964 KB Output is correct
32 Correct 189 ms 35900 KB Output is correct
33 Correct 194 ms 35932 KB Output is correct
34 Correct 194 ms 35956 KB Output is correct
35 Correct 192 ms 35968 KB Output is correct
36 Correct 212 ms 36028 KB Output is correct
37 Correct 255 ms 42044 KB Output is correct
38 Correct 328 ms 49260 KB Output is correct
39 Correct 328 ms 49140 KB Output is correct
40 Correct 319 ms 49160 KB Output is correct
41 Correct 322 ms 49040 KB Output is correct
42 Correct 316 ms 49188 KB Output is correct
43 Correct 331 ms 49136 KB Output is correct
44 Correct 328 ms 49180 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct
14 Correct 44 ms 24304 KB Output is correct
15 Correct 53 ms 18904 KB Output is correct
16 Correct 53 ms 19112 KB Output is correct
17 Correct 49 ms 18960 KB Output is correct
18 Correct 54 ms 18952 KB Output is correct
19 Correct 55 ms 18944 KB Output is correct
20 Correct 51 ms 18984 KB Output is correct
21 Correct 77 ms 22036 KB Output is correct
22 Correct 108 ms 25900 KB Output is correct
23 Correct 104 ms 25864 KB Output is correct
24 Correct 104 ms 25796 KB Output is correct
25 Correct 105 ms 25836 KB Output is correct
26 Correct 103 ms 25904 KB Output is correct
27 Correct 107 ms 25844 KB Output is correct
28 Correct 100 ms 25840 KB Output is correct
29 Correct 143 ms 30564 KB Output is correct
30 Correct 189 ms 35964 KB Output is correct
31 Correct 200 ms 35964 KB Output is correct
32 Correct 189 ms 35900 KB Output is correct
33 Correct 194 ms 35932 KB Output is correct
34 Correct 194 ms 35956 KB Output is correct
35 Correct 192 ms 35968 KB Output is correct
36 Correct 212 ms 36028 KB Output is correct
37 Correct 255 ms 42044 KB Output is correct
38 Correct 328 ms 49260 KB Output is correct
39 Correct 328 ms 49140 KB Output is correct
40 Correct 319 ms 49160 KB Output is correct
41 Correct 322 ms 49040 KB Output is correct
42 Correct 316 ms 49188 KB Output is correct
43 Correct 331 ms 49136 KB Output is correct
44 Correct 328 ms 49180 KB Output is correct
45 Correct 425 ms 56764 KB Output is correct
46 Correct 502 ms 65728 KB Output is correct
47 Correct 501 ms 65668 KB Output is correct
48 Correct 498 ms 65640 KB Output is correct
49 Correct 502 ms 65704 KB Output is correct
50 Correct 515 ms 65676 KB Output is correct
51 Correct 519 ms 65680 KB Output is correct
52 Correct 502 ms 65812 KB Output is correct
53 Correct 517 ms 65736 KB Output is correct
54 Correct 511 ms 65832 KB Output is correct
55 Correct 511 ms 65812 KB Output is correct
56 Correct 499 ms 65724 KB Output is correct

Subtask #8
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct
14 Correct 44 ms 24304 KB Output is correct
15 Correct 53 ms 18904 KB Output is correct
16 Correct 53 ms 19112 KB Output is correct
17 Correct 49 ms 18960 KB Output is correct
18 Correct 54 ms 18952 KB Output is correct
19 Correct 55 ms 18944 KB Output is correct
20 Correct 51 ms 18984 KB Output is correct
21 Correct 77 ms 22036 KB Output is correct
22 Correct 108 ms 25900 KB Output is correct
23 Correct 104 ms 25864 KB Output is correct
24 Correct 104 ms 25796 KB Output is correct
25 Correct 105 ms 25836 KB Output is correct
26 Correct 103 ms 25904 KB Output is correct
27 Correct 107 ms 25844 KB Output is correct
28 Correct 100 ms 25840 KB Output is correct
29 Correct 143 ms 30564 KB Output is correct
30 Correct 189 ms 35964 KB Output is correct
31 Correct 200 ms 35964 KB Output is correct
32 Correct 189 ms 35900 KB Output is correct
33 Correct 194 ms 35932 KB Output is correct
34 Correct 194 ms 35956 KB Output is correct
35 Correct 192 ms 35968 KB Output is correct
36 Correct 212 ms 36028 KB Output is correct
37 Correct 255 ms 42044 KB Output is correct
38 Correct 328 ms 49260 KB Output is correct
39 Correct 328 ms 49140 KB Output is correct
40 Correct 319 ms 49160 KB Output is correct
41 Correct 322 ms 49040 KB Output is correct
42 Correct 316 ms 49188 KB Output is correct
43 Correct 331 ms 49136 KB Output is correct
44 Correct 328 ms 49180 KB Output is correct
45 Correct 425 ms 56764 KB Output is correct
46 Correct 502 ms 65728 KB Output is correct
47 Correct 501 ms 65668 KB Output is correct
48 Correct 498 ms 65640 KB Output is correct
49 Correct 502 ms 65704 KB Output is correct
50 Correct 515 ms 65676 KB Output is correct
51 Correct 519 ms 65680 KB Output is correct
52 Correct 502 ms 65812 KB Output is correct
53 Correct 517 ms 65736 KB Output is correct
54 Correct 511 ms 65832 KB Output is correct
55 Correct 511 ms 65812 KB Output is correct
56 Correct 499 ms 65724 KB Output is correct
57 Incorrect 80 ms 9468 KB Incorrect
58 Halted 0 ms 0 KB -

Subtask #9
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct
14 Correct 44 ms 24304 KB Output is correct
15 Correct 53 ms 18904 KB Output is correct
16 Correct 53 ms 19112 KB Output is correct
17 Correct 49 ms 18960 KB Output is correct
18 Correct 54 ms 18952 KB Output is correct
19 Correct 55 ms 18944 KB Output is correct
20 Correct 51 ms 18984 KB Output is correct
21 Correct 77 ms 22036 KB Output is correct
22 Correct 108 ms 25900 KB Output is correct
23 Correct 104 ms 25864 KB Output is correct
24 Correct 104 ms 25796 KB Output is correct
25 Correct 105 ms 25836 KB Output is correct
26 Correct 103 ms 25904 KB Output is correct
27 Correct 107 ms 25844 KB Output is correct
28 Correct 100 ms 25840 KB Output is correct
29 Correct 143 ms 30564 KB Output is correct
30 Correct 189 ms 35964 KB Output is correct
31 Correct 200 ms 35964 KB Output is correct
32 Correct 189 ms 35900 KB Output is correct
33 Correct 194 ms 35932 KB Output is correct
34 Correct 194 ms 35956 KB Output is correct
35 Correct 192 ms 35968 KB Output is correct
36 Correct 212 ms 36028 KB Output is correct
37 Correct 255 ms 42044 KB Output is correct
38 Correct 328 ms 49260 KB Output is correct
39 Correct 328 ms 49140 KB Output is correct
40 Correct 319 ms 49160 KB Output is correct
41 Correct 322 ms 49040 KB Output is correct
42 Correct 316 ms 49188 KB Output is correct
43 Correct 331 ms 49136 KB Output is correct
44 Correct 328 ms 49180 KB Output is correct
45 Correct 425 ms 56764 KB Output is correct
46 Correct 502 ms 65728 KB Output is correct
47 Correct 501 ms 65668 KB Output is correct
48 Correct 498 ms 65640 KB Output is correct
49 Correct 502 ms 65704 KB Output is correct
50 Correct 515 ms 65676 KB Output is correct
51 Correct 519 ms 65680 KB Output is correct
52 Correct 502 ms 65812 KB Output is correct
53 Correct 517 ms 65736 KB Output is correct
54 Correct 511 ms 65832 KB Output is correct
55 Correct 511 ms 65812 KB Output is correct
56 Correct 499 ms 65724 KB Output is correct
57 Incorrect 80 ms 9468 KB Incorrect
58 Halted 0 ms 0 KB -

Subtask #10
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11544 KB Output is correct
2 Correct 15 ms 11240 KB Output is correct
3 Correct 13 ms 11368 KB Output is correct
4 Correct 15 ms 11380 KB Output is correct
5 Correct 14 ms 11452 KB Output is correct
6 Correct 15 ms 11224 KB Output is correct
7 Correct 23 ms 16088 KB Output is correct
8 Correct 23 ms 13696 KB Output is correct
9 Correct 23 ms 13564 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 23 ms 13712 KB Output is correct
12 Correct 23 ms 13852 KB Output is correct
13 Correct 22 ms 13760 KB Output is correct
14 Correct 44 ms 24304 KB Output is correct
15 Correct 53 ms 18904 KB Output is correct
16 Correct 53 ms 19112 KB Output is correct
17 Correct 49 ms 18960 KB Output is correct
18 Correct 54 ms 18952 KB Output is correct
19 Correct 55 ms 18944 KB Output is correct
20 Correct 51 ms 18984 KB Output is correct
21 Correct 77 ms 22036 KB Output is correct
22 Correct 108 ms 25900 KB Output is correct
23 Correct 104 ms 25864 KB Output is correct
24 Correct 104 ms 25796 KB Output is correct
25 Correct 105 ms 25836 KB Output is correct
26 Correct 103 ms 25904 KB Output is correct
27 Correct 107 ms 25844 KB Output is correct
28 Correct 100 ms 25840 KB Output is correct
29 Correct 143 ms 30564 KB Output is correct
30 Correct 189 ms 35964 KB Output is correct
31 Correct 200 ms 35964 KB Output is correct
32 Correct 189 ms 35900 KB Output is correct
33 Correct 194 ms 35932 KB Output is correct
34 Correct 194 ms 35956 KB Output is correct
35 Correct 192 ms 35968 KB Output is correct
36 Correct 212 ms 36028 KB Output is correct
37 Correct 255 ms 42044 KB Output is correct
38 Correct 328 ms 49260 KB Output is correct
39 Correct 328 ms 49140 KB Output is correct
40 Correct 319 ms 49160 KB Output is correct
41 Correct 322 ms 49040 KB Output is correct
42 Correct 316 ms 49188 KB Output is correct
43 Correct 331 ms 49136 KB Output is correct
44 Correct 328 ms 49180 KB Output is correct
45 Correct 425 ms 56764 KB Output is correct
46 Correct 502 ms 65728 KB Output is correct
47 Correct 501 ms 65668 KB Output is correct
48 Correct 498 ms 65640 KB Output is correct
49 Correct 502 ms 65704 KB Output is correct
50 Correct 515 ms 65676 KB Output is correct
51 Correct 519 ms 65680 KB Output is correct
52 Correct 502 ms 65812 KB Output is correct
53 Correct 517 ms 65736 KB Output is correct
54 Correct 511 ms 65832 KB Output is correct
55 Correct 511 ms 65812 KB Output is correct
56 Correct 499 ms 65724 KB Output is correct
57 Incorrect 80 ms 9468 KB Incorrect
58 Halted 0 ms 0 KB -