oj.uz

Submission #1107320

# Submission time Handle Problem Language Result Execution time Memory
1107320 2024-11-01T06:12:34 Z vjudge1 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
15 / 100
 1 ms 2636 KB 
/**
 *    hello
 *    author:  N29
 *    created: 2024-11-01 11:03:40
**/
#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=1e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
int n;
int a[N];
int c[N];
int b[N];
int cnt[4];
int calc(){
    int res=0;
    for(int i=1;i<=n;i++){
        c[i]=a[i];
    }
    for(int i=1;i<=n;i++){
        if(b[i]!=c[i]){
            int pos=-1;
            for(int j=i;j<=n;j++){
                if(c[j]==b[i]){
                    pos=j;
                    break;
                }
            }
            res+=(pos-i);
            swap(c[i],c[pos]);
        }
    }
    return res;
}
void test(){
    cin>>n;
    for(int i=1;i<=n;i++){
        char x;
        cin>>x;
        if(x=='R')a[i]=1;
        if(x=='G')a[i]=2;
        if(x=='Y')a[i]=3;
        cnt[a[i]]++;
    }
    if(abs(cnt[1]-cnt[2])>=2){
        cout<<-1<<'\n';
        return;
    }
    if(abs(cnt[1]-cnt[2])==1){
        if(cnt[1]>cnt[2]){
            for(int j=1;j<=n;j++){
                b[j]=((j+1)%2)+1;
            }
        }
        else{
            for(int j=1;j<=n;j++){
                b[j]=(j%2)+1;
            }
        }
        cout<<calc()<<'\n';
        return;
    }
    for(int j=1;j<=n;j++){
        b[j]=(j%2)+1;
    }
    int ans=calc();
    for(int j=1;j<=n;j++){
        b[j]=((j+1)%2)+1;
    }
    ans=min(ans,calc());
    cout<<ans<<'\n';


    
}



/*

*/
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int t2=1;
    // cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -