oj.uz

답안 #509179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
509179 2022-01-14T03:33:02 Z cig32 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 727 ms 88416 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> active;

int32_t main() {
    int n, m;
    cin >> n >> m;
    char a[n+1][m+1];
    for(int i=1; i<=n; i++) {
        for(int j=1; j<=m; j++) {
            cin >> a[i][j];
        }
    }
    int dp[n+1][m+1][2];
    for(int i=0; i<=n; i++) {
        for(int j=0; j<=m; j++) {
            dp[i][j][0] = dp[i][j][1] = 0;
        }
    }
    int ans = 0;
    for(int i=2; i<=n+m; i++) {
        int r, c;
        if(i <= m + 1) r = 1, c = i - 1;
        else c = m, r = i - m;
        int cm = i;
        dp[r][c][0] = (c>1 && c<m && a[r][c-1] == 'R' && a[r][c] == 'G' && a[r][c+1] == 'W');
        dp[r][c][1] = (r>1 && r<n && a[r-1][c] == 'R' && a[r][c] == 'G' && a[r+1][c] == 'W');
        int mx = max(dp[r][c][0], dp[r][c][1]);
        while(r+1 <= n && c-1 >= 1) {
            r++, c--;
            dp[r][c][0] = max(
                dp[r-1][c+1][0] + (c>1 && c<m && a[r][c-1] == 'R' && a[r][c] == 'G' && a[r][c+1] == 'W'),
                dp[r-1][c+1][1]
            );
            dp[r][c][1] = max(
                dp[r-1][c+1][0],
                dp[r-1][c+1][1] + (r>1 && r<n && a[r-1][c] == 'R' && a[r][c] == 'G' && a[r+1][c] == 'W')
            );
            mx = max(mx, dp[r][c][0]);
            mx = max(mx, dp[r][c][1]);
        }
        ans += mx;
    }
    
    cout << ans << "\n";
    
}

Compilation message

dango_maker.cpp: In function 'int32_t main()':
dango_maker.cpp:26:13: warning: unused variable 'cm' [-Wunused-variable]
   26 |         int cm = i;
      |             ^~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 248 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 292 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 292 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 292 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 292 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 0 ms 288 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 296 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 2 ms 460 KB Output is correct
57 Correct 2 ms 452 KB Output is correct
58 Correct 84 ms 10060 KB Output is correct
59 Correct 727 ms 83296 KB Output is correct
60 Correct 655 ms 83376 KB Output is correct
61 Correct 665 ms 83372 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 640 ms 80712 KB Output is correct
64 Correct 639 ms 88292 KB Output is correct
65 Correct 647 ms 88368 KB Output is correct
66 Correct 648 ms 88368 KB Output is correct
67 Correct 644 ms 88296 KB Output is correct
68 Correct 685 ms 88416 KB Output is correct
69 Correct 666 ms 88368 KB Output is correct
70 Correct 72 ms 10060 KB Output is correct
71 Correct 74 ms 10052 KB Output is correct
72 Correct 62 ms 10060 KB Output is correct
73 Correct 66 ms 10076 KB Output is correct
74 Correct 64 ms 10056 KB Output is correct
75 Correct 77 ms 10024 KB Output is correct
76 Correct 63 ms 10052 KB Output is correct
77 Correct 63 ms 10068 KB Output is correct
78 Correct 64 ms 10060 KB Output is correct
79 Correct 67 ms 10060 KB Output is correct
80 Correct 64 ms 10056 KB Output is correct
81 Correct 68 ms 10060 KB Output is correct
82 Correct 75 ms 10072 KB Output is correct
83 Correct 66 ms 10056 KB Output is correct
84 Correct 63 ms 9944 KB Output is correct
85 Correct 66 ms 10152 KB Output is correct
86 Correct 75 ms 10052 KB Output is correct
87 Correct 68 ms 10060 KB Output is correct
88 Correct 63 ms 10024 KB Output is correct
89 Correct 64 ms 10036 KB Output is correct
90 Correct 69 ms 10068 KB Output is correct