oj.uz

Submission #768147

# Submission time Handle Problem Language Result Execution time Memory
768147 2023-06-27T14:59:00 Z bachhoangxuan Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 42 ms 97076 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
int dp[202][202][202][3],cost[404][404];
void solve(){
    int n;string s;cin >> n >> s;
    vector<vector<int>> v(3);
    for(int i=0;i<3;i++) v[i].push_back(0);
    for(int i=0;i<n;i++) v[(s[i]=='R'?0:(s[i]=='G'?1:2))].push_back(i+1);
    int a=(int)v[0].size()-1,b=(int)v[1].size()-1,c=(int)v[2].size()-1;
    if(a+b+c+1<2*max({a,b,c})){
        cout << -1 << '\n';
        return;
    }
    for(int i=0;i<=a;i++) for(int j=0;j<=b;j++) for(int k=0;k<=c;k++) for(int d=0;d<=2;d++) dp[i][j][k][d]=inf;
    for(int i=1;i<=n;i++){
        for(int k=0;k<3;k++){
            int cur=0;
            for(int a:v[k]) cur+=(a>i),cost[i][a]=cur;
        }
    }
    for(int i=0;i<3;i++) dp[0][0][0][i]=0;
    for(int i=0;i<=a;i++) for(int j=0;j<=b;j++) for(int k=0;k<=c;k++){
        if(i>=1) dp[i][j][k][0]=min(dp[i-1][j][k][1],dp[i-1][j][k][2])+cost[v[0][i]][v[1][j]]+cost[v[0][i]][v[2][k]];
        if(j>=1) dp[i][j][k][1]=min(dp[i][j-1][k][0],dp[i][j-1][k][2])+cost[v[1][j]][v[0][i]]+cost[v[1][j]][v[2][k]];
        if(k>=1) dp[i][j][k][2]=min(dp[i][j][k-1][0],dp[i][j][k-1][1])+cost[v[2][k]][v[0][i]]+cost[v[2][k]][v[1][j]];
    }
    int ans=inf;
    for(int i=0;i<3;i++) ans=min(ans,dp[a][b][c][i]);
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1236 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1620 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1364 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 2 ms 2004 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 1 ms 1492 KB Output is correct
30 Correct 1 ms 1492 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 1 ms 1492 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 1748 KB Output is correct
36 Correct 1 ms 1236 KB Output is correct
37 Correct 1 ms 1108 KB Output is correct
38 Correct 1 ms 1364 KB Output is correct
39 Correct 1 ms 1492 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 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 31 ms 97024 KB Output is correct
3 Correct 32 ms 96600 KB Output is correct
4 Correct 33 ms 97028 KB Output is correct
5 Correct 32 ms 97056 KB Output is correct
6 Correct 34 ms 97064 KB Output is correct
7 Correct 32 ms 96584 KB Output is correct
8 Correct 33 ms 96576 KB Output is correct
9 Correct 38 ms 96204 KB Output is correct
10 Correct 33 ms 97076 KB Output is correct
11 Correct 34 ms 97052 KB Output is correct
12 Correct 11 ms 26452 KB Output is correct
13 Correct 19 ms 46164 KB Output is correct
14 Correct 25 ms 66468 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1236 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1620 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1364 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 2 ms 2004 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 1 ms 1492 KB Output is correct
30 Correct 1 ms 1492 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 1 ms 1492 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 1748 KB Output is correct
36 Correct 1 ms 1236 KB Output is correct
37 Correct 1 ms 1108 KB Output is correct
38 Correct 1 ms 1364 KB Output is correct
39 Correct 1 ms 1492 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 31 ms 97024 KB Output is correct
44 Correct 32 ms 96600 KB Output is correct
45 Correct 33 ms 97028 KB Output is correct
46 Correct 32 ms 97056 KB Output is correct
47 Correct 34 ms 97064 KB Output is correct
48 Correct 32 ms 96584 KB Output is correct
49 Correct 33 ms 96576 KB Output is correct
50 Correct 38 ms 96204 KB Output is correct
51 Correct 33 ms 97076 KB Output is correct
52 Correct 34 ms 97052 KB Output is correct
53 Correct 11 ms 26452 KB Output is correct
54 Correct 19 ms 46164 KB Output is correct
55 Correct 25 ms 66468 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 30 ms 38996 KB Output is correct
59 Correct 35 ms 49188 KB Output is correct
60 Correct 34 ms 44868 KB Output is correct
61 Correct 32 ms 43400 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 37 ms 93248 KB Output is correct
64 Correct 41 ms 81620 KB Output is correct
65 Correct 42 ms 71124 KB Output is correct
66 Correct 33 ms 43988 KB Output is correct
67 Correct 31 ms 42340 KB Output is correct
68 Correct 34 ms 45292 KB Output is correct
69 Correct 33 ms 43604 KB Output is correct
70 Correct 35 ms 47124 KB Output is correct
71 Correct 33 ms 42972 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 0 ms 212 KB Output is correct