oj.uz

Submission #309869

# Submission time Handle Problem Language Result Execution time Memory
309869 2020-10-04T20:16:18 Z aZvezda Dango Maker (JOI18_dango_maker) C++14
100 / 100
 420 ms 129328 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const ll MAX_N = 3e3 + 10;
string arr[MAX_N];
ll n, m;
bool down[MAX_N][MAX_N], rght[MAX_N][MAX_N];

vector<ll> diag[MAX_N * 2];

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    cin >> n >> m;
    for(ll i = 0; i < n; i ++) {
        cin >> arr[i];
    }
    for(ll i = 0; i < n; i ++) {
        for(ll j = 1; j < m - 1; j ++) {
            rght[i][j] = arr[i][j - 1] == 'R' && arr[i][j] == 'G' && arr[i][j + 1] == 'W';
        }
    }
    for(ll j = 0; j < m; j ++) {
        for(ll i = 1; i < n - 1; i ++) {
            down[i][j] = arr[i - 1][j] == 'R' && arr[i][j] == 'G' && arr[i + 1][j] == 'W';
        }
    }
    for(ll i = 0; i < n; i ++) {
        for(ll j = 0; j < m; j ++) {
            diag[i + j].push_back(((ll)down[i][j] << 1) + (ll)rght[i][j]);
        }
    }
    ll cnt = 0;
    for(ll i = 0; i < n + m; i ++) {
        ll dp[3] = {0, 0, 0};
        ll curr[3] = {0, 0, 0};
        for(auto it : diag[i]) {
            if(it & (1 << 1)) {
                curr[1] = max(dp[1], dp[0]) + 1;
            }
            if(it & 1) {
                curr[2] = max(dp[2], dp[0]) + 1;
            }
            curr[0] = max({dp[0], dp[1], dp[2]});
            for(ll i = 0; i < 3; i ++) {dp[i] = curr[i]; curr[i] = 0;}
        }
        cnt += max({dp[0], dp[1], dp[2]});
    }
    cout << cnt << endl;
    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 1 ms 640 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 1 ms 640 KB Output is correct
22 Correct 1 ms 640 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 640 KB Output is correct
28 Correct 1 ms 640 KB Output is correct
29 Correct 1 ms 640 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 1 ms 640 KB Output is correct
32 Correct 1 ms 640 KB Output is correct
33 Correct 1 ms 640 KB Output is correct
34 Correct 1 ms 640 KB Output is correct
35 Correct 1 ms 640 KB Output is correct
36 Correct 1 ms 640 KB Output is correct
37 Correct 1 ms 640 KB Output is correct
38 Correct 1 ms 640 KB Output is correct
39 Correct 1 ms 640 KB Output is correct
40 Correct 1 ms 640 KB Output is correct
41 Correct 1 ms 640 KB Output is correct
42 Correct 1 ms 640 KB Output is correct
43 Correct 1 ms 640 KB Output is correct
44 Correct 1 ms 640 KB Output is correct
45 Correct 1 ms 640 KB Output is correct
46 Correct 1 ms 640 KB Output is correct
47 Correct 1 ms 640 KB Output is correct
48 Correct 1 ms 640 KB Output is correct
49 Correct 1 ms 640 KB Output is correct
50 Correct 1 ms 640 KB Output is correct
51 Correct 1 ms 640 KB Output is correct
52 Correct 1 ms 640 KB Output is correct
53 Correct 1 ms 640 KB Output is correct
54 Correct 1 ms 672 KB Output is correct
55 Correct 7 ms 9472 KB Output is correct
56 Correct 2 ms 896 KB Output is correct
57 Correct 7 ms 12544 KB Output is correct
58 Correct 35 ms 19064 KB Output is correct
59 Correct 418 ms 129272 KB Output is correct
60 Correct 420 ms 129276 KB Output is correct
61 Correct 419 ms 129200 KB Output is correct
62 Correct 1 ms 640 KB Output is correct
63 Correct 411 ms 125680 KB Output is correct
64 Correct 377 ms 129272 KB Output is correct
65 Correct 377 ms 129272 KB Output is correct
66 Correct 378 ms 129276 KB Output is correct
67 Correct 373 ms 129272 KB Output is correct
68 Correct 373 ms 129328 KB Output is correct
69 Correct 376 ms 129272 KB Output is correct
70 Correct 25 ms 19080 KB Output is correct
71 Correct 27 ms 19072 KB Output is correct
72 Correct 25 ms 19064 KB Output is correct
73 Correct 25 ms 19072 KB Output is correct
74 Correct 27 ms 19068 KB Output is correct
75 Correct 25 ms 19064 KB Output is correct
76 Correct 26 ms 19072 KB Output is correct
77 Correct 25 ms 19072 KB Output is correct
78 Correct 25 ms 19072 KB Output is correct
79 Correct 25 ms 19072 KB Output is correct
80 Correct 27 ms 19072 KB Output is correct
81 Correct 25 ms 19064 KB Output is correct
82 Correct 25 ms 19064 KB Output is correct
83 Correct 25 ms 19072 KB Output is correct
84 Correct 25 ms 19072 KB Output is correct
85 Correct 25 ms 19072 KB Output is correct
86 Correct 26 ms 19192 KB Output is correct
87 Correct 27 ms 19072 KB Output is correct
88 Correct 25 ms 19072 KB Output is correct
89 Correct 25 ms 19064 KB Output is correct
90 Correct 26 ms 19072 KB Output is correct