oj.uz

답안 #103224

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103224 2019-03-29T08:54:11 Z Alisabzi Dango Maker (JOI18_dango_maker) C++14
100 / 100
 223 ms 19064 KB 
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
#define F first 
#define S second
const ll N = 3033 ;
int n, m, ans, dp[N][3];
string s[N] ;
int main()
{ 
	ios::sync_with_stdio(false);cin.tie();cout.tie();
	cin >> n >> m ;
	for(int i = 0 ; i < n ; i ++)
		cin >> s[i] ;
	for(int i = 0 ; i < n+m-2 ; i ++){
		int now = 0 ; 
		int a1 = min(n-1, i), a2 = i-a1 ;
		dp[a2][0] = 0 ;
		dp[a2][1] = (a2 > 0 and s[a1][a2-1] == 'R' and s[a1][a2] == 'G' and s[a1][a2+1] == 'W') ;
		dp[a2][2] = (a1 > 0 and s[a1-1][a2] == 'R' and s[a1][a2] == 'G' and s[a1+1][a2] == 'W') ;
		now = max(dp[a2][1], dp[a2][2]) ;
		for(int x = min(n-1, i)-1 ; x >= 0 ; x --){
			int y = i-x ; if(y < 0 or y >= m) break ;
			dp[y][0] = max(dp[y-1][0], max(dp[y-1][1], dp[y-1][2])) ;
			dp[y][1] = 0 ; 
			if(y > 0 and s[x][y-1] == 'R' and s[x][y] == 'G' and s[x][y+1] == 'W')
				dp[y][1] = max(dp[y-1][1], dp[y-1][0]) + 1 ;
			dp[y][2] = 0 ; 
			if(x > 0 and s[x-1][y] == 'R' and s[x][y] == 'G' and s[x+1][y] == 'W')
				dp[y][2] = max(dp[y-1][2], dp[y-1][0]) + 1 ;
			now = max(dp[y][0], max(dp[y][1], dp[y][2])) ;
		}
		ans += now ;
	}
	cout << ans ;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 484 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 3 ms 512 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 1 ms 512 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 2 ms 384 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 3 ms 512 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 2 ms 512 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 19 ms 2560 KB Output is correct
59 Correct 222 ms 12792 KB Output is correct
60 Correct 178 ms 12544 KB Output is correct
61 Correct 223 ms 12556 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 190 ms 12408 KB Output is correct
64 Correct 124 ms 12536 KB Output is correct
65 Correct 129 ms 12540 KB Output is correct
66 Correct 163 ms 19064 KB Output is correct
67 Correct 160 ms 12536 KB Output is correct
68 Correct 124 ms 12536 KB Output is correct
69 Correct 169 ms 12428 KB Output is correct
70 Correct 17 ms 2508 KB Output is correct
71 Correct 13 ms 2432 KB Output is correct
72 Correct 12 ms 2432 KB Output is correct
73 Correct 19 ms 2432 KB Output is correct
74 Correct 14 ms 2432 KB Output is correct
75 Correct 14 ms 2432 KB Output is correct
76 Correct 19 ms 2432 KB Output is correct
77 Correct 16 ms 2432 KB Output is correct
78 Correct 14 ms 2432 KB Output is correct
79 Correct 14 ms 2432 KB Output is correct
80 Correct 13 ms 2432 KB Output is correct
81 Correct 13 ms 2432 KB Output is correct
82 Correct 14 ms 2432 KB Output is correct
83 Correct 16 ms 2432 KB Output is correct
84 Correct 16 ms 2432 KB Output is correct
85 Correct 12 ms 2432 KB Output is correct
86 Correct 13 ms 2432 KB Output is correct
87 Correct 11 ms 2432 KB Output is correct
88 Correct 12 ms 2432 KB Output is correct
89 Correct 12 ms 2432 KB Output is correct
90 Correct 12 ms 2500 KB Output is correct