oj.uz

Submission #61436

# Submission time Handle Problem Language Result Execution time Memory
61436 2018-07-26T01:23:56 Z Benq Dango Maker (JOI18_dango_maker) C++11
100 / 100
 396 ms 143372 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 3000;

int N,M,ok[MX][MX][2];
string s[MX];


int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M;
    F0R(i,N) cin >> s[i];
    F0R(i,N) F0R(j,M) if (s[i][j] == 'G') {
        if (i-1 >= 0 && i+1 < N && s[i-1][j] == 'R' && s[i+1][j] == 'W') ok[i][j][0] = 1;
        if (j-1 >= 0 && j+1 < M && s[i][j-1] == 'R' && s[i][j+1] == 'W') ok[i][j][1] = 1;
    }
    
    int ans = 0;
    
    F0R(sum,N+M-1) {
        vpi q;
        array<int,3> cur = {0,0,0};
        F0R(i,N) if (0 <= sum-i && sum-i < M) {
            int j = sum-i;
            array<int,3> ret = {max(cur[0],max(cur[1],cur[2])),0,0};
            if (ok[i][j][0]) ret[1] = max(cur[0],cur[1])+1;
            if (ok[i][j][1]) ret[2] = max(cur[0],cur[2])+1;
            cur = ret;
        }
        
        ans += max(max(cur[0],cur[1]),cur[2]);
    }
    
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 2 ms 636 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 1 ms 636 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 4 ms 636 KB Output is correct
11 Correct 3 ms 636 KB Output is correct
12 Correct 3 ms 636 KB Output is correct
13 Correct 3 ms 668 KB Output is correct
14 Correct 3 ms 668 KB Output is correct
15 Correct 3 ms 668 KB Output is correct
16 Correct 4 ms 668 KB Output is correct
17 Correct 3 ms 668 KB Output is correct
18 Correct 3 ms 740 KB Output is correct
19 Correct 3 ms 760 KB Output is correct
20 Correct 3 ms 764 KB Output is correct
21 Correct 3 ms 764 KB Output is correct
22 Correct 3 ms 764 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 3 ms 764 KB Output is correct
25 Correct 3 ms 764 KB Output is correct
26 Correct 4 ms 764 KB Output is correct
27 Correct 3 ms 780 KB Output is correct
28 Correct 3 ms 780 KB Output is correct
29 Correct 2 ms 780 KB Output is correct
30 Correct 3 ms 780 KB Output is correct
31 Correct 3 ms 780 KB Output is correct
32 Correct 3 ms 780 KB Output is correct
33 Correct 3 ms 780 KB Output is correct
34 Correct 3 ms 780 KB Output is correct
35 Correct 3 ms 780 KB Output is correct
36 Correct 4 ms 780 KB Output is correct
37 Correct 2 ms 780 KB Output is correct
38 Correct 3 ms 780 KB Output is correct
39 Correct 4 ms 780 KB Output is correct
40 Correct 2 ms 780 KB Output is correct
41 Correct 3 ms 780 KB Output is correct
42 Correct 2 ms 780 KB Output is correct
43 Correct 3 ms 780 KB Output is correct
44 Correct 3 ms 780 KB Output is correct
45 Correct 4 ms 780 KB Output is correct
46 Correct 4 ms 780 KB Output is correct
47 Correct 3 ms 780 KB Output is correct
48 Correct 4 ms 780 KB Output is correct
49 Correct 3 ms 780 KB Output is correct
50 Correct 3 ms 788 KB Output is correct
51 Correct 4 ms 788 KB Output is correct
52 Correct 3 ms 788 KB Output is correct
53 Correct 3 ms 800 KB Output is correct
54 Correct 3 ms 804 KB Output is correct
55 Correct 12 ms 1444 KB Output is correct
56 Correct 3 ms 1444 KB Output is correct
57 Correct 14 ms 8044 KB Output is correct
58 Correct 48 ms 14552 KB Output is correct
59 Correct 384 ms 90788 KB Output is correct
60 Correct 396 ms 99784 KB Output is correct
61 Correct 377 ms 108516 KB Output is correct
62 Correct 3 ms 108516 KB Output is correct
63 Correct 348 ms 116660 KB Output is correct
64 Correct 333 ms 125748 KB Output is correct
65 Correct 329 ms 134564 KB Output is correct
66 Correct 393 ms 143372 KB Output is correct
67 Correct 234 ms 143372 KB Output is correct
68 Correct 256 ms 143372 KB Output is correct
69 Correct 262 ms 143372 KB Output is correct
70 Correct 50 ms 143372 KB Output is correct
71 Correct 42 ms 143372 KB Output is correct
72 Correct 42 ms 143372 KB Output is correct
73 Correct 37 ms 143372 KB Output is correct
74 Correct 45 ms 143372 KB Output is correct
75 Correct 38 ms 143372 KB Output is correct
76 Correct 34 ms 143372 KB Output is correct
77 Correct 42 ms 143372 KB Output is correct
78 Correct 53 ms 143372 KB Output is correct
79 Correct 37 ms 143372 KB Output is correct
80 Correct 40 ms 143372 KB Output is correct
81 Correct 35 ms 143372 KB Output is correct
82 Correct 38 ms 143372 KB Output is correct
83 Correct 38 ms 143372 KB Output is correct
84 Correct 36 ms 143372 KB Output is correct
85 Correct 41 ms 143372 KB Output is correct
86 Correct 33 ms 143372 KB Output is correct
87 Correct 36 ms 143372 KB Output is correct
88 Correct 42 ms 143372 KB Output is correct
89 Correct 46 ms 143372 KB Output is correct
90 Correct 47 ms 143372 KB Output is correct