oj.uz

답안 #666519

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
666519 2022-11-28T20:23:58 Z manizare Dango Maker (JOI18_dango_maker) C++14
13 / 100
 124 ms 235520 KB 
#include <bits/stdc++.h>
#define all(a) a.begin(),a.end() 
#define pb push_back
using namespace std ;
const int maxn = 3002 , maxq =1e6 , 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

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 235416 KB Output is correct
2 Correct 107 ms 235380 KB Output is correct
3 Correct 111 ms 235356 KB Output is correct
4 Correct 104 ms 235408 KB Output is correct
5 Correct 105 ms 235320 KB Output is correct
6 Correct 105 ms 235424 KB Output is correct
7 Correct 104 ms 235412 KB Output is correct
8 Correct 106 ms 235352 KB Output is correct
9 Correct 111 ms 235388 KB Output is correct
10 Correct 107 ms 235352 KB Output is correct
11 Correct 108 ms 235412 KB Output is correct
12 Correct 104 ms 235408 KB Output is correct
13 Correct 110 ms 235404 KB Output is correct
14 Correct 107 ms 235344 KB Output is correct
15 Correct 107 ms 235384 KB Output is correct
16 Correct 105 ms 235340 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 235416 KB Output is correct
2 Correct 107 ms 235380 KB Output is correct
3 Correct 111 ms 235356 KB Output is correct
4 Correct 104 ms 235408 KB Output is correct
5 Correct 105 ms 235320 KB Output is correct
6 Correct 105 ms 235424 KB Output is correct
7 Correct 104 ms 235412 KB Output is correct
8 Correct 106 ms 235352 KB Output is correct
9 Correct 111 ms 235388 KB Output is correct
10 Correct 107 ms 235352 KB Output is correct
11 Correct 108 ms 235412 KB Output is correct
12 Correct 104 ms 235408 KB Output is correct
13 Correct 110 ms 235404 KB Output is correct
14 Correct 107 ms 235344 KB Output is correct
15 Correct 107 ms 235384 KB Output is correct
16 Correct 105 ms 235340 KB Output is correct
17 Correct 107 ms 235520 KB Output is correct
18 Correct 107 ms 235332 KB Output is correct
19 Correct 104 ms 235316 KB Output is correct
20 Correct 113 ms 235440 KB Output is correct
21 Correct 107 ms 235344 KB Output is correct
22 Correct 105 ms 235440 KB Output is correct
23 Correct 113 ms 235344 KB Output is correct
24 Correct 107 ms 235436 KB Output is correct
25 Correct 111 ms 235408 KB Output is correct
26 Correct 117 ms 235324 KB Output is correct
27 Correct 105 ms 235432 KB Output is correct
28 Correct 106 ms 235448 KB Output is correct
29 Correct 122 ms 235436 KB Output is correct
30 Correct 124 ms 235324 KB Output is correct
31 Correct 105 ms 235340 KB Output is correct
32 Correct 105 ms 235436 KB Output is correct
33 Correct 109 ms 235444 KB Output is correct
34 Incorrect 110 ms 235440 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 235416 KB Output is correct
2 Correct 107 ms 235380 KB Output is correct
3 Correct 111 ms 235356 KB Output is correct
4 Correct 104 ms 235408 KB Output is correct
5 Correct 105 ms 235320 KB Output is correct
6 Correct 105 ms 235424 KB Output is correct
7 Correct 104 ms 235412 KB Output is correct
8 Correct 106 ms 235352 KB Output is correct
9 Correct 111 ms 235388 KB Output is correct
10 Correct 107 ms 235352 KB Output is correct
11 Correct 108 ms 235412 KB Output is correct
12 Correct 104 ms 235408 KB Output is correct
13 Correct 110 ms 235404 KB Output is correct
14 Correct 107 ms 235344 KB Output is correct
15 Correct 107 ms 235384 KB Output is correct
16 Correct 105 ms 235340 KB Output is correct
17 Correct 107 ms 235520 KB Output is correct
18 Correct 107 ms 235332 KB Output is correct
19 Correct 104 ms 235316 KB Output is correct
20 Correct 113 ms 235440 KB Output is correct
21 Correct 107 ms 235344 KB Output is correct
22 Correct 105 ms 235440 KB Output is correct
23 Correct 113 ms 235344 KB Output is correct
24 Correct 107 ms 235436 KB Output is correct
25 Correct 111 ms 235408 KB Output is correct
26 Correct 117 ms 235324 KB Output is correct
27 Correct 105 ms 235432 KB Output is correct
28 Correct 106 ms 235448 KB Output is correct
29 Correct 122 ms 235436 KB Output is correct
30 Correct 124 ms 235324 KB Output is correct
31 Correct 105 ms 235340 KB Output is correct
32 Correct 105 ms 235436 KB Output is correct
33 Correct 109 ms 235444 KB Output is correct
34 Incorrect 110 ms 235440 KB Output isn't correct
35 Halted 0 ms 0 KB -