답안 #963397

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963397	2024-04-14T23:56:20 Z	Saul0906	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	15 / 100	2 ms	600 KB

joi2019_ho_t3

#include <bits/stdc++.h>
#define ll long long
#define rep(a,b,c) for(ll a=b; a<c; a++)
#define repr(a,b,c) for(ll a=b-1; a>c-1; a--)
#define pq_min(a) priority_queue<a, vector<a>, greater<a>>

using namespace std;

int n;
string s, s2;
int mn=1e9;

void solve(int k, int r, int y, int g, int l){
	if(y<0 || g<0 || r<0) return;
	if(!l) s2[k-1]='R';
	else if(l&1) s2[k-1]='Y';
	else s2[k-1]='G';
	if(k==n){
		int sum=0;
		pq_min(int) R, G, Y;
		rep(i,0,n){
			if(s[i]=='R') R.push(i);
			if(s[i]=='Y') Y.push(i);
			if(s[i]=='G') G.push(i);
		}
		rep(i,0,n){
			int b=0;
			if(s2[i]=='R') b=R.top(), R.pop();
			if(s2[i]=='Y') b=Y.top(), Y.pop();
			if(s2[i]=='G') b=G.top(), G.pop();
			sum+=max(0ll,(b-i));
		}
		mn=min(mn,sum);
		return;
	}
	if(!l) solve(k+1,r,y-1,g,1), solve(k+1,r,y,g-1,2);
	else if(l&1) solve(k+1,r-1,y,g,0), solve(k+1,r,y,g-1,2);
	else solve(k+1,r,y-1,g,1), solve(k+1,r-1,y,g,0);
}

int main(){
	cin>>n>>s;
	int r=0, g=0, y=0;
	rep(i,0,n){
		if(s[i]=='R') r++;
		if(s[i]=='G') g++;
		if(s[i]=='Y') y++;
	}
	s2=s;
	solve(1,r-1,y,g,0);
	solve(1,r,y-1,g,1);
	solve(1,r,y,g-1,2);
	if(n==1) mn=0;
	if(mn<1e9) cout<<mn<<endl;
	else cout<<-1<<endl;
}

Subtask #1

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	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	2 ms	544 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Incorrect	1 ms	348 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

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	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	2 ms	544 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Incorrect	1 ms	348 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	600 KB	Output is correct
7	Correct	1 ms	344 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	504 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 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	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	2 ms	544 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Incorrect	1 ms	348 KB	Output isn't correct
12	Halted	0 ms	0 KB	-