제출 #227554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
227554		MohamedAhmed04	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	100 / 100	197 ms	93816 KiB

joi2019_ho_t3

#include <bits/stdc++.h>

using namespace std ;

const short inf = 32767 ;
const short MAX = 401 ;

string s ;
short dp[MAX][MAX][MAX][3] , vis[MAX][MAX][MAX][3] , cnt[3][MAX] , occ[3][MAX] ;
short n ;

short solve(short idx , short cnt1 , short cnt2 , short cnt3 , short prv)
{
	if(idx == n)
		return 0 ;
	short &ret = dp[cnt1][cnt2][cnt3][prv] ;
	if(vis[cnt1][cnt2][cnt3][prv])
		return ret ;
	vis[cnt1][cnt2][cnt3][prv] = 1 ;
	ret = inf ;
	for(int i = 0 ; i <= 2 ; ++i)
	{
		if(i == prv && idx != 0)
			continue ;
		short to = -1 ;
		if(i == 0)
			to = occ[0][cnt1] ;
		if(i == 1)
			to = occ[1][cnt2] ;
		if(i == 2)
			to = occ[2][cnt3] ;
		if(to == -1)
			continue ;
		short cost = max(0 , cnt[0][to] - cnt1) + max(0 , cnt[1][to] - cnt2) + max(0 , cnt[2][to] - cnt3) , now ;
		if(i == 0)
			now = solve(idx+1 , cnt1+1 , cnt2 , cnt3 , i) ;
		if(i == 1)
			now = solve(idx+1 , cnt1 , cnt2+1 , cnt3 , i) ;
		if(i == 2)
			now = solve(idx+1 , cnt1 , cnt2 , cnt3+1 , i) ;
		if(cost > inf-now)
			continue ;
		now += cost ;
		ret = min(ret , now) ;
	}
	return ret ;
}

int main()
{
	memset(occ , -1 , sizeof(occ)) ;
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	cin>>s ;
	short cnt1 = 0 , cnt2 = 0 , cnt3 = 0 ;
	for(int i = 0 ; i < n ; ++i)
	{
		cnt[0][i] = cnt1 , cnt[1][i] = cnt2 , cnt[2][i] = cnt3 ;
		if(s[i] == 'R')
			occ[0][cnt1++] = i ;
		else if(s[i] == 'G')
			occ[1][cnt2++] = i ;
		else
			occ[2][cnt3++] = i ;
	}
	short ans = solve(0 , 0 , 0 , 0 , 0) ;
	if(ans >= inf)
		ans = -1 ;
	return cout<<ans<<"\n" , 0 ;
}		

• Subtask 1: 5 / 5
• Subtask 2: 55 / 55
• Subtask 3: 15 / 15
• Subtask 4: 25 / 25