oj.uz

Submission #1109048

# Submission time Handle Problem Language Result Execution time Memory
1109048 2024-11-05T21:36:26 Z codexistent Dango Maker (JOI18_dango_maker) C++14
100 / 100
 419 ms 256248 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXNM 3005
#define FOR(i, a, b) for(ll i = a; i <= b; i++)
    
char g[MAXNM][MAXNM];
int n, m, ok[MAXNM][MAXNM][2], dp[MAXNM * 2][3];
vector<array<ll, 2>> e[MAXNM * 2];

int main(){
    cin >> n >> m;
    FOR(i, 1, n){
        string s; cin >> s;
        FOR(j, 1, m) g[i][j] = s[j - 1];
    } 

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(g[i][j] == 'G' && g[i][j - 1] == 'R' && g[i][j + 1] == 'W') {
                ok[i][j][0] = 1;
            }
            if(g[i][j] == 'G' && g[i - 1][j] == 'R' && g[i + 1][j] == 'W') {
                ok[i][j][1] = 1;
            }
            e[i + j].push_back({i, j});
        }
    }
    int r = 0;
    for(int i = 1; i <= n + m; i++) {
        int f = (int)e[i].size() - 1;
        if(e[i].empty()) continue;
        dp[0][0] = ok[e[i][0][0]][e[i][0][1]][0];
        dp[0][1] = ok[e[i][0][0]][e[i][0][1]][1];
        dp[0][2] = 0;
        for(int j = 1; j < (int)e[i].size(); j++)  {
            int x = e[i][j][0], y = e[i][j][1];
            dp[j][2] = max({dp[j - 1][0], dp[j - 1][1], dp[j - 1][2]});
            dp[j][0] = max(dp[j - 1][0], dp[j - 1][2]) + ok[x][y][0];
            dp[j][1] = max(dp[j - 1][1], dp[j - 1][2]) + ok[x][y][1];
        }   
 
        // cout << dp[f][1] << '\n';
        r += max({dp[f][0], dp[f][1], dp[f][2]});
    }

    cout << r << endl;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 4688 KB Output is correct
7 Correct 1 ms 4688 KB Output is correct
8 Correct 1 ms 4688 KB Output is correct
9 Correct 1 ms 4688 KB Output is correct
10 Correct 1 ms 4688 KB Output is correct
11 Correct 1 ms 4688 KB Output is correct
12 Correct 1 ms 4688 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4856 KB Output is correct
15 Correct 1 ms 4688 KB Output is correct
16 Correct 1 ms 4688 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 4688 KB Output is correct
7 Correct 1 ms 4688 KB Output is correct
8 Correct 1 ms 4688 KB Output is correct
9 Correct 1 ms 4688 KB Output is correct
10 Correct 1 ms 4688 KB Output is correct
11 Correct 1 ms 4688 KB Output is correct
12 Correct 1 ms 4688 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4856 KB Output is correct
15 Correct 1 ms 4688 KB Output is correct
16 Correct 1 ms 4688 KB Output is correct
17 Correct 1 ms 4688 KB Output is correct
18 Correct 1 ms 4688 KB Output is correct
19 Correct 1 ms 4688 KB Output is correct
20 Correct 1 ms 4688 KB Output is correct
21 Correct 1 ms 4684 KB Output is correct
22 Correct 1 ms 4688 KB Output is correct
23 Correct 1 ms 4688 KB Output is correct
24 Correct 2 ms 4688 KB Output is correct
25 Correct 1 ms 2640 KB Output is correct
26 Correct 1 ms 2640 KB Output is correct
27 Correct 1 ms 4688 KB Output is correct
28 Correct 1 ms 4688 KB Output is correct
29 Correct 1 ms 4688 KB Output is correct
30 Correct 1 ms 4688 KB Output is correct
31 Correct 2 ms 4688 KB Output is correct
32 Correct 1 ms 4688 KB Output is correct
33 Correct 1 ms 4688 KB Output is correct
34 Correct 1 ms 4688 KB Output is correct
35 Correct 1 ms 4688 KB Output is correct
36 Correct 1 ms 4876 KB Output is correct
37 Correct 1 ms 4688 KB Output is correct
38 Correct 2 ms 4688 KB Output is correct
39 Correct 1 ms 4688 KB Output is correct
40 Correct 1 ms 4688 KB Output is correct
41 Correct 1 ms 4688 KB Output is correct
42 Correct 1 ms 4688 KB Output is correct
43 Correct 2 ms 4688 KB Output is correct
44 Correct 1 ms 4688 KB Output is correct
45 Correct 1 ms 4688 KB Output is correct
46 Correct 1 ms 4688 KB Output is correct
47 Correct 2 ms 4688 KB Output is correct
48 Correct 1 ms 4688 KB Output is correct
49 Correct 1 ms 4688 KB Output is correct
50 Correct 1 ms 4688 KB Output is correct
51 Correct 2 ms 4688 KB Output is correct
52 Correct 2 ms 4688 KB Output is correct
53 Correct 1 ms 4688 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 4688 KB Output is correct
7 Correct 1 ms 4688 KB Output is correct
8 Correct 1 ms 4688 KB Output is correct
9 Correct 1 ms 4688 KB Output is correct
10 Correct 1 ms 4688 KB Output is correct
11 Correct 1 ms 4688 KB Output is correct
12 Correct 1 ms 4688 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4856 KB Output is correct
15 Correct 1 ms 4688 KB Output is correct
16 Correct 1 ms 4688 KB Output is correct
17 Correct 1 ms 4688 KB Output is correct
18 Correct 1 ms 4688 KB Output is correct
19 Correct 1 ms 4688 KB Output is correct
20 Correct 1 ms 4688 KB Output is correct
21 Correct 1 ms 4684 KB Output is correct
22 Correct 1 ms 4688 KB Output is correct
23 Correct 1 ms 4688 KB Output is correct
24 Correct 2 ms 4688 KB Output is correct
25 Correct 1 ms 2640 KB Output is correct
26 Correct 1 ms 2640 KB Output is correct
27 Correct 1 ms 4688 KB Output is correct
28 Correct 1 ms 4688 KB Output is correct
29 Correct 1 ms 4688 KB Output is correct
30 Correct 1 ms 4688 KB Output is correct
31 Correct 2 ms 4688 KB Output is correct
32 Correct 1 ms 4688 KB Output is correct
33 Correct 1 ms 4688 KB Output is correct
34 Correct 1 ms 4688 KB Output is correct
35 Correct 1 ms 4688 KB Output is correct
36 Correct 1 ms 4876 KB Output is correct
37 Correct 1 ms 4688 KB Output is correct
38 Correct 2 ms 4688 KB Output is correct
39 Correct 1 ms 4688 KB Output is correct
40 Correct 1 ms 4688 KB Output is correct
41 Correct 1 ms 4688 KB Output is correct
42 Correct 1 ms 4688 KB Output is correct
43 Correct 2 ms 4688 KB Output is correct
44 Correct 1 ms 4688 KB Output is correct
45 Correct 1 ms 4688 KB Output is correct
46 Correct 1 ms 4688 KB Output is correct
47 Correct 2 ms 4688 KB Output is correct
48 Correct 1 ms 4688 KB Output is correct
49 Correct 1 ms 4688 KB Output is correct
50 Correct 1 ms 4688 KB Output is correct
51 Correct 2 ms 4688 KB Output is correct
52 Correct 2 ms 4688 KB Output is correct
53 Correct 1 ms 4688 KB Output is correct
54 Correct 2 ms 4688 KB Output is correct
55 Correct 10 ms 78016 KB Output is correct
56 Correct 3 ms 5244 KB Output is correct
57 Correct 8 ms 56144 KB Output is correct
58 Correct 53 ms 49996 KB Output is correct
59 Correct 410 ms 256076 KB Output is correct
60 Correct 414 ms 256128 KB Output is correct
61 Correct 411 ms 256072 KB Output is correct
62 Correct 2 ms 4688 KB Output is correct
63 Correct 396 ms 251472 KB Output is correct
64 Correct 405 ms 256248 KB Output is correct
65 Correct 406 ms 256072 KB Output is correct
66 Correct 419 ms 256080 KB Output is correct
67 Correct 386 ms 256068 KB Output is correct
68 Correct 397 ms 256076 KB Output is correct
69 Correct 391 ms 256240 KB Output is correct
70 Correct 50 ms 49992 KB Output is correct
71 Correct 47 ms 50144 KB Output is correct
72 Correct 45 ms 50000 KB Output is correct
73 Correct 45 ms 50000 KB Output is correct
74 Correct 45 ms 49992 KB Output is correct
75 Correct 47 ms 49992 KB Output is correct
76 Correct 45 ms 50096 KB Output is correct
77 Correct 46 ms 49992 KB Output is correct
78 Correct 46 ms 49992 KB Output is correct
79 Correct 47 ms 49992 KB Output is correct
80 Correct 49 ms 50000 KB Output is correct
81 Correct 45 ms 49992 KB Output is correct
82 Correct 45 ms 50008 KB Output is correct
83 Correct 51 ms 50000 KB Output is correct
84 Correct 50 ms 50052 KB Output is correct
85 Correct 50 ms 50000 KB Output is correct
86 Correct 53 ms 49992 KB Output is correct
87 Correct 51 ms 50076 KB Output is correct
88 Correct 53 ms 49992 KB Output is correct
89 Correct 51 ms 50000 KB Output is correct
90 Correct 57 ms 50004 KB Output is correct