oj.uz

Submission #369176

# Submission time Handle Problem Language Result Execution time Memory
369176 2021-02-20T17:15:39 Z wiwiho Dango Maker (JOI18_dango_maker) C++14
100 / 100
 153 ms 97772 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) (((a) + (b) - 1) / (b))
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

int main(){
    StarBurstStream

    int n, m;
    cin >> n >> m;

    vector<string> a(n + 2);
    a[0] = a[n + 1] = string(m + 2, ' ');
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        a[i] = ' ' + a[i] + ' ';
    }

    vector<vector<int>> dp0(n + 2, vector<int>(m + 2));
    vector<vector<int>> dp1(n + 2, vector<int>(m + 2));
    vector<int> ans(n + m + 1);
    for(int i = n; i >= 1; i--){
        for(int j = 1; j <= m; j++){
            dp0[i][j] = dp1[i][j] = max(dp0[i + 1][j - 1], dp1[i + 1][j - 1]);
            if(a[i][j] != 'G') continue;
//            cerr << i << " " << j << " " << a[i - 1][j] << " " << a[i + 1][j] << " " << a[i][j - 1] << " " << a[i][j + 1] << "\n";
            if(a[i - 1][j] == 'R' && a[i + 1][j] == 'W') dp0[i][j] = max(dp0[i][j], dp0[i + 1][j - 1] + 1);
            if(a[i][j - 1] == 'R' && a[i][j + 1] == 'W') dp1[i][j] = max(dp1[i][j], dp1[i + 1][j - 1] + 1);
            ans[i + j] = max({ans[i + j], dp0[i][j], dp1[i][j]});
        }
    }
//    for(int i = 1; i <= n; i++) printv(dp0[i], cerr);
//    for(int i = 1; i <= n; i++) printv(dp1[i], cerr);

    int total = 0;
    for(int i : ans) total += i;

    cout << total << "\n";

    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 0 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 0 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 492 KB Output is correct
55 Correct 2 ms 748 KB Output is correct
56 Correct 1 ms 620 KB Output is correct
57 Correct 1 ms 748 KB Output is correct
58 Correct 17 ms 10476 KB Output is correct
59 Correct 147 ms 88992 KB Output is correct
60 Correct 145 ms 89068 KB Output is correct
61 Correct 153 ms 89068 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 139 ms 86124 KB Output is correct
64 Correct 92 ms 97772 KB Output is correct
65 Correct 87 ms 97772 KB Output is correct
66 Correct 86 ms 97772 KB Output is correct
67 Correct 85 ms 97772 KB Output is correct
68 Correct 88 ms 97772 KB Output is correct
69 Correct 91 ms 97772 KB Output is correct
70 Correct 11 ms 11244 KB Output is correct
71 Correct 11 ms 11244 KB Output is correct
72 Correct 12 ms 11244 KB Output is correct
73 Correct 10 ms 11328 KB Output is correct
74 Correct 11 ms 11244 KB Output is correct
75 Correct 11 ms 11244 KB Output is correct
76 Correct 11 ms 11244 KB Output is correct
77 Correct 11 ms 11244 KB Output is correct
78 Correct 12 ms 11244 KB Output is correct
79 Correct 10 ms 11244 KB Output is correct
80 Correct 11 ms 11244 KB Output is correct
81 Correct 11 ms 11244 KB Output is correct
82 Correct 11 ms 11244 KB Output is correct
83 Correct 11 ms 11244 KB Output is correct
84 Correct 11 ms 11244 KB Output is correct
85 Correct 10 ms 11244 KB Output is correct
86 Correct 11 ms 11244 KB Output is correct
87 Correct 10 ms 11372 KB Output is correct
88 Correct 10 ms 11244 KB Output is correct
89 Correct 10 ms 11244 KB Output is correct
90 Correct 11 ms 11244 KB Output is correct