Submission #814570

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
814570	2023-08-08T08:22:41 Z	SteGG	Dango Maker (JOI18_dango_maker)	C++	13 / 100	245 ms	235468 KB

dango_maker

#include <bits/stdc++.h>
#define int long long
#define VERTICAL 1
#define HORIZONTAL 2
#define NOT_DONE 1
#define DONE 2

using namespace std;

void open(){
	if(fopen("input.inp", "r")){
		freopen("input.inp", "r", stdin);
		//freopen("output.out", "w", stdout);
	}
}

const int maxn = 1e7;
int n, m;
char board[3001][3001];
vector<int> G[maxn];
int vertical_change[3001][3001], horizontal_change[3001][3001];
pair<int, int> vertical_parent[3001][3001], horizontal_parent[3001][3001];
bool vertical_check[3001][3001], horizontal_check[3001][3001];
int cnt;
int vertical_state[3001][3001], horizontal_state[3001][3001];
bool check[maxn];

int bfs(int root){
	queue<pair<int, bool>> q;
	q.push({root, true});
	int total = 0;
	int cur = 0;
	while(!q.empty()){
		pair<int, int> first = q.front();
		q.pop();
		int u = first.first;
		if(check[u]) continue;
		check[u] = true;
		total++;
		cur += first.second;
		for(int v : G[u]){
			q.push({v, first.second ^ 1});
		}
	}

	return max(cur, total - cur);
}

void build(int x, int y, int direction){
	if(direction == VERTICAL){
		if(vertical_state[x][y]) return;
		vertical_state[x][y] = NOT_DONE;
		int cur_index = vertical_change[x][y];
		int new_index;
		if(x + 2 > n || board[x + 1][y] != 'G' || board[x + 2][y] != 'W') return;
		// To R:
		if(horizontal_check[x][y]){
			pair<int, int> temp = make_pair(x, y);
			new_index = horizontal_change[x][y];
			if(horizontal_state[temp.first][temp.second] != NOT_DONE){
				G[cur_index].push_back(new_index);
				G[new_index].push_back(cur_index);
				build(temp.first, temp.second, HORIZONTAL);
			}
		}
		// To G:
		if(horizontal_parent[x + 1][y] != make_pair(0ll, 0ll)){
			pair<int, int> temp = horizontal_parent[x + 1][y];
			new_index = horizontal_change[temp.first][temp.second];
			if(horizontal_state[temp.first][temp.second] != NOT_DONE){
				G[cur_index].push_back(new_index);
				G[new_index].push_back(cur_index);
				build(temp.first, temp.second, HORIZONTAL);
			}
		}

		// To W:
		if(horizontal_parent[x + 2][y] != make_pair(0ll, 0ll)){
			pair<int, int> temp = horizontal_parent[x + 2][y];
			new_index = horizontal_change[temp.first][temp.second];
			if(horizontal_state[temp.first][temp.second] != NOT_DONE){
				G[cur_index].push_back(new_index);
				G[new_index].push_back(cur_index);
				build(temp.first, temp.second, HORIZONTAL);
			}
		}
		vertical_state[x][y] = DONE;
	}else{
		horizontal_state[x][y] = NOT_DONE;
		int cur_index = horizontal_change[x][y];
		int new_index;
		if(y + 2 > m || board[x][y + 1] != 'G' || board[x][y + 2] != 'W') return;
		// To R:
		if(vertical_check[x][y]){
			pair<int, int> temp = make_pair(x, y);
			new_index = vertical_change[x][y];
			if(vertical_state[temp.first][temp.second] != NOT_DONE){
				G[cur_index].push_back(new_index);
				G[new_index].push_back(cur_index);
				build(temp.first, temp.second, VERTICAL);
			}
		}
		// To G:
		if(vertical_parent[x][y + 1] != make_pair(0ll, 0ll)){
			pair<int, int> temp = vertical_parent[x][y + 1];
			new_index = vertical_change[temp.first][temp.second];
			if(vertical_state[temp.first][temp.second] != NOT_DONE){
				G[cur_index].push_back(new_index);
				G[new_index].push_back(cur_index);
				build(temp.first, temp.second, VERTICAL);
			}
		}

		// To W:
		if(vertical_parent[x][y + 1] != make_pair(0ll, 0ll)){
			pair<int, int> temp = vertical_parent[x][y + 1];
			new_index = vertical_change[temp.first][temp.second];
			if(vertical_state[temp.first][temp.second] != NOT_DONE){
				G[cur_index].push_back(new_index);
				G[new_index].push_back(cur_index);
				build(temp.first, temp.second, VERTICAL);
			}
		}
		horizontal_state[x][y] = DONE;
	}
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	open();
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin >> board[i][j];
		}
	}

	cnt = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(board[i][j] == 'R'){
				// horizontal:
				if(j + 2 <= m && board[i][j + 1] == 'G' && board[i][j + 2] == 'W'){
					horizontal_parent[i][j] = make_pair(i, j);
					horizontal_change[i][j] = ++cnt;
					horizontal_parent[i][j + 1] = horizontal_parent[i][j + 2] = horizontal_parent[i][j];
					horizontal_check[i][j] = true;
				}
				// vertical:
				if(i + 2 <= n && board[i + 1][j] == 'G' && board[i + 2][j] == 'W'){
					vertical_parent[i][j] = make_pair(i, j);
					vertical_change[i][j] = ++cnt;
					vertical_parent[i + 1][j] = vertical_parent[i + 2][j] = vertical_parent[i][j];
					vertical_check[i][j] = true;
				}
			}
		}
	}

	if(cnt == 0){
		cout << 0 << endl;
		return 0;
	}

	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(board[i][j] == 'R'){
				if(vertical_check[i][j]){
					build(i, j, VERTICAL);
				}else{
					build(i, j, HORIZONTAL);
				}
			}
		}
	}

	int result = 0;
	for(int i = 1; i <= cnt; i++){
		if(!check[i]){
			result += bfs(i);
		}
	}

	cout << result << endl;

	return 0;
}

Compilation message

dango_maker.cpp: In function 'void open()':
dango_maker.cpp:12:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |   freopen("input.inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	109 ms	235084 KB	Output is correct
2	Correct	114 ms	235108 KB	Output is correct
3	Correct	98 ms	235044 KB	Output is correct
4	Correct	108 ms	235248 KB	Output is correct
5	Correct	104 ms	235148 KB	Output is correct
6	Correct	104 ms	235200 KB	Output is correct
7	Correct	105 ms	235328 KB	Output is correct
8	Correct	107 ms	235136 KB	Output is correct
9	Correct	119 ms	235104 KB	Output is correct
10	Correct	111 ms	235084 KB	Output is correct
11	Correct	106 ms	235184 KB	Output is correct
12	Correct	109 ms	235168 KB	Output is correct
13	Correct	129 ms	235192 KB	Output is correct
14	Correct	109 ms	235116 KB	Output is correct
15	Correct	98 ms	235124 KB	Output is correct
16	Correct	109 ms	235132 KB	Output is correct

Subtask #2

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	109 ms	235084 KB	Output is correct
2	Correct	114 ms	235108 KB	Output is correct
3	Correct	98 ms	235044 KB	Output is correct
4	Correct	108 ms	235248 KB	Output is correct
5	Correct	104 ms	235148 KB	Output is correct
6	Correct	104 ms	235200 KB	Output is correct
7	Correct	105 ms	235328 KB	Output is correct
8	Correct	107 ms	235136 KB	Output is correct
9	Correct	119 ms	235104 KB	Output is correct
10	Correct	111 ms	235084 KB	Output is correct
11	Correct	106 ms	235184 KB	Output is correct
12	Correct	109 ms	235168 KB	Output is correct
13	Correct	129 ms	235192 KB	Output is correct
14	Correct	109 ms	235116 KB	Output is correct
15	Correct	98 ms	235124 KB	Output is correct
16	Correct	109 ms	235132 KB	Output is correct
17	Correct	98 ms	235152 KB	Output is correct
18	Correct	110 ms	235348 KB	Output is correct
19	Correct	102 ms	235328 KB	Output is correct
20	Correct	97 ms	235328 KB	Output is correct
21	Correct	95 ms	235336 KB	Output is correct
22	Correct	101 ms	235348 KB	Output is correct
23	Correct	98 ms	235272 KB	Output is correct
24	Correct	103 ms	235248 KB	Output is correct
25	Correct	123 ms	235088 KB	Output is correct
26	Correct	106 ms	235140 KB	Output is correct
27	Correct	98 ms	235404 KB	Output is correct
28	Correct	116 ms	235468 KB	Output is correct
29	Correct	245 ms	235448 KB	Output is correct
30	Correct	104 ms	235272 KB	Output is correct
31	Correct	108 ms	235228 KB	Output is correct
32	Correct	108 ms	235192 KB	Output is correct
33	Correct	109 ms	235452 KB	Output is correct
34	Incorrect	99 ms	235404 KB	Output isn't correct
35	Halted	0 ms	0 KB	-

Subtask #3

0 / 67.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	109 ms	235084 KB	Output is correct
2	Correct	114 ms	235108 KB	Output is correct
3	Correct	98 ms	235044 KB	Output is correct
4	Correct	108 ms	235248 KB	Output is correct
5	Correct	104 ms	235148 KB	Output is correct
6	Correct	104 ms	235200 KB	Output is correct
7	Correct	105 ms	235328 KB	Output is correct
8	Correct	107 ms	235136 KB	Output is correct
9	Correct	119 ms	235104 KB	Output is correct
10	Correct	111 ms	235084 KB	Output is correct
11	Correct	106 ms	235184 KB	Output is correct
12	Correct	109 ms	235168 KB	Output is correct
13	Correct	129 ms	235192 KB	Output is correct
14	Correct	109 ms	235116 KB	Output is correct
15	Correct	98 ms	235124 KB	Output is correct
16	Correct	109 ms	235132 KB	Output is correct
17	Correct	98 ms	235152 KB	Output is correct
18	Correct	110 ms	235348 KB	Output is correct
19	Correct	102 ms	235328 KB	Output is correct
20	Correct	97 ms	235328 KB	Output is correct
21	Correct	95 ms	235336 KB	Output is correct
22	Correct	101 ms	235348 KB	Output is correct
23	Correct	98 ms	235272 KB	Output is correct
24	Correct	103 ms	235248 KB	Output is correct
25	Correct	123 ms	235088 KB	Output is correct
26	Correct	106 ms	235140 KB	Output is correct
27	Correct	98 ms	235404 KB	Output is correct
28	Correct	116 ms	235468 KB	Output is correct
29	Correct	245 ms	235448 KB	Output is correct
30	Correct	104 ms	235272 KB	Output is correct
31	Correct	108 ms	235228 KB	Output is correct
32	Correct	108 ms	235192 KB	Output is correct
33	Correct	109 ms	235452 KB	Output is correct
34	Incorrect	99 ms	235404 KB	Output isn't correct
35	Halted	0 ms	0 KB	-