oj.uz

Submission #1107454

# Submission time Handle Problem Language Result Execution time Memory
1107454 2024-11-01T09:08:08 Z vjudge1 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
5 / 100
 500 ms 504 KB 
/**
 *    hello
 *    author:  N29
 *    created: 2024-11-01 12:38:08
**/
#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=410;
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];
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;
        b[i]=a[i];
        c[i]=a[i];
    }
    sort(b+1,b+n+1);
    int ans=INF;
    while(1ll){
        for(int i=1;i<=n;i++){
            c[i]=a[i];
        }
        int res=0;
        for(int i=1;i<=n;i++){
            if(b[i]==b[i-1])res=INF;
            if(b[i]!=c[i]){
                int pos=-1;
                for(int j=i;j<=n;j++){
                    if(b[i]==c[j]){
                        pos=j;
                        break;
                    }
                }
                assert(pos!=-1);
                res+=abs(pos-i);
                for(int j=pos;j>i;j--){
                    swap(c[j],c[j-1]);
                }
            }
        }
        ans=min(ans,res);
        next_permutation(b+1,b+n+1);
        if(is_sorted(b+1,b+n+1))break;
    }
    if(ans==INF){
        ans=-1;
    }
    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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 26 ms 504 KB Output is correct
6 Correct 54 ms 504 KB Output is correct
7 Correct 29 ms 336 KB Output is correct
8 Correct 43 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 29 ms 336 KB Output is correct
12 Correct 54 ms 336 KB Output is correct
13 Correct 8 ms 336 KB Output is correct
14 Correct 12 ms 336 KB Output is correct
15 Correct 36 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 26 ms 504 KB Output is correct
6 Correct 54 ms 504 KB Output is correct
7 Correct 29 ms 336 KB Output is correct
8 Correct 43 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 29 ms 336 KB Output is correct
12 Correct 54 ms 336 KB Output is correct
13 Correct 8 ms 336 KB Output is correct
14 Correct 12 ms 336 KB Output is correct
15 Correct 36 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Execution timed out 1039 ms 336 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Execution timed out 1090 ms 384 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 26 ms 504 KB Output is correct
6 Correct 54 ms 504 KB Output is correct
7 Correct 29 ms 336 KB Output is correct
8 Correct 43 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 29 ms 336 KB Output is correct
12 Correct 54 ms 336 KB Output is correct
13 Correct 8 ms 336 KB Output is correct
14 Correct 12 ms 336 KB Output is correct
15 Correct 36 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Execution timed out 1039 ms 336 KB Time limit exceeded
19 Halted 0 ms 0 KB -