oj.uz

Submission #155639

# Submission time Handle Problem Language Result Execution time Memory
155639 2019-09-29T13:23:24 Z popovicirobert Dango Maker (JOI18_dango_maker) C++14
100 / 100
 480 ms 88696 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



#if 0
const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}
#endif

#if 0
int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif

using namespace std;

const int MAXN = 3005;

char mat[MAXN + 1][MAXN + 1];
bool u[MAXN + 1][MAXN + 1], r[MAXN + 1][MAXN + 1];

short dp[MAXN + 1][MAXN + 1][3];

int main() {
#if 0
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, j, n, m;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m;

    for(i = 1; i <= n; i++) {
        cin >> mat[i] + 1;
    }

    for(i = 1; i <= n; i++) {
        for(j = 1; j <= m; j++) {
            if(mat[i][j] == 'G') {
                if(mat[i - 1][j] == 'R' && mat[i + 1][j] == 'W') {
                    u[i][j] = 1;
                }
                if(mat[i][j - 1] == 'R' && mat[i][j + 1] == 'W') {
                    r[i][j] = 1;
                }
            }
        }
    }

    int ls = 1, cs = 1, ans = 0;
    for(i = 2; i <= n + m; i++) {
        int l = ls, c = cs;

        dp[l][c][0] = 0;
        dp[l][c][1] = u[l][c];
        dp[l][c][2] = r[l][c];

        l--, c++;
        while(l > 0 && c <= m) {
            for(j = 0; j < 3; j++) {
                dp[l][c][0] = max(dp[l][c][0], dp[l + 1][c - 1][j]);
            }
            if(u[l][c]) {
                dp[l][c][1] = max(dp[l + 1][c - 1][1], dp[l + 1][c - 1][0]) + 1;
            }
            if(r[l][c]) {
                dp[l][c][2] = max(dp[l + 1][c - 1][2], dp[l + 1][c - 1][0]) + 1;
            }
            l--, c++;
        }
        ls++;
        if(ls == n + 1) {
            ls = n, cs++;
        }

        l++, c--;
        ans += max(max(dp[l][c][0], dp[l][c][1]), dp[l][c][2]);
    }
    cout << ans;

    return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:86:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         cin >> mat[i] + 1;
                ~~~~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 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 376 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 504 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 504 KB Output is correct
36 Correct 2 ms 504 KB Output is correct
37 Correct 2 ms 632 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 2 ms 504 KB Output is correct
42 Correct 2 ms 516 KB Output is correct
43 Correct 2 ms 504 KB Output is correct
44 Correct 2 ms 508 KB Output is correct
45 Correct 2 ms 504 KB Output is correct
46 Correct 2 ms 504 KB Output is correct
47 Correct 2 ms 504 KB Output is correct
48 Correct 2 ms 504 KB Output is correct
49 Correct 2 ms 504 KB Output is correct
50 Correct 1 ms 504 KB Output is correct
51 Correct 2 ms 504 KB Output is correct
52 Correct 2 ms 504 KB Output is correct
53 Correct 2 ms 504 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 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 376 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 504 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 504 KB Output is correct
36 Correct 2 ms 504 KB Output is correct
37 Correct 2 ms 632 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 2 ms 504 KB Output is correct
42 Correct 2 ms 516 KB Output is correct
43 Correct 2 ms 504 KB Output is correct
44 Correct 2 ms 508 KB Output is correct
45 Correct 2 ms 504 KB Output is correct
46 Correct 2 ms 504 KB Output is correct
47 Correct 2 ms 504 KB Output is correct
48 Correct 2 ms 504 KB Output is correct
49 Correct 2 ms 504 KB Output is correct
50 Correct 1 ms 504 KB Output is correct
51 Correct 2 ms 504 KB Output is correct
52 Correct 2 ms 504 KB Output is correct
53 Correct 2 ms 504 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 23 ms 21752 KB Output is correct
56 Correct 2 ms 508 KB Output is correct
57 Correct 20 ms 22648 KB Output is correct
58 Correct 46 ms 20024 KB Output is correct
59 Correct 479 ms 88500 KB Output is correct
60 Correct 474 ms 88696 KB Output is correct
61 Correct 480 ms 88540 KB Output is correct
62 Correct 2 ms 380 KB Output is correct
63 Correct 473 ms 88452 KB Output is correct
64 Correct 402 ms 88696 KB Output is correct
65 Correct 400 ms 88628 KB Output is correct
66 Correct 409 ms 88568 KB Output is correct
67 Correct 393 ms 77932 KB Output is correct
68 Correct 393 ms 78072 KB Output is correct
69 Correct 432 ms 84420 KB Output is correct
70 Correct 43 ms 19960 KB Output is correct
71 Correct 41 ms 20088 KB Output is correct
72 Correct 43 ms 19960 KB Output is correct
73 Correct 43 ms 20088 KB Output is correct
74 Correct 38 ms 19960 KB Output is correct
75 Correct 42 ms 20184 KB Output is correct
76 Correct 38 ms 20060 KB Output is correct
77 Correct 39 ms 19960 KB Output is correct
78 Correct 40 ms 20004 KB Output is correct
79 Correct 38 ms 20088 KB Output is correct
80 Correct 41 ms 19960 KB Output is correct
81 Correct 43 ms 20088 KB Output is correct
82 Correct 42 ms 19960 KB Output is correct
83 Correct 44 ms 20060 KB Output is correct
84 Correct 37 ms 20088 KB Output is correct
85 Correct 38 ms 19960 KB Output is correct
86 Correct 38 ms 19960 KB Output is correct
87 Correct 43 ms 20088 KB Output is correct
88 Correct 38 ms 20040 KB Output is correct
89 Correct 39 ms 20012 KB Output is correct
90 Correct 38 ms 19960 KB Output is correct