oj.uz

Submission #939292

# Submission time Handle Problem Language Result Execution time Memory
939292 2024-03-06T08:16:51 Z vjudge1 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 291 ms 159344 KB 
#include<bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 3000+1;
const int M = 7e6 + 1;
int mod = 998244353;
const int infi = INT_MAX;
const ll infl = LLONG_MAX;
const int P = 31;

int mult(int a, int b) {
    return a * 1LL * b % mod;
}

int sum(int a, int b) { 
    if (a + b < 0)
        return a + b + mod;
    if (a + b >= mod)
        return a + b - mod;
    return a + b;
}

ll binpow(ll a, ll n) {
    if (n == 0)
        return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1) * a % mod;
    } else {
        ll b = binpow(a, n / 2);
        return b * b % mod;
    }
}
int n, m, l[N][N], r[N][N];
char c[N][N];

void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            cin >> c[i][j];
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(i + 2 <= n){
                if(c[i][j] == 'R' && c[i + 1][j] == 'G' && c[i + 2][j] == 'W')
                    l[i][j] = 1;
            }
            if(j + 2 <= m){
                if(c[i][j] == 'R' && c[i][j + 1] == 'G' && c[i][j + 2] == 'W')
                    r[i][j] = 1;
            }
        }
    }
    int ans = 0;
    for(int s = 2; s <= n + m; s++){
        vector<int> dpl(min(s + 1, m + 1), 0);
        vector<int> dpr(min(s + 1, m + 1), 0);
        for(int j = 1; j <= min(s, m); j++){
            int i = s - j;
            if(i < 1 || i > n){
                dpl[j] = dpl[j - 1];
                dpr[j] = dpr[j - 1];
                continue;
            }
            if(l[i][j]){
                dpl[j] = dpl[j - 1] + 1;
                if(j - 3 >= 0)
                    dpl[j] = max(dpl[j], dpr[j - 3] + 1);
            }else{
                dpl[j] = dpl[j - 1];
            }
            if(r[i][j]){
                dpr[j] = max(dpr[j - 1], dpl[j - 1]) + 1;
            }else{
                dpr[j] = dpr[j - 1];
            }
        }
        ans += max(dpr[min(s, m)], dpl[min(s, m)]);
    }
    cout << ans << '\n';
}   

signed main() {
    mispertion;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4580 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4580 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4568 KB Output is correct
29 Correct 1 ms 4572 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4440 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct
38 Correct 1 ms 4440 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4696 KB Output is correct
42 Correct 2 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4700 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4568 KB Output is correct
47 Correct 1 ms 4444 KB Output is correct
48 Correct 1 ms 4440 KB Output is correct
49 Correct 1 ms 4440 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 1 ms 4440 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 1 ms 4452 KB Output is correct
54 Correct 11 ms 2392 KB Output is correct
55 Correct 24 ms 78676 KB Output is correct
56 Correct 13 ms 4956 KB Output is correct
57 Correct 14 ms 94044 KB Output is correct
58 Correct 29 ms 54872 KB Output is correct
59 Correct 276 ms 159096 KB Output is correct
60 Correct 291 ms 159344 KB Output is correct
61 Correct 275 ms 159060 KB Output is correct
62 Correct 10 ms 2648 KB Output is correct
63 Correct 272 ms 159056 KB Output is correct
64 Correct 234 ms 159060 KB Output is correct
65 Correct 231 ms 159060 KB Output is correct
66 Correct 234 ms 159092 KB Output is correct
67 Correct 153 ms 90268 KB Output is correct
68 Correct 183 ms 97752 KB Output is correct
69 Correct 219 ms 113304 KB Output is correct
70 Correct 24 ms 54956 KB Output is correct
71 Correct 23 ms 54864 KB Output is correct
72 Correct 23 ms 54876 KB Output is correct
73 Correct 23 ms 54876 KB Output is correct
74 Correct 23 ms 55064 KB Output is correct
75 Correct 22 ms 54876 KB Output is correct
76 Correct 23 ms 54876 KB Output is correct
77 Correct 23 ms 54872 KB Output is correct
78 Correct 24 ms 54872 KB Output is correct
79 Correct 25 ms 54872 KB Output is correct
80 Correct 23 ms 54876 KB Output is correct
81 Correct 23 ms 54876 KB Output is correct
82 Correct 23 ms 54876 KB Output is correct
83 Correct 24 ms 54876 KB Output is correct
84 Correct 23 ms 54876 KB Output is correct
85 Correct 24 ms 54876 KB Output is correct
86 Correct 22 ms 54952 KB Output is correct
87 Correct 25 ms 54876 KB Output is correct
88 Correct 23 ms 54876 KB Output is correct
89 Correct 23 ms 55044 KB Output is correct
90 Correct 24 ms 54872 KB Output is correct