oj.uz

Submission #634025

# Submission time Handle Problem Language Result Execution time Memory
634025 2022-08-23T17:28:58 Z urosk Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 147 ms 130796 KB 
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll int
#define llinf 1000000000 // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
using namespace __gnu_pbds;
/*
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}
*/

#define maxn 405
ll n;
ll a[maxn];
ll dp[maxn][maxn][maxn][4];
bool bio[maxn][maxn][maxn][4];
ll sz[4];
ll pos[4][maxn];
ll calc[4][4][maxn][maxn];
ll reshi(ll r,ll g,ll y,ll last){
    if(r+g+y==0) return 0;
    if(bio[r][g][y][last]) return dp[r][g][y][last];
    ll &ans = dp[r][g][y][last];
    bio[r][g][y][last] = 1;
    ans = llinf;
    if(r&&last!=1) ans = min(ans,reshi(r-1,g,y,1)+calc[1][2][r][g]+calc[1][3][r][y]);
    if(g&&last!=2) ans = min(ans,reshi(r,g-1,y,2)+calc[2][1][g][r]+calc[2][3][g][y]);
    if(y&&last!=3) ans = min(ans,reshi(r,g,y-1,3)+calc[3][1][y][r]+calc[3][2][y][g]);
    return ans;
}
int main(){
	daj_mi_malo_vremena
    cin >> n; string s; cin >> s;
    for(ll i = 1;i<=n;i++){
        if(s[i-1]=='R') pos[1][++sz[1]] = i;
        if(s[i-1]=='G') pos[2][++sz[2]] = i;
        if(s[i-1]=='Y') pos[3][++sz[3]] = i;
    }
    for(ll e = 1;e<=3;e++){
        for(ll f = 1;f<=3;f++){
            if(e==f) continue;
            for(ll i = 1;i<=sz[e];i++){
                ll cur = 0;
                for(ll j = sz[f];j>=1;j--){
                    calc[e][f][i][j] = cur;
                    if(pos[e][i]>pos[f][j]) cur++;
                }
                calc[e][f][i][0] = cur;
            }
        }
    }
    ll ans = llinf;
    ans = min(ans,reshi(sz[1],sz[2],sz[3],1));
    ans = min(ans,reshi(sz[1],sz[2],sz[3],2));
    ans = min(ans,reshi(sz[1],sz[2],sz[3],3));
    if(ans==llinf) ans = -1;
    cout<<ans<<endl;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 3276 KB Output is correct
19 Correct 2 ms 2760 KB Output is correct
20 Correct 2 ms 3156 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 2 ms 2388 KB Output is correct
23 Correct 2 ms 3024 KB Output is correct
24 Correct 2 ms 2260 KB Output is correct
25 Correct 1 ms 1352 KB Output is correct
26 Correct 1 ms 1492 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Correct 2 ms 3284 KB Output is correct
29 Correct 2 ms 3152 KB Output is correct
30 Correct 2 ms 3152 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 2 ms 3284 KB Output is correct
33 Correct 1 ms 1740 KB Output is correct
34 Correct 1 ms 2004 KB Output is correct
35 Correct 2 ms 3284 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 2 ms 2388 KB Output is correct
38 Correct 2 ms 2892 KB Output is correct
39 Correct 2 ms 3284 KB Output is correct
40 Correct 0 ms 596 KB Output is correct
41 Correct 1 ms 1236 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 3 ms 6472 KB Output is correct
3 Correct 3 ms 6476 KB Output is correct
4 Correct 3 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 3 ms 6484 KB Output is correct
7 Correct 3 ms 6484 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 3 ms 6484 KB Output is correct
10 Correct 3 ms 6484 KB Output is correct
11 Correct 3 ms 6476 KB Output is correct
12 Correct 2 ms 3540 KB Output is correct
13 Correct 2 ms 4564 KB Output is correct
14 Correct 3 ms 5460 KB Output is correct
15 Correct 3 ms 6484 KB Output is correct
16 Correct 3 ms 6484 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 3276 KB Output is correct
19 Correct 2 ms 2760 KB Output is correct
20 Correct 2 ms 3156 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 2 ms 2388 KB Output is correct
23 Correct 2 ms 3024 KB Output is correct
24 Correct 2 ms 2260 KB Output is correct
25 Correct 1 ms 1352 KB Output is correct
26 Correct 1 ms 1492 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Correct 2 ms 3284 KB Output is correct
29 Correct 2 ms 3152 KB Output is correct
30 Correct 2 ms 3152 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 2 ms 3284 KB Output is correct
33 Correct 1 ms 1740 KB Output is correct
34 Correct 1 ms 2004 KB Output is correct
35 Correct 2 ms 3284 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 2 ms 2388 KB Output is correct
38 Correct 2 ms 2892 KB Output is correct
39 Correct 2 ms 3284 KB Output is correct
40 Correct 0 ms 596 KB Output is correct
41 Correct 1 ms 1236 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 3 ms 6472 KB Output is correct
44 Correct 3 ms 6476 KB Output is correct
45 Correct 3 ms 6484 KB Output is correct
46 Correct 3 ms 6484 KB Output is correct
47 Correct 3 ms 6484 KB Output is correct
48 Correct 3 ms 6484 KB Output is correct
49 Correct 3 ms 6484 KB Output is correct
50 Correct 3 ms 6484 KB Output is correct
51 Correct 3 ms 6484 KB Output is correct
52 Correct 3 ms 6476 KB Output is correct
53 Correct 2 ms 3540 KB Output is correct
54 Correct 2 ms 4564 KB Output is correct
55 Correct 3 ms 5460 KB Output is correct
56 Correct 3 ms 6484 KB Output is correct
57 Correct 3 ms 6484 KB Output is correct
58 Correct 147 ms 109624 KB Output is correct
59 Correct 139 ms 130796 KB Output is correct
60 Correct 135 ms 123020 KB Output is correct
61 Correct 144 ms 120508 KB Output is correct
62 Correct 8 ms 14292 KB Output is correct
63 Correct 12 ms 23708 KB Output is correct
64 Correct 50 ms 72008 KB Output is correct
65 Correct 71 ms 101988 KB Output is correct
66 Correct 136 ms 121636 KB Output is correct
67 Correct 130 ms 115956 KB Output is correct
68 Correct 138 ms 124780 KB Output is correct
69 Correct 136 ms 121136 KB Output is correct
70 Correct 137 ms 128300 KB Output is correct
71 Correct 135 ms 117452 KB Output is correct
72 Correct 10 ms 16724 KB Output is correct
73 Correct 2 ms 4684 KB Output is correct