oj.uz

Submission #733558

# Submission time Handle Problem Language Result Execution time Memory
733558 2023-05-01T03:26:46 Z minhcool Mars (APIO22_mars) C++17
36 / 100
 1072 ms 36000 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
 
void prep(int id){// preparing the route for (i, j)
	// in order to get 36, we don't need the SA the path
	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 = 0; i < (2 * n + 1); i++){
		for(int j = 0; j < (2 * n + 1); j++){
			for(int k = 0; k < n; k++){
				route[id][i][j].pb({i - 2 * min(k, i / 2), j - 2 * min(k, j / 2)});
			}
			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++;
			}
		}	
	}
	for(int i = 0; i <= 2 * n; i++){
		for(int j = 0; j <= 2 * n; j++){
			for(int k = 0; k < n; k++){
				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){
	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';
		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 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 59 ms 24336 KB Output is correct
15 Correct 92 ms 18960 KB Output is correct
16 Correct 86 ms 18940 KB Output is correct
17 Correct 93 ms 18964 KB Output is correct
18 Correct 94 ms 18980 KB Output is correct
19 Correct 93 ms 18916 KB Output is correct
20 Correct 91 ms 18912 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 59 ms 24336 KB Output is correct
15 Correct 92 ms 18960 KB Output is correct
16 Correct 86 ms 18940 KB Output is correct
17 Correct 93 ms 18964 KB Output is correct
18 Correct 94 ms 18980 KB Output is correct
19 Correct 93 ms 18916 KB Output is correct
20 Correct 91 ms 18912 KB Output is correct
21 Correct 177 ms 21948 KB Output is correct
22 Correct 326 ms 25812 KB Output is correct
23 Correct 319 ms 25816 KB Output is correct
24 Correct 315 ms 25788 KB Output is correct
25 Correct 327 ms 25792 KB Output is correct
26 Correct 326 ms 25796 KB Output is correct
27 Correct 336 ms 25800 KB Output is correct
28 Correct 334 ms 25900 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 59 ms 24336 KB Output is correct
15 Correct 92 ms 18960 KB Output is correct
16 Correct 86 ms 18940 KB Output is correct
17 Correct 93 ms 18964 KB Output is correct
18 Correct 94 ms 18980 KB Output is correct
19 Correct 93 ms 18916 KB Output is correct
20 Correct 91 ms 18912 KB Output is correct
21 Correct 177 ms 21948 KB Output is correct
22 Correct 326 ms 25812 KB Output is correct
23 Correct 319 ms 25816 KB Output is correct
24 Correct 315 ms 25788 KB Output is correct
25 Correct 327 ms 25792 KB Output is correct
26 Correct 326 ms 25796 KB Output is correct
27 Correct 336 ms 25800 KB Output is correct
28 Correct 334 ms 25900 KB Output is correct
29 Correct 612 ms 30436 KB Output is correct
30 Correct 1049 ms 35976 KB Output is correct
31 Correct 1072 ms 36000 KB Output is correct
32 Correct 1018 ms 35812 KB Output is correct
33 Correct 1044 ms 35880 KB Output is correct
34 Correct 1041 ms 35816 KB Output is correct
35 Correct 1030 ms 35936 KB Output is correct
36 Correct 1043 ms 35888 KB Output is correct

Subtask #6
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 59 ms 24336 KB Output is correct
15 Correct 92 ms 18960 KB Output is correct
16 Correct 86 ms 18940 KB Output is correct
17 Correct 93 ms 18964 KB Output is correct
18 Correct 94 ms 18980 KB Output is correct
19 Correct 93 ms 18916 KB Output is correct
20 Correct 91 ms 18912 KB Output is correct
21 Correct 177 ms 21948 KB Output is correct
22 Correct 326 ms 25812 KB Output is correct
23 Correct 319 ms 25816 KB Output is correct
24 Correct 315 ms 25788 KB Output is correct
25 Correct 327 ms 25792 KB Output is correct
26 Correct 326 ms 25796 KB Output is correct
27 Correct 336 ms 25800 KB Output is correct
28 Correct 334 ms 25900 KB Output is correct
29 Correct 612 ms 30436 KB Output is correct
30 Correct 1049 ms 35976 KB Output is correct
31 Correct 1072 ms 36000 KB Output is correct
32 Correct 1018 ms 35812 KB Output is correct
33 Correct 1044 ms 35880 KB Output is correct
34 Correct 1041 ms 35816 KB Output is correct
35 Correct 1030 ms 35936 KB Output is correct
36 Correct 1043 ms 35888 KB Output is correct
37 Incorrect 229 ms 5276 KB Incorrect
38 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 59 ms 24336 KB Output is correct
15 Correct 92 ms 18960 KB Output is correct
16 Correct 86 ms 18940 KB Output is correct
17 Correct 93 ms 18964 KB Output is correct
18 Correct 94 ms 18980 KB Output is correct
19 Correct 93 ms 18916 KB Output is correct
20 Correct 91 ms 18912 KB Output is correct
21 Correct 177 ms 21948 KB Output is correct
22 Correct 326 ms 25812 KB Output is correct
23 Correct 319 ms 25816 KB Output is correct
24 Correct 315 ms 25788 KB Output is correct
25 Correct 327 ms 25792 KB Output is correct
26 Correct 326 ms 25796 KB Output is correct
27 Correct 336 ms 25800 KB Output is correct
28 Correct 334 ms 25900 KB Output is correct
29 Correct 612 ms 30436 KB Output is correct
30 Correct 1049 ms 35976 KB Output is correct
31 Correct 1072 ms 36000 KB Output is correct
32 Correct 1018 ms 35812 KB Output is correct
33 Correct 1044 ms 35880 KB Output is correct
34 Correct 1041 ms 35816 KB Output is correct
35 Correct 1030 ms 35936 KB Output is correct
36 Correct 1043 ms 35888 KB Output is correct
37 Incorrect 229 ms 5276 KB Incorrect
38 Halted 0 ms 0 KB -

Subtask #8
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 59 ms 24336 KB Output is correct
15 Correct 92 ms 18960 KB Output is correct
16 Correct 86 ms 18940 KB Output is correct
17 Correct 93 ms 18964 KB Output is correct
18 Correct 94 ms 18980 KB Output is correct
19 Correct 93 ms 18916 KB Output is correct
20 Correct 91 ms 18912 KB Output is correct
21 Correct 177 ms 21948 KB Output is correct
22 Correct 326 ms 25812 KB Output is correct
23 Correct 319 ms 25816 KB Output is correct
24 Correct 315 ms 25788 KB Output is correct
25 Correct 327 ms 25792 KB Output is correct
26 Correct 326 ms 25796 KB Output is correct
27 Correct 336 ms 25800 KB Output is correct
28 Correct 334 ms 25900 KB Output is correct
29 Correct 612 ms 30436 KB Output is correct
30 Correct 1049 ms 35976 KB Output is correct
31 Correct 1072 ms 36000 KB Output is correct
32 Correct 1018 ms 35812 KB Output is correct
33 Correct 1044 ms 35880 KB Output is correct
34 Correct 1041 ms 35816 KB Output is correct
35 Correct 1030 ms 35936 KB Output is correct
36 Correct 1043 ms 35888 KB Output is correct
37 Incorrect 229 ms 5276 KB Incorrect
38 Halted 0 ms 0 KB -

Subtask #9
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 59 ms 24336 KB Output is correct
15 Correct 92 ms 18960 KB Output is correct
16 Correct 86 ms 18940 KB Output is correct
17 Correct 93 ms 18964 KB Output is correct
18 Correct 94 ms 18980 KB Output is correct
19 Correct 93 ms 18916 KB Output is correct
20 Correct 91 ms 18912 KB Output is correct
21 Correct 177 ms 21948 KB Output is correct
22 Correct 326 ms 25812 KB Output is correct
23 Correct 319 ms 25816 KB Output is correct
24 Correct 315 ms 25788 KB Output is correct
25 Correct 327 ms 25792 KB Output is correct
26 Correct 326 ms 25796 KB Output is correct
27 Correct 336 ms 25800 KB Output is correct
28 Correct 334 ms 25900 KB Output is correct
29 Correct 612 ms 30436 KB Output is correct
30 Correct 1049 ms 35976 KB Output is correct
31 Correct 1072 ms 36000 KB Output is correct
32 Correct 1018 ms 35812 KB Output is correct
33 Correct 1044 ms 35880 KB Output is correct
34 Correct 1041 ms 35816 KB Output is correct
35 Correct 1030 ms 35936 KB Output is correct
36 Correct 1043 ms 35888 KB Output is correct
37 Incorrect 229 ms 5276 KB Incorrect
38 Halted 0 ms 0 KB -

Subtask #10
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 11284 KB Output is correct
2 Correct 13 ms 11076 KB Output is correct
3 Correct 12 ms 11184 KB Output is correct
4 Correct 15 ms 11368 KB Output is correct
5 Correct 15 ms 11292 KB Output is correct
6 Correct 16 ms 11180 KB Output is correct
7 Correct 20 ms 16380 KB Output is correct
8 Correct 26 ms 13540 KB Output is correct
9 Correct 27 ms 13736 KB Output is correct
10 Correct 26 ms 13764 KB Output is correct
11 Correct 24 ms 13768 KB Output is correct
12 Correct 26 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 59 ms 24336 KB Output is correct
15 Correct 92 ms 18960 KB Output is correct
16 Correct 86 ms 18940 KB Output is correct
17 Correct 93 ms 18964 KB Output is correct
18 Correct 94 ms 18980 KB Output is correct
19 Correct 93 ms 18916 KB Output is correct
20 Correct 91 ms 18912 KB Output is correct
21 Correct 177 ms 21948 KB Output is correct
22 Correct 326 ms 25812 KB Output is correct
23 Correct 319 ms 25816 KB Output is correct
24 Correct 315 ms 25788 KB Output is correct
25 Correct 327 ms 25792 KB Output is correct
26 Correct 326 ms 25796 KB Output is correct
27 Correct 336 ms 25800 KB Output is correct
28 Correct 334 ms 25900 KB Output is correct
29 Correct 612 ms 30436 KB Output is correct
30 Correct 1049 ms 35976 KB Output is correct
31 Correct 1072 ms 36000 KB Output is correct
32 Correct 1018 ms 35812 KB Output is correct
33 Correct 1044 ms 35880 KB Output is correct
34 Correct 1041 ms 35816 KB Output is correct
35 Correct 1030 ms 35936 KB Output is correct
36 Correct 1043 ms 35888 KB Output is correct
37 Incorrect 229 ms 5276 KB Incorrect
38 Halted 0 ms 0 KB -