oj.uz

Submission #227554

# Submission time Handle Problem Language Result Execution time Memory
227554 2020-04-27T19:34:42 Z MohamedAhmed04 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 197 ms 93816 KB 
#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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 6 ms 2560 KB Output is correct
19 Correct 6 ms 2176 KB Output is correct
20 Correct 6 ms 2560 KB Output is correct
21 Correct 6 ms 2816 KB Output is correct
22 Correct 6 ms 1920 KB Output is correct
23 Correct 6 ms 2432 KB Output is correct
24 Correct 5 ms 1792 KB Output is correct
25 Correct 5 ms 1024 KB Output is correct
26 Correct 5 ms 1280 KB Output is correct
27 Correct 6 ms 2688 KB Output is correct
28 Correct 6 ms 2816 KB Output is correct
29 Correct 6 ms 2560 KB Output is correct
30 Correct 6 ms 2560 KB Output is correct
31 Correct 6 ms 2304 KB Output is correct
32 Correct 6 ms 2688 KB Output is correct
33 Correct 5 ms 1408 KB Output is correct
34 Correct 5 ms 1664 KB Output is correct
35 Correct 6 ms 2688 KB Output is correct
36 Correct 6 ms 2176 KB Output is correct
37 Correct 6 ms 1920 KB Output is correct
38 Correct 6 ms 2304 KB Output is correct
39 Correct 6 ms 2560 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 1024 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 7 ms 4608 KB Output is correct
3 Correct 7 ms 4608 KB Output is correct
4 Correct 7 ms 4608 KB Output is correct
5 Correct 7 ms 4608 KB Output is correct
6 Correct 8 ms 4736 KB Output is correct
7 Correct 7 ms 4608 KB Output is correct
8 Correct 7 ms 4608 KB Output is correct
9 Correct 7 ms 4608 KB Output is correct
10 Correct 7 ms 4608 KB Output is correct
11 Correct 7 ms 4608 KB Output is correct
12 Correct 5 ms 2560 KB Output is correct
13 Correct 6 ms 3328 KB Output is correct
14 Correct 6 ms 3840 KB Output is correct
15 Correct 7 ms 4608 KB Output is correct
16 Correct 7 ms 4608 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 6 ms 2560 KB Output is correct
19 Correct 6 ms 2176 KB Output is correct
20 Correct 6 ms 2560 KB Output is correct
21 Correct 6 ms 2816 KB Output is correct
22 Correct 6 ms 1920 KB Output is correct
23 Correct 6 ms 2432 KB Output is correct
24 Correct 5 ms 1792 KB Output is correct
25 Correct 5 ms 1024 KB Output is correct
26 Correct 5 ms 1280 KB Output is correct
27 Correct 6 ms 2688 KB Output is correct
28 Correct 6 ms 2816 KB Output is correct
29 Correct 6 ms 2560 KB Output is correct
30 Correct 6 ms 2560 KB Output is correct
31 Correct 6 ms 2304 KB Output is correct
32 Correct 6 ms 2688 KB Output is correct
33 Correct 5 ms 1408 KB Output is correct
34 Correct 5 ms 1664 KB Output is correct
35 Correct 6 ms 2688 KB Output is correct
36 Correct 6 ms 2176 KB Output is correct
37 Correct 6 ms 1920 KB Output is correct
38 Correct 6 ms 2304 KB Output is correct
39 Correct 6 ms 2560 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 1024 KB Output is correct
42 Correct 4 ms 384 KB Output is correct
43 Correct 7 ms 4608 KB Output is correct
44 Correct 7 ms 4608 KB Output is correct
45 Correct 7 ms 4608 KB Output is correct
46 Correct 7 ms 4608 KB Output is correct
47 Correct 8 ms 4736 KB Output is correct
48 Correct 7 ms 4608 KB Output is correct
49 Correct 7 ms 4608 KB Output is correct
50 Correct 7 ms 4608 KB Output is correct
51 Correct 7 ms 4608 KB Output is correct
52 Correct 7 ms 4608 KB Output is correct
53 Correct 5 ms 2560 KB Output is correct
54 Correct 6 ms 3328 KB Output is correct
55 Correct 6 ms 3840 KB Output is correct
56 Correct 7 ms 4608 KB Output is correct
57 Correct 7 ms 4608 KB Output is correct
58 Correct 183 ms 75900 KB Output is correct
59 Correct 183 ms 93816 KB Output is correct
60 Correct 184 ms 87160 KB Output is correct
61 Correct 192 ms 84552 KB Output is correct
62 Correct 11 ms 11008 KB Output is correct
63 Correct 16 ms 18944 KB Output is correct
64 Correct 58 ms 56952 KB Output is correct
65 Correct 96 ms 78584 KB Output is correct
66 Correct 178 ms 85752 KB Output is correct
67 Correct 174 ms 82040 KB Output is correct
68 Correct 182 ms 88184 KB Output is correct
69 Correct 182 ms 85112 KB Output is correct
70 Correct 193 ms 91256 KB Output is correct
71 Correct 197 ms 83168 KB Output is correct
72 Correct 16 ms 12416 KB Output is correct
73 Correct 6 ms 2944 KB Output is correct