oj.uz

Submission #666516

# Submission time Handle Problem Language Result Execution time Memory
666516 2022-11-28T20:22:03 Z manizare Dango Maker (JOI18_dango_maker) C++17
13 / 100
 16 ms 24020 KB 
#include <bits/stdc++.h>
#define all(a) a.begin(),a.end() 
#define pb push_back
using namespace std ;
const int maxn = 1002 , maxq =1002 , inf = 1e9 + 100 , mod = 1e9 + 7 ;
char c[maxn][maxn] ;
vector <int> G[maxq] ;
vector <int> vec[maxn][maxn] ;
int ans[2] ;
bool mark[maxq] ;
void dfs(int v , int k){
	mark[v] = 1;
	ans[k]++;
	for(int i = 0 ; i < (int)G[v].size() ; i++){
		int u = G[v][i] ;
		if(mark[u] == 1)continue ;
		dfs(u , k^1);  
	}
}

signed main(){
	int n , m ;
	cin >> n >> m ;
	for(int i = 1; i <= n ; i++){
		for(int j = 1; j <= m ; j++){
			cin >> c[i][j] ;
		}
	}
	int cnt = 0 ;
	for(int i =1 ; i <= n ; i++){
		for(int j = 1; j <= m ; j++){
			if(i <= (n-2) && c[i][j] == 'R' && c[i+1][j] == 'G' && c[i+2][j] == 'W'){
				cnt++;
				vec[i][j].pb(cnt);
				vec[i+1][j].pb(cnt);
				vec[i+2][j].pb(cnt);
			}
			if(j <= (m-2) && c[i][j] == 'R' && c[i][j+1] == 'G' && c[i][j+2] == 'W'){
				cnt++;
				vec[i][j].pb(cnt);
				vec[i][j+1].pb(cnt);
				vec[i][j+2].pb(cnt);
			}
		}
	}
	for(int i =1 ; i<= n ; i++){
		for(int j = 1; j <= m ; j++){
			if(vec[i][j].size() == 2){
				int v = vec[i][j][0] , u = vec[i][j][1] ;
				G[v].pb(u);
				G[u].pb(v);
			}
		}
	}
	int ans1 = 0 ;
	for(int i = 1 ;i <=  cnt ; i++){
		if(mark[i] == 1)continue ;
		dfs(i , 0);
		ans1 += max(ans[1] , ans[0]);
		ans[0] = ans[1] =0 ;
	}
	cout << ans1 << "\n";
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 12 ms 23908 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 12 ms 24020 KB Output is correct
5 Correct 12 ms 23836 KB Output is correct
6 Correct 12 ms 23892 KB Output is correct
7 Correct 12 ms 23848 KB Output is correct
8 Correct 13 ms 23908 KB Output is correct
9 Correct 13 ms 23916 KB Output is correct
10 Correct 13 ms 23892 KB Output is correct
11 Correct 15 ms 23892 KB Output is correct
12 Correct 13 ms 23844 KB Output is correct
13 Correct 13 ms 23896 KB Output is correct
14 Correct 16 ms 24004 KB Output is correct
15 Correct 13 ms 23908 KB Output is correct
16 Correct 12 ms 23904 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 12 ms 23908 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 12 ms 24020 KB Output is correct
5 Correct 12 ms 23836 KB Output is correct
6 Correct 12 ms 23892 KB Output is correct
7 Correct 12 ms 23848 KB Output is correct
8 Correct 13 ms 23908 KB Output is correct
9 Correct 13 ms 23916 KB Output is correct
10 Correct 13 ms 23892 KB Output is correct
11 Correct 15 ms 23892 KB Output is correct
12 Correct 13 ms 23844 KB Output is correct
13 Correct 13 ms 23896 KB Output is correct
14 Correct 16 ms 24004 KB Output is correct
15 Correct 13 ms 23908 KB Output is correct
16 Correct 12 ms 23904 KB Output is correct
17 Correct 12 ms 23892 KB Output is correct
18 Correct 12 ms 23892 KB Output is correct
19 Correct 13 ms 23876 KB Output is correct
20 Correct 12 ms 23924 KB Output is correct
21 Correct 12 ms 23908 KB Output is correct
22 Correct 13 ms 23892 KB Output is correct
23 Correct 13 ms 23908 KB Output is correct
24 Correct 13 ms 23908 KB Output is correct
25 Correct 13 ms 23920 KB Output is correct
26 Correct 12 ms 23892 KB Output is correct
27 Correct 13 ms 23812 KB Output is correct
28 Correct 13 ms 23904 KB Output is correct
29 Correct 12 ms 23892 KB Output is correct
30 Correct 12 ms 23892 KB Output is correct
31 Correct 12 ms 23836 KB Output is correct
32 Correct 12 ms 23880 KB Output is correct
33 Correct 14 ms 23892 KB Output is correct
34 Incorrect 13 ms 23856 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 12 ms 23908 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 12 ms 24020 KB Output is correct
5 Correct 12 ms 23836 KB Output is correct
6 Correct 12 ms 23892 KB Output is correct
7 Correct 12 ms 23848 KB Output is correct
8 Correct 13 ms 23908 KB Output is correct
9 Correct 13 ms 23916 KB Output is correct
10 Correct 13 ms 23892 KB Output is correct
11 Correct 15 ms 23892 KB Output is correct
12 Correct 13 ms 23844 KB Output is correct
13 Correct 13 ms 23896 KB Output is correct
14 Correct 16 ms 24004 KB Output is correct
15 Correct 13 ms 23908 KB Output is correct
16 Correct 12 ms 23904 KB Output is correct
17 Correct 12 ms 23892 KB Output is correct
18 Correct 12 ms 23892 KB Output is correct
19 Correct 13 ms 23876 KB Output is correct
20 Correct 12 ms 23924 KB Output is correct
21 Correct 12 ms 23908 KB Output is correct
22 Correct 13 ms 23892 KB Output is correct
23 Correct 13 ms 23908 KB Output is correct
24 Correct 13 ms 23908 KB Output is correct
25 Correct 13 ms 23920 KB Output is correct
26 Correct 12 ms 23892 KB Output is correct
27 Correct 13 ms 23812 KB Output is correct
28 Correct 13 ms 23904 KB Output is correct
29 Correct 12 ms 23892 KB Output is correct
30 Correct 12 ms 23892 KB Output is correct
31 Correct 12 ms 23836 KB Output is correct
32 Correct 12 ms 23880 KB Output is correct
33 Correct 14 ms 23892 KB Output is correct
34 Incorrect 13 ms 23856 KB Output isn't correct
35 Halted 0 ms 0 KB -