oj.uz

답안 #887990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887990 2023-12-15T16:39:26 Z hafo Dango Maker (JOI18_dango_maker) C++14
100 / 100
 197 ms 18168 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;
 
template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}
 
const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 3e3 + 7;
const ll oo = 1e18 + 69;
 
int n, m, dp[maxn][3];
char a[maxn][maxn];
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);
 
    cin>>n>>m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) cin>>a[i][j];
    }    
        
    int ans = 0;
    for(int d = 0; d <= n + m; d++) {
        for(int i = 0; i <= n; i++) {
            for(int t = 0; t < 3; t++) dp[i][t] = 0;
        }
 
        for(int i = 1; i <= n; i++) {
            int j = d - i;
            maxi(dp[i][1], dp[i - 1][1]);
            maxi(dp[i][2], dp[i - 1][2]);
            maxi(dp[i][1], dp[i - 1][2]);
            if(j > m || j < 1) continue;
            if(j - 2 >= 1 && a[i][j] == 'W' && a[i][j - 1] == 'G' && a[i][j - 2] == 'R') dp[i][1]++; 
            if(i - 3 >= 0 && a[i][j] == 'W' && a[i - 1][j] == 'G' && a[i - 2][j] == 'R') {
                maxi(dp[i][2], max(dp[i - 3][1], dp[i - 3][2]) + 1);
                maxi(dp[i][2], dp[i - 1][2] + 1);
                maxi(dp[i][2], dp[i - 2][2] + 1);
            }
 
        }   
 
        ans += max(dp[n][1], dp[n][2]);
    }
    cout<<ans;
    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 1 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 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 1 ms 344 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 1 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 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 0 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 460 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 344 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 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 464 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 756 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 1 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 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 0 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 460 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 344 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 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 464 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 756 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 27 ms 9312 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 14 ms 6848 KB Output is correct
58 Correct 23 ms 5724 KB Output is correct
59 Correct 191 ms 18120 KB Output is correct
60 Correct 195 ms 18004 KB Output is correct
61 Correct 197 ms 18004 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 191 ms 17828 KB Output is correct
64 Correct 137 ms 17912 KB Output is correct
65 Correct 139 ms 18040 KB Output is correct
66 Correct 141 ms 18000 KB Output is correct
67 Correct 141 ms 18168 KB Output is correct
68 Correct 149 ms 18004 KB Output is correct
69 Correct 147 ms 17912 KB Output is correct
70 Correct 16 ms 5724 KB Output is correct
71 Correct 16 ms 5720 KB Output is correct
72 Correct 16 ms 5720 KB Output is correct
73 Correct 17 ms 5724 KB Output is correct
74 Correct 16 ms 5720 KB Output is correct
75 Correct 16 ms 5724 KB Output is correct
76 Correct 16 ms 5728 KB Output is correct
77 Correct 16 ms 5724 KB Output is correct
78 Correct 16 ms 5724 KB Output is correct
79 Correct 16 ms 5724 KB Output is correct
80 Correct 20 ms 5624 KB Output is correct
81 Correct 17 ms 5720 KB Output is correct
82 Correct 16 ms 5504 KB Output is correct
83 Correct 16 ms 5976 KB Output is correct
84 Correct 16 ms 5724 KB Output is correct
85 Correct 17 ms 5624 KB Output is correct
86 Correct 16 ms 5748 KB Output is correct
87 Correct 16 ms 5724 KB Output is correct
88 Correct 16 ms 5724 KB Output is correct
89 Correct 16 ms 5504 KB Output is correct
90 Correct 17 ms 5724 KB Output is correct