oj.uz

답안 #892919

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892919 2023-12-26T07:33:39 Z iskhakkutbilim Dango Maker (JOI18_dango_maker) C++17
100 / 100
 237 ms 58900 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(a) a.begin(), a.end()

const int N = 3e3;
char a[N+5][N+5];
int n, m;




signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	vector<int> dio[n + m + 2];
	
	for(int i = 1;i <= n; i++){
		for(int j = 1;j <= m; j++){
			cin >> a[i][j];
			dio[i + j].push_back(i);
		}
	}
	int ans = 0;
	for(int sum = 2;sum < n + m + 1; sum++){
		int sz = dio[sum].size();
		int dp[sz + 2][3];
		memset(dp, 0, sizeof(dp));
		int idx = 1;
		for(int i : dio[sum]){
			int j = sum - i;
			dp[idx][0] = max({dp[idx-1][0], dp[idx-1][1], dp[idx-1][2]});
			if(a[i][j] == 'G' && j - 1 > 0 && a[i][j-1] == 'R' && j + 1 <= m && a[i][j+1] == 'W'){
				dp[idx][1] = max({dp[idx-1][0], dp[idx-1][1]}) + 1;
			}
			if(a[i][j] == 'G' && i - 1 > 0 && a[i-1][j] == 'R' && i + 1 <= n && a[i + 1][j] == 'W'){
				dp[idx][2] = max({dp[idx-1][0], dp[idx-1][2]}) + 1;
			}
			idx++;
		}
		
		ans += max({dp[sz][0], dp[sz][1], dp[sz][2]});
	}
	cout << ans;
	
	
	return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 600 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 344 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 600 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 9308 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 2 ms 6748 KB Output is correct
58 Correct 25 ms 10148 KB Output is correct
59 Correct 230 ms 58656 KB Output is correct
60 Correct 237 ms 58712 KB Output is correct
61 Correct 231 ms 58696 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 224 ms 57460 KB Output is correct
64 Correct 204 ms 58704 KB Output is correct
65 Correct 202 ms 58848 KB Output is correct
66 Correct 198 ms 58708 KB Output is correct
67 Correct 197 ms 58652 KB Output is correct
68 Correct 187 ms 58708 KB Output is correct
69 Correct 199 ms 58900 KB Output is correct
70 Correct 20 ms 10076 KB Output is correct
71 Correct 21 ms 10056 KB Output is correct
72 Correct 21 ms 9932 KB Output is correct
73 Correct 21 ms 10152 KB Output is correct
74 Correct 21 ms 10076 KB Output is correct
75 Correct 21 ms 10152 KB Output is correct
76 Correct 21 ms 10076 KB Output is correct
77 Correct 21 ms 9912 KB Output is correct
78 Correct 21 ms 10076 KB Output is correct
79 Correct 21 ms 9944 KB Output is correct
80 Correct 21 ms 9900 KB Output is correct
81 Correct 21 ms 10076 KB Output is correct
82 Correct 21 ms 10076 KB Output is correct
83 Correct 21 ms 10076 KB Output is correct
84 Correct 21 ms 10072 KB Output is correct
85 Correct 21 ms 10152 KB Output is correct
86 Correct 23 ms 10076 KB Output is correct
87 Correct 21 ms 10076 KB Output is correct
88 Correct 21 ms 10076 KB Output is correct
89 Correct 21 ms 10072 KB Output is correct
90 Correct 21 ms 10072 KB Output is correct