oj.uz

Submission #170449

# Submission time Handle Problem Language Result Execution time Memory
170449 2019-12-25T10:27:16 Z Akashi Dango Maker (JOI18_dango_maker) C++14
100 / 100
 235 ms 18164 KB 
#include <bits/stdc++.h>
using namespace std;

int n, m;
int d[3010][2][2];
char s[3010][3010];

int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n ; ++i) scanf("%s", s[i] + 1);

    int ans = 0;
    for(int diag = 1; diag <= n + m - 1 ; ++diag){
        int l, c;
        l = 1; c = diag;
        if(c > m) l = l + (c - m), c = m;
        if(l > n) c = c + (l - n), l = n;

        int L = min(n - l + 1, c);
        for(int i = 1; i <= L ; ++i)
            for(int j = 0; j < 2 ; ++j)
                for(int t = 0; t < 2 ; ++t)
                    d[i][j][t] = 0;

        for(int i = 1; i <= L ; ++i, ++l, --c){
            for(int j = 0; j < 2 ; ++j)
                for(int t = 0; t < 2 ; ++t)
                    d[i][t][0] = max(d[i][t][0], d[i - 1][j][t]);
            if(s[l][c] != 'R') continue ;

            if(s[l + 1][c] == 'G' && s[l + 2][c] == 'W'){
                for(int t = 0; t < 2 ; ++t)
                    d[i][t][1] = max(d[i][t][1], d[i][t][0] + 1);
            }
            if(s[l][c + 1] == 'G' && s[l][c + 2] == 'W'){
                d[i][0][0] = max(d[i - 1][0][0] + 1, d[i][0][0]);
            }
        }

        int Max = 0;
        for(int i = 1; i <= L ; ++i)
            for(int j = 0; j < 2 ; ++j)
                for(int t = 0; t < 2 ; ++t)
                    Max = max(Max, d[i][j][t]);
        ans = ans + Max;
    }

    printf("%d", ans);
    return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
dango_maker.cpp:11:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n ; ++i) scanf("%s", s[i] + 1);
                                  ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 396 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 424 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 252 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 396 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 396 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 424 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 252 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 396 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 372 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 400 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 372 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 400 KB Output is correct
44 Correct 2 ms 400 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 372 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 348 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 404 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 9 ms 9208 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 7 ms 6264 KB Output is correct
58 Correct 28 ms 4216 KB Output is correct
59 Correct 218 ms 18032 KB Output is correct
60 Correct 223 ms 18160 KB Output is correct
61 Correct 235 ms 18032 KB Output is correct
62 Correct 2 ms 348 KB Output is correct
63 Correct 215 ms 17744 KB Output is correct
64 Correct 170 ms 17992 KB Output is correct
65 Correct 156 ms 18016 KB Output is correct
66 Correct 162 ms 18164 KB Output is correct
67 Correct 153 ms 18136 KB Output is correct
68 Correct 157 ms 17928 KB Output is correct
69 Correct 158 ms 18040 KB Output is correct
70 Correct 18 ms 4216 KB Output is correct
71 Correct 18 ms 4344 KB Output is correct
72 Correct 18 ms 4316 KB Output is correct
73 Correct 18 ms 4216 KB Output is correct
74 Correct 18 ms 4216 KB Output is correct
75 Correct 18 ms 4216 KB Output is correct
76 Correct 18 ms 4216 KB Output is correct
77 Correct 18 ms 4216 KB Output is correct
78 Correct 19 ms 4216 KB Output is correct
79 Correct 20 ms 4216 KB Output is correct
80 Correct 18 ms 4216 KB Output is correct
81 Correct 18 ms 4216 KB Output is correct
82 Correct 19 ms 4216 KB Output is correct
83 Correct 18 ms 4220 KB Output is correct
84 Correct 18 ms 4216 KB Output is correct
85 Correct 18 ms 4216 KB Output is correct
86 Correct 19 ms 4216 KB Output is correct
87 Correct 18 ms 4344 KB Output is correct
88 Correct 18 ms 4216 KB Output is correct
89 Correct 19 ms 4216 KB Output is correct
90 Correct 18 ms 4216 KB Output is correct