oj.uz

Submission #235766

# Submission time Handle Problem Language Result Execution time Memory
235766 2020-05-29T16:33:15 Z Autoratch Dango Maker (JOI18_dango_maker) C++14
100 / 100
 302 ms 141432 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 3002;

int m,n,ans;
char c[N][N];
int a[N][N][3];
bool val[N][N][2];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> m >> n;
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) cin >> c[i][j];
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++)
    {
        if(c[i-1][j]=='R' and c[i][j]=='G' and c[i+1][j]=='W') val[i][j][0] = true;
        if(c[i][j-1]=='R' and c[i][j]=='G' and c[i][j+1]=='W') val[i][j][1] = true;
    }
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++)
    {
        a[i][j][0] = max(a[i-1][j+1][0],max(a[i-1][j+1][1],a[i-1][j+1][2]));
        if(val[i][j][0]) a[i][j][1] = 1+max(a[i-1][j+1][0],a[i-1][j+1][1]);
        if(val[i][j][1]) a[i][j][2] = 1+max(a[i-1][j+1][0],a[i-1][j+1][2]);
    }
    for(int i = 1;i <= m;i++) ans+=max(a[i][1][0],max(a[i][1][1],a[i][1][2]));
    for(int i = 2;i <= n;i++) ans+=max(a[m][i][0],max(a[m][i][1],a[m][i][2]));
    cout << ans;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 5 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 5 ms 512 KB Output is correct
46 Correct 5 ms 512 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 5 ms 512 KB Output is correct
49 Correct 5 ms 560 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 5 ms 512 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 5 ms 512 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 16 ms 21760 KB Output is correct
56 Correct 5 ms 640 KB Output is correct
57 Correct 15 ms 21632 KB Output is correct
58 Correct 42 ms 25848 KB Output is correct
59 Correct 302 ms 141432 KB Output is correct
60 Correct 299 ms 141304 KB Output is correct
61 Correct 297 ms 141364 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 286 ms 141176 KB Output is correct
64 Correct 208 ms 141304 KB Output is correct
65 Correct 211 ms 141304 KB Output is correct
66 Correct 214 ms 141304 KB Output is correct
67 Correct 205 ms 133624 KB Output is correct
68 Correct 204 ms 133624 KB Output is correct
69 Correct 213 ms 137464 KB Output is correct
70 Correct 32 ms 25976 KB Output is correct
71 Correct 32 ms 25976 KB Output is correct
72 Correct 32 ms 25848 KB Output is correct
73 Correct 33 ms 25976 KB Output is correct
74 Correct 32 ms 25848 KB Output is correct
75 Correct 31 ms 25976 KB Output is correct
76 Correct 31 ms 25856 KB Output is correct
77 Correct 32 ms 25976 KB Output is correct
78 Correct 33 ms 25976 KB Output is correct
79 Correct 32 ms 25976 KB Output is correct
80 Correct 33 ms 25984 KB Output is correct
81 Correct 33 ms 25976 KB Output is correct
82 Correct 33 ms 25976 KB Output is correct
83 Correct 32 ms 25976 KB Output is correct
84 Correct 32 ms 25984 KB Output is correct
85 Correct 33 ms 25976 KB Output is correct
86 Correct 33 ms 25976 KB Output is correct
87 Correct 32 ms 25976 KB Output is correct
88 Correct 32 ms 25976 KB Output is correct
89 Correct 34 ms 25848 KB Output is correct
90 Correct 32 ms 25976 KB Output is correct