oj.uz

답안 #704096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
704096 2023-03-01T14:51:03 Z 1075508020060209tc Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
15 / 100
 6 ms 8252 KB 
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
#define pr rr
int lowbit(int x){return x&-x;}
int bit[500005];
void upd(int pl,int v){
while(pl<=500000){
    bit[pl]+=v;
    pl+=lowbit(pl);
}
}
int qsum(int x){
int ret=0;
while(x){
    ret+=bit[x];
    x-=lowbit(x);
}
return ret;
}

vector<int>rr;
vector<int>gr;
vector<int>yr;


int n;
string s;




signed main(){
cin>>n>>s;
s="*"+s;
for(int i=1;i<=n;i++){
    if(s[i]=='R'){
        pr.push_back(i);
    }
    if(s[i]=='G'){
        gr.push_back(i);
    }
}
if(pr.size()>=gr.size()+2){
    cout<<-1<<endl;
    return 0;
}
if(gr.size()>=pr.size()+2){
    cout<<-1<<endl;
    return 0;
}
int fans=1e16;
if(gr.size()>=pr.size()){
    int ans=0;
    for(int i=1;i<=n;i++){
        if(i%2==1){
            int pl=gr[(i+1)/2-1];
            ans+=pl-i+qsum(n)-qsum(pl);
            upd(pl,1);
        }else{
            int pl=pr[i/2-1];
            ans+=pl-i+qsum(n)-qsum(pl);
            upd(pl,1);
        }
    }
    fans=ans;
}
for(int i=1;i<=500000;i++){bit[i]=0;}
if(gr.size()<=pr.size()){
    int ans=0;
    for(int i=1;i<=n;i++){
         //   cout<<i<<endl;
        if(i%2==0){
            int pl=gr[(i+1)/2-1];
            ans+=pl-i+qsum(n)-qsum(pl);
            upd(pl,1);
        }else{
            int pl=pr[(i+1)/2-1];
            ans+=pl-i+qsum(n)-qsum(pl);
            upd(pl,1);
        }
    }
    fans=min(fans,ans);
}
cout<<fans;

}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Runtime error 6 ms 8252 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Runtime error 6 ms 8252 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4148 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 3 ms 4228 KB Output is correct
11 Correct 2 ms 4144 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 2 ms 4180 KB Output is correct
14 Correct 2 ms 4180 KB Output is correct
15 Correct 0 ms 308 KB Output is correct
16 Correct 1 ms 212 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Runtime error 6 ms 8252 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -