oj.uz

답안 #978944

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978944 2024-05-10T04:09:21 Z irmuun Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
20 / 100
 500 ms 504 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int dist(string s,string t){//t->s
    int res=0;
    for(int i=0;i<s.size();i++){
        for(int j=i;j<t.size();j++){
            if(t[j]==s[i]){
                for(int k=j-1;k>=i;k--){
                    res++;
                    swap(t[k],t[k+1]);
                }
                break;
            }
        }
    }
    return res;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n;
    cin>>n;
    string s;
    cin>>s;
    string t=s;
    sort(all(t));
    if(t.back()!='Y'){
        int r=0,g=0;
        for(int i=0;i<n;i++){
            if(s[i]=='R') r++;
            else g++;
        }
        if(abs(r-g)>1){
            cout<<-1;
            return 0;
        }
        string a="",b="";
        for(int i=0;i<min(r,g);i++){
            a+='R';
            a+='G';
            b+='G';
            b+='R';
        }
        if(r==g){
            cout<<min(dist(a,s),dist(b,s));
        }
        if(r==g+1){
            a+='R';
            cout<<dist(a,s);
        }
        if(g==r+1){
            b+='G';
            cout<<dist(b,s);
        }
        return 0;
    }
    int ans=1e9;
    do{
        bool ok=true;
        for(int i=1;i<n;i++){
            if(t[i-1]==t[i]){
                ok=false;
            }
        }
        if(!ok) continue;
        ans=min(ans,dist(t,s));
    }while(next_permutation(all(t)));
    if(ans==1e9) ans=-1;
    cout<<ans;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int dist(std::string, std::string)':
joi2019_ho_t3.cpp:14:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for(int i=0;i<s.size();i++){
      |                 ~^~~~~~~~~
joi2019_ho_t3.cpp:15:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         for(int j=i;j<t.size();j++){
      |                     ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 5 ms 448 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 14 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 10 ms 452 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 5 ms 448 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 14 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 10 ms 452 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Execution timed out 1006 ms 344 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 5 ms 448 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 14 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 10 ms 452 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Execution timed out 1006 ms 344 KB Time limit exceeded
19 Halted 0 ms 0 KB -