답안 #227548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
227548 2020-04-27T19:19:25 Z MohamedAhmed04 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
60 / 100
9 ms 3840 KB
#include <bits/stdc++.h>

using namespace std ;

const short inf = 8192 ;
const int MAX = 400 + 5 ;

string s ;
vector< vector< vector< vector<short> > > >dp ;
short cnt[3][MAX] , occ[3][MAX] ;
int n ;

short solve(int idx , int cnt1 , int cnt2 , int cnt3 , int prv)
{
	if(idx == n)
		return 0 ;
	short &ret = dp[cnt1][cnt2][cnt3][prv] ;
	if(ret != -1)
		return ret ;
	ret = inf ;
	for(int i = 0 ; i <= 2 ; ++i)
	{
		if(i == prv && idx != 0)
			continue ;
		int 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) + cost ;
		if(i == 1)
			now = solve(idx+1 , cnt1 , cnt2+1 , cnt3 , i) + cost ;
		if(i == 2)
			now = solve(idx+1 , cnt1 , cnt2 , cnt3+1 , i) + 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 ;
	}
	dp = vector<vector<vector<vector<short>>>>(cnt1+1, vector<vector<vector<short>>>(cnt2+1, vector<vector<short>>(cnt3+1, vector<short>(3,-1)))) ;
	short ans = solve(0 , 0 , 0 , 0 , 0) ;
	if(ans >= inf)
		ans = -1 ;
	return cout<<ans<<"\n" , 0 ;
}		
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 304 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 304 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 896 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 6 ms 896 KB Output is correct
21 Correct 5 ms 896 KB Output is correct
22 Correct 5 ms 768 KB Output is correct
23 Correct 5 ms 896 KB Output is correct
24 Correct 5 ms 768 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 768 KB Output is correct
28 Correct 5 ms 896 KB Output is correct
29 Correct 6 ms 896 KB Output is correct
30 Correct 6 ms 896 KB Output is correct
31 Correct 5 ms 896 KB Output is correct
32 Correct 6 ms 896 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 5 ms 640 KB Output is correct
35 Correct 5 ms 768 KB Output is correct
36 Correct 5 ms 896 KB Output is correct
37 Correct 5 ms 768 KB Output is correct
38 Correct 5 ms 896 KB Output is correct
39 Correct 6 ms 896 KB Output is correct
40 Correct 4 ms 384 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 9 ms 3840 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 304 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 896 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 6 ms 896 KB Output is correct
21 Correct 5 ms 896 KB Output is correct
22 Correct 5 ms 768 KB Output is correct
23 Correct 5 ms 896 KB Output is correct
24 Correct 5 ms 768 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 768 KB Output is correct
28 Correct 5 ms 896 KB Output is correct
29 Correct 6 ms 896 KB Output is correct
30 Correct 6 ms 896 KB Output is correct
31 Correct 5 ms 896 KB Output is correct
32 Correct 6 ms 896 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 5 ms 640 KB Output is correct
35 Correct 5 ms 768 KB Output is correct
36 Correct 5 ms 896 KB Output is correct
37 Correct 5 ms 768 KB Output is correct
38 Correct 5 ms 896 KB Output is correct
39 Correct 6 ms 896 KB Output is correct
40 Correct 4 ms 384 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Incorrect 9 ms 3840 KB Output isn't correct
44 Halted 0 ms 0 KB -