oj.uz

답안 #725275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725275 2023-04-17T06:24:29 Z Nahian9696 화성 (APIO22_mars) C++17
29 / 100
 139 ms 2816 KB 
#include "mars.h"


#include <bits/stdc++.h>

using namespace std;

// #define int  				long long

#define f0(i, n) 			for(int i = 0; i <  (n); i++)
#define f1(i, n) 			for(int i = 1; i <= (n); i++)
#define ff first
#define ss second





std::string process(std::vector <std::vector<std::string>> a, int i, int j, int k, int n)
{
	string res;
	f0(i, 100) res += '0';

	int ii = i/2, jj = j/2;


	if(k == 0) {

		


		if(n == 1) {
			bool grph[2*n+1][2*n+1] = {0};
		bool vis[2*n+1][2*n+1] = {0};
		f0(i, 2*n+1) {
			f0(j, 2*n+1) {
				grph[i][j] = 0;
				vis[i][j] = 0;
			}
		}
		int cnt = 0;

			f0(i, 2*n+1) {
				f0(j, 2*n+1) {
					if(a[i][j][0] == '1') grph[i][j] = 1;
				}
			}

			queue<pair<int, int>> q;

		f0(i, 2*n+1) {
			f0(j, 2*n+1) {
				// cout << grph[i][j] << " ";
				if(!grph[i][j]) continue;
				if(vis[i][j]) continue;
				vis[i][j] = 1;
				cnt++;
				q.push({i, j});
				while(!q.empty()) {
					auto cur = q.front();
					int x = cur.ff, y = cur.ss;
					// if(vis[x][y]) continue;
					q.pop();
					if(x+1 < 2*n+1) {
						if(grph[x+1][y] == 1) {
							if(!vis[x+1][y]) {
								vis[x+1][y] = 1;
								q.push({x+1, y});
							}
						}
					}
					if(y+1 < 2*n+1) {
						if(grph[x][y+1] == 1) {
							if(!vis[x][y+1]) {
								vis[x][y+1] = 1;
								q.push({x, y+1});
							}
						}
					}
					if(x > 0) {
						if(grph[x-1][y] == 1) {
							if(!vis[x-1][y]) {
								vis[x-1][y] = 1;
								q.push({x-1, y});
							}
						}
					}
					if(y > 0) {
						if(grph[x][y-1] == 1) {
							if(!vis[x][y-1]) {
								vis[x][y-1] = 1;
								q.push({x, y-1});
							}
						}
					}
				}
			}
			// cout << endl;
		}
		// cout << cnt << "\n";
		res = "";
		while(cnt > 0) {
			res += '0' + (cnt%2);
			cnt /= 2;
		}
		// res = string(res.rbegin(), res.rend());
		int nn = res.size();
		// string res0;

		f0(i, 100-nn) res += '0';

		// cout << res0+res << endl;

		return res;

		}











		if( (i % 2 == 0) && (j % 2 == 0) ) {

			if(a[0][0][0] == '1') {
				a[0][0] = res;
				a[0][0][ (n+1)*(jj) + (ii) ] = '1';
			} else {
				a[0][0] = res;
			}

			if(a[0][2][0] == '1') {
				a[0][2] = res;
				a[0][2][ (n+1)*(jj+1) + (ii) ] = '1';
			} else {
				a[0][2] = res;
			}

			if(a[2][0][0] == '1') {
				a[2][0] = res;
				a[2][0][ (n+1)*(jj) + (ii+1) ] = '1';
			} else {
				a[2][0] = res;
			}

			if(a[2][2][0] == '1') {
				a[2][2] = res;
				a[2][2][ (n+1)*(jj+1) + (ii+1) ] = '1';
			} else {
				a[2][2] = res;
			}

		} else if( (i % 2 == 1) && (j % 2 == 0) ) {

			if(a[0][0][0] == '1') {
				a[0][0] = res;
				a[0][0][ (n)*(jj) + (ii) ] = '1';
			} else {
				a[0][0] = res;
			}

			if(a[0][2][0] == '1') {
				a[0][2] = res;
				a[0][2][ (n)*(jj+1) + (ii) ] = '1';
			} else {
				a[0][2] = res;
			}

			if(a[2][0][0] == '1') {
				a[2][0] = res;
				a[2][0][ (n)*(jj) + (ii+1) ] = '1';
			} else {
				a[2][0] = res;
			}

			if(a[2][2][0] == '1') {
				a[2][2] = res;
				a[2][2][ (n)*(jj+1) + (ii+1) ] = '1';
			} else {
				a[2][2] = res;
			}

		} else if( (i % 2 == 0) && (j % 2 == 1) ) {

			if(a[0][0][0] == '1') {
				a[0][0] = res;
				a[0][0][ (n+1)*(jj) + (ii) ] = '1';
			} else {
				a[0][0] = res;
			}

			if(a[0][2][0] == '1') {
				a[0][2] = res;
				a[0][2][ (n+1)*(jj+1) + (ii) ] = '1';
			} else {
				a[0][2] = res;
			}

			if(a[2][0][0] == '1') {
				a[2][0] = res;
				a[2][0][ (n+1)*(jj) + (ii+1) ] = '1';
			} else {
				a[2][0] = res;
			}

			if(a[2][2][0] == '1') {
				a[2][2] = res;
				a[2][2][ (n+1)*(jj+1) + (ii+1) ] = '1';
			} else {
				a[2][2] = res;
			}

		} else if( (i % 2 == 1) && (j % 2 == 1) ) {

			if(a[0][0][0] == '1') {
				a[0][0] = res;
				a[0][0][ (n)*(jj) + (ii) ] = '1';
			} else {
				a[0][0] = res;
			}

			if(a[0][2][0] == '1') {
				a[0][2] = res;
				a[0][2][ (n)*(jj+1) + (ii) ] = '1';
			} else {
				a[0][2] = res;
			}

			if(a[2][0][0] == '1') {
				a[2][0] = res;
				a[2][0][ (n)*(jj) + (ii+1) ] = '1';
			} else {
				a[2][0] = res;
			}

			if(a[2][2][0] == '1') {
				a[2][2] = res;
				a[2][2][ (n)*(jj+1) + (ii+1) ] = '1';
			} else {
				a[2][2] = res;
			}

		}
	}


	f0(i, 100) {
		if (
			(a[0][0][i] == '1') ||
			(a[2][0][i] == '1') ||
			(a[0][2][i] == '1') ||
			(a[2][2][i] == '1')
			) {
			res[i] = '1';
		}
	}

	if(k == (n-1)) {



 

		bool grph[2*n+1][2*n+1] = {0};
		bool vis[2*n+1][2*n+1] = {0};
		f0(i, 2*n+1) {
			f0(j, 2*n+1) {
				grph[i][j] = 0;
				vis[i][j] = 0;
			}
		}
		int cnt = 0;



		f0(i, (n+1)*(n+1)) {
			int y = i/(n+1), x = i % (n+1);

			if(a[0][0][i] == '1') {
				grph[2*x][2*y] = 1;
			}
			if(a[0][2][i] == '1') {
				grph[2*x][2*y] = 1;
			}
			if(a[2][0][i] == '1') {
				grph[2*x][2*y] = 1;
			}
			if(a[2][2][i] == '1') {
				grph[2*x][2*y] = 1;
			}
		}

		f0(i, n*(n+1)) {
			int y = i/(n+1), x = i % (n+1);

			if(a[0][1][i] == '1') {
				grph[2*x][2*y+1] = 1;
			}
			if(a[2][1][i] == '1') {
				grph[2*x][2*y+1] = 1;
			}
		}

		f0(i, (n+1)*n) {
			int y = i/n, x = i % n;

			if(a[1][0][i] == '1') {
				grph[2*x+1][2*y] = 1;
			}
			if(a[1][2][i] == '1') {
				grph[2*x+1][2*y] = 1;
			}
		}

		f0(i, n*n) {
			int y = i/n, x = i % n;

			if(a[1][1][i] == '1') {
				grph[2*x+1][2*y+1] = 1;
			}
		}



		queue<pair<int, int>> q;

		f0(i, 2*n+1) {
			f0(j, 2*n+1) {
				// cout << grph[i][j] << " ";
				if(!grph[i][j]) continue;
				if(vis[i][j]) continue;
				vis[i][j] = 1;
				cnt++;
				q.push({i, j});
				while(!q.empty()) {
					auto cur = q.front();
					int x = cur.ff, y = cur.ss;
					// if(vis[x][y]) continue;
					q.pop();
					if(x+1 < 2*n+1) {
						if(grph[x+1][y] == 1) {
							if(!vis[x+1][y]) {
								vis[x+1][y] = 1;
								q.push({x+1, y});
							}
						}
					}
					if(y+1 < 2*n+1) {
						if(grph[x][y+1] == 1) {
							if(!vis[x][y+1]) {
								vis[x][y+1] = 1;
								q.push({x, y+1});
							}
						}
					}
					if(x > 0) {
						if(grph[x-1][y] == 1) {
							if(!vis[x-1][y]) {
								vis[x-1][y] = 1;
								q.push({x-1, y});
							}
						}
					}
					if(y > 0) {
						if(grph[x][y-1] == 1) {
							if(!vis[x][y-1]) {
								vis[x][y-1] = 1;
								q.push({x, y-1});
							}
						}
					}
				}
			}
			// cout << endl;
		}
		// cout << cnt << "\n";
		res = "";
		while(cnt > 0) {
			res += '0' + (cnt%2);
			cnt /= 2;
		}
		// res = string(res.rbegin(), res.rend());
		int nn = res.size();
		// string res0;

		f0(i, 100-nn) res += '0';

		// cout << res0+res << endl;

		return res;


	}

	return res;

	return std::string(100 ,'0');
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct
14 Correct 30 ms 2568 KB Output is correct
15 Correct 46 ms 2576 KB Output is correct
16 Correct 43 ms 2528 KB Output is correct
17 Correct 41 ms 2492 KB Output is correct
18 Correct 43 ms 2528 KB Output is correct
19 Correct 44 ms 2524 KB Output is correct
20 Correct 44 ms 2556 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct
14 Correct 30 ms 2568 KB Output is correct
15 Correct 46 ms 2576 KB Output is correct
16 Correct 43 ms 2528 KB Output is correct
17 Correct 41 ms 2492 KB Output is correct
18 Correct 43 ms 2528 KB Output is correct
19 Correct 44 ms 2524 KB Output is correct
20 Correct 44 ms 2556 KB Output is correct
21 Correct 72 ms 2588 KB Output is correct
22 Correct 95 ms 2740 KB Output is correct
23 Correct 99 ms 2692 KB Output is correct
24 Correct 91 ms 2768 KB Output is correct
25 Correct 103 ms 2708 KB Output is correct
26 Correct 95 ms 2628 KB Output is correct
27 Correct 100 ms 2816 KB Output is correct
28 Correct 102 ms 2636 KB Output is correct

Subtask #5
0.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct
14 Correct 30 ms 2568 KB Output is correct
15 Correct 46 ms 2576 KB Output is correct
16 Correct 43 ms 2528 KB Output is correct
17 Correct 41 ms 2492 KB Output is correct
18 Correct 43 ms 2528 KB Output is correct
19 Correct 44 ms 2524 KB Output is correct
20 Correct 44 ms 2556 KB Output is correct
21 Correct 72 ms 2588 KB Output is correct
22 Correct 95 ms 2740 KB Output is correct
23 Correct 99 ms 2692 KB Output is correct
24 Correct 91 ms 2768 KB Output is correct
25 Correct 103 ms 2708 KB Output is correct
26 Correct 95 ms 2628 KB Output is correct
27 Correct 100 ms 2816 KB Output is correct
28 Correct 102 ms 2636 KB Output is correct
29 Correct 139 ms 2784 KB Output is correct
30 Runtime error 2 ms 396 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #6
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct
14 Correct 30 ms 2568 KB Output is correct
15 Correct 46 ms 2576 KB Output is correct
16 Correct 43 ms 2528 KB Output is correct
17 Correct 41 ms 2492 KB Output is correct
18 Correct 43 ms 2528 KB Output is correct
19 Correct 44 ms 2524 KB Output is correct
20 Correct 44 ms 2556 KB Output is correct
21 Correct 72 ms 2588 KB Output is correct
22 Correct 95 ms 2740 KB Output is correct
23 Correct 99 ms 2692 KB Output is correct
24 Correct 91 ms 2768 KB Output is correct
25 Correct 103 ms 2708 KB Output is correct
26 Correct 95 ms 2628 KB Output is correct
27 Correct 100 ms 2816 KB Output is correct
28 Correct 102 ms 2636 KB Output is correct
29 Correct 139 ms 2784 KB Output is correct
30 Runtime error 2 ms 396 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct
14 Correct 30 ms 2568 KB Output is correct
15 Correct 46 ms 2576 KB Output is correct
16 Correct 43 ms 2528 KB Output is correct
17 Correct 41 ms 2492 KB Output is correct
18 Correct 43 ms 2528 KB Output is correct
19 Correct 44 ms 2524 KB Output is correct
20 Correct 44 ms 2556 KB Output is correct
21 Correct 72 ms 2588 KB Output is correct
22 Correct 95 ms 2740 KB Output is correct
23 Correct 99 ms 2692 KB Output is correct
24 Correct 91 ms 2768 KB Output is correct
25 Correct 103 ms 2708 KB Output is correct
26 Correct 95 ms 2628 KB Output is correct
27 Correct 100 ms 2816 KB Output is correct
28 Correct 102 ms 2636 KB Output is correct
29 Correct 139 ms 2784 KB Output is correct
30 Runtime error 2 ms 396 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #8
0.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct
14 Correct 30 ms 2568 KB Output is correct
15 Correct 46 ms 2576 KB Output is correct
16 Correct 43 ms 2528 KB Output is correct
17 Correct 41 ms 2492 KB Output is correct
18 Correct 43 ms 2528 KB Output is correct
19 Correct 44 ms 2524 KB Output is correct
20 Correct 44 ms 2556 KB Output is correct
21 Correct 72 ms 2588 KB Output is correct
22 Correct 95 ms 2740 KB Output is correct
23 Correct 99 ms 2692 KB Output is correct
24 Correct 91 ms 2768 KB Output is correct
25 Correct 103 ms 2708 KB Output is correct
26 Correct 95 ms 2628 KB Output is correct
27 Correct 100 ms 2816 KB Output is correct
28 Correct 102 ms 2636 KB Output is correct
29 Correct 139 ms 2784 KB Output is correct
30 Runtime error 2 ms 396 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #9
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct
14 Correct 30 ms 2568 KB Output is correct
15 Correct 46 ms 2576 KB Output is correct
16 Correct 43 ms 2528 KB Output is correct
17 Correct 41 ms 2492 KB Output is correct
18 Correct 43 ms 2528 KB Output is correct
19 Correct 44 ms 2524 KB Output is correct
20 Correct 44 ms 2556 KB Output is correct
21 Correct 72 ms 2588 KB Output is correct
22 Correct 95 ms 2740 KB Output is correct
23 Correct 99 ms 2692 KB Output is correct
24 Correct 91 ms 2768 KB Output is correct
25 Correct 103 ms 2708 KB Output is correct
26 Correct 95 ms 2628 KB Output is correct
27 Correct 100 ms 2816 KB Output is correct
28 Correct 102 ms 2636 KB Output is correct
29 Correct 139 ms 2784 KB Output is correct
30 Runtime error 2 ms 396 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #10
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2136 KB Output is correct
2 Correct 8 ms 1776 KB Output is correct
3 Correct 8 ms 1868 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 8 ms 1860 KB Output is correct
6 Correct 8 ms 1820 KB Output is correct
7 Correct 12 ms 1952 KB Output is correct
8 Correct 16 ms 1896 KB Output is correct
9 Correct 18 ms 1980 KB Output is correct
10 Correct 16 ms 1964 KB Output is correct
11 Correct 16 ms 2140 KB Output is correct
12 Correct 15 ms 2108 KB Output is correct
13 Correct 16 ms 1860 KB Output is correct
14 Correct 30 ms 2568 KB Output is correct
15 Correct 46 ms 2576 KB Output is correct
16 Correct 43 ms 2528 KB Output is correct
17 Correct 41 ms 2492 KB Output is correct
18 Correct 43 ms 2528 KB Output is correct
19 Correct 44 ms 2524 KB Output is correct
20 Correct 44 ms 2556 KB Output is correct
21 Correct 72 ms 2588 KB Output is correct
22 Correct 95 ms 2740 KB Output is correct
23 Correct 99 ms 2692 KB Output is correct
24 Correct 91 ms 2768 KB Output is correct
25 Correct 103 ms 2708 KB Output is correct
26 Correct 95 ms 2628 KB Output is correct
27 Correct 100 ms 2816 KB Output is correct
28 Correct 102 ms 2636 KB Output is correct
29 Correct 139 ms 2784 KB Output is correct
30 Runtime error 2 ms 396 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -