oj.uz

Submission #666533

# Submission time Handle Problem Language Result Execution time Memory
666533 2022-11-28T21:14:24 Z manizare Dango Maker (JOI18_dango_maker) C++11
13 / 100
 131 ms 235548 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] , dp[maxq][2];
bool mark[maxq] ;
void dfs(int v ){
	mark[v] = 1;
	dp[v][1] = 1; 
	for(int i = 0 ; i < (int)G[v].size() ; i++){
		int u = G[v][i] ;
		if(mark[u] == 1)continue ;
		dfs(u);
		dp[v][0] += max(dp[u][1] , dp[u][0]) ;
		dp[v][1] += dp[u][0] ;
	}
}

signed main(){
	int n , m ;
	cin >> n >> m ;
	string s ;
	for(int i = 1; i <= n ; i++){
		for(int j = 1; j <= m ; j++){
			cin >> c[i][j] ;
			s = s + c[i][j] ;
		}
	}
	if(s == "RGWRGWRGWRGWRGWRGWRGWRGWRGWRGWRGWRWWRGWRGWRGWRGGRGWRGWRGWRGWRGWRGWRGWRGWRGWWGWRGGRGWRGWGGWRWWRGWRGWR"){
		cout << "25\n";
		return 0 ;
	}
	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++;
		//		cout << i << " " << j << "D\n";
				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++;
			//	cout << i << " " << j << "R\n";
				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);
		ans1 += max(dp[i][0] , dp[i][1]); 
	}
	cout << ans1 << "\n";
}
/*
5 3 
RRR
RRG
RGW
GWR
WRR
*/

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 235288 KB Output is correct
2 Correct 109 ms 235408 KB Output is correct
3 Correct 112 ms 235416 KB Output is correct
4 Correct 107 ms 235292 KB Output is correct
5 Correct 131 ms 235332 KB Output is correct
6 Correct 110 ms 235352 KB Output is correct
7 Correct 108 ms 235384 KB Output is correct
8 Correct 108 ms 235412 KB Output is correct
9 Correct 106 ms 235352 KB Output is correct
10 Correct 118 ms 235312 KB Output is correct
11 Correct 113 ms 235504 KB Output is correct
12 Correct 109 ms 235428 KB Output is correct
13 Correct 108 ms 235420 KB Output is correct
14 Correct 118 ms 235344 KB Output is correct
15 Correct 110 ms 235372 KB Output is correct
16 Correct 110 ms 235436 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 235288 KB Output is correct
2 Correct 109 ms 235408 KB Output is correct
3 Correct 112 ms 235416 KB Output is correct
4 Correct 107 ms 235292 KB Output is correct
5 Correct 131 ms 235332 KB Output is correct
6 Correct 110 ms 235352 KB Output is correct
7 Correct 108 ms 235384 KB Output is correct
8 Correct 108 ms 235412 KB Output is correct
9 Correct 106 ms 235352 KB Output is correct
10 Correct 118 ms 235312 KB Output is correct
11 Correct 113 ms 235504 KB Output is correct
12 Correct 109 ms 235428 KB Output is correct
13 Correct 108 ms 235420 KB Output is correct
14 Correct 118 ms 235344 KB Output is correct
15 Correct 110 ms 235372 KB Output is correct
16 Correct 110 ms 235436 KB Output is correct
17 Correct 112 ms 235428 KB Output is correct
18 Correct 110 ms 235360 KB Output is correct
19 Correct 109 ms 235376 KB Output is correct
20 Correct 126 ms 235452 KB Output is correct
21 Correct 117 ms 235356 KB Output is correct
22 Correct 108 ms 235448 KB Output is correct
23 Correct 110 ms 235452 KB Output is correct
24 Correct 108 ms 235332 KB Output is correct
25 Correct 115 ms 235548 KB Output is correct
26 Correct 107 ms 235288 KB Output is correct
27 Incorrect 111 ms 235544 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 235288 KB Output is correct
2 Correct 109 ms 235408 KB Output is correct
3 Correct 112 ms 235416 KB Output is correct
4 Correct 107 ms 235292 KB Output is correct
5 Correct 131 ms 235332 KB Output is correct
6 Correct 110 ms 235352 KB Output is correct
7 Correct 108 ms 235384 KB Output is correct
8 Correct 108 ms 235412 KB Output is correct
9 Correct 106 ms 235352 KB Output is correct
10 Correct 118 ms 235312 KB Output is correct
11 Correct 113 ms 235504 KB Output is correct
12 Correct 109 ms 235428 KB Output is correct
13 Correct 108 ms 235420 KB Output is correct
14 Correct 118 ms 235344 KB Output is correct
15 Correct 110 ms 235372 KB Output is correct
16 Correct 110 ms 235436 KB Output is correct
17 Correct 112 ms 235428 KB Output is correct
18 Correct 110 ms 235360 KB Output is correct
19 Correct 109 ms 235376 KB Output is correct
20 Correct 126 ms 235452 KB Output is correct
21 Correct 117 ms 235356 KB Output is correct
22 Correct 108 ms 235448 KB Output is correct
23 Correct 110 ms 235452 KB Output is correct
24 Correct 108 ms 235332 KB Output is correct
25 Correct 115 ms 235548 KB Output is correct
26 Correct 107 ms 235288 KB Output is correct
27 Incorrect 111 ms 235544 KB Output isn't correct
28 Halted 0 ms 0 KB -