oj.uz

답안 #136909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136909 2019-07-26T14:00:01 Z ekrem Growing Vegetable is Fun 3 (JOI19_ho_t3) C++
100 / 100
 268 ms 169208 KB 
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define coc g[node][i]
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)>>1)
#define mod 1000000007
#define inf 1000000009
#define N 410

using namespace std;

typedef long long ll;
typedef pair < int , int > ii;

int n, ans, a[N], say[5], dp[N/2][N/2][N/2][5], pre[N][5], yer[5][N];
map < char , int > h;

int f(int r, int g, int y, int lst){
	if(r < 0 or g < 0 or y < 0)
		return inf;
	if(r + g + y == 0)
		return 0;
	int &ans = dp[r][g][y][lst];
	if(ans != -1)
		return ans;
	ans = inf;
	if(lst == 1){//r yapcan
		int ind = yer[1][r];
		int rr = min(r, pre[ind][1]);
		int gg = min(g, pre[ind][2]);
		int yy = min(y, pre[ind][3]);
		int of = max(0, ind - rr - gg - yy);
		ans = min(ans, f(r - 1, g, y, 2) + of);
		ans = min(ans, f(r - 1, g, y, 3) + of);
	}
	if(lst == 2){//g yapcan
		int ind = yer[2][g];
		int rr = min(r, pre[ind][1]);
		int gg = min(g, pre[ind][2]);
		int yy = min(y, pre[ind][3]);
		int of = max(0, ind - rr - gg - yy);
		ans = min(ans, f(r, g - 1, y, 1) + of);
		ans = min(ans, f(r, g - 1, y, 3) + of);
		// cout << ind << " " << rr << " " << gg << " " << yy << " -> ";
	}
	if(lst == 3){//y yapcan
		int ind = yer[3][y];
		int rr = min(r, pre[ind][1]);
		int gg = min(g, pre[ind][2]);
		int yy = min(y, pre[ind][3]);
		int of = max(0, ind - rr - gg - yy);
		ans = min(ans, f(r, g, y - 1, 1) + of);
		ans = min(ans, f(r, g, y - 1, 2) + of);
		// cout << ind << " " << rr << " " << gg << " " << yy << " -> ";
	}
	// cout << r << " " << g << " " << y << " " << lst << " = " <<  ans << endl;
	return ans;
}

int main(){
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	memset(dp, -1, sizeof dp);
	h['R'] = 1;
	h['G'] = 2;
	h['Y'] = 3;
	scanf("%d",&n);
	for(int i = 1; i <= n; i++){
		char x;
		scanf(" %c",&x);
		a[i] = h[x];	
		say[a[i]]++;
		yer[a[i]][say[a[i]]] = i;
		for(int j = 1; j <= 3; j++)
			pre[i][j] = pre[i - 1][j] + (a[i] == j);
	}
	if(max(max(say[2], say[3]),say[1]) > n/2 + 3 ){
		printf("-1\n");
		return 0;
	}
	ans = min(min(f(say[1], say[2], say[3], 1), f(say[1], say[2], say[3], 2)), f(say[1], say[2], say[3], 3));
	if(ans >= inf)
		printf("-1\n");
	else
		printf("%d\n", ans);
	return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
joi2019_ho_t3.cpp:75:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c",&x);
   ~~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 168992 KB Output is correct
2 Correct 146 ms 168952 KB Output is correct
3 Correct 143 ms 168952 KB Output is correct
4 Correct 143 ms 168952 KB Output is correct
5 Correct 144 ms 169024 KB Output is correct
6 Correct 146 ms 169080 KB Output is correct
7 Correct 148 ms 168804 KB Output is correct
8 Correct 144 ms 168908 KB Output is correct
9 Correct 143 ms 168952 KB Output is correct
10 Correct 144 ms 168952 KB Output is correct
11 Correct 143 ms 169064 KB Output is correct
12 Correct 144 ms 168952 KB Output is correct
13 Correct 143 ms 168936 KB Output is correct
14 Correct 145 ms 169020 KB Output is correct
15 Correct 156 ms 168976 KB Output is correct
16 Correct 143 ms 168952 KB Output is correct
17 Correct 143 ms 168952 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 168992 KB Output is correct
2 Correct 146 ms 168952 KB Output is correct
3 Correct 143 ms 168952 KB Output is correct
4 Correct 143 ms 168952 KB Output is correct
5 Correct 144 ms 169024 KB Output is correct
6 Correct 146 ms 169080 KB Output is correct
7 Correct 148 ms 168804 KB Output is correct
8 Correct 144 ms 168908 KB Output is correct
9 Correct 143 ms 168952 KB Output is correct
10 Correct 144 ms 168952 KB Output is correct
11 Correct 143 ms 169064 KB Output is correct
12 Correct 144 ms 168952 KB Output is correct
13 Correct 143 ms 168936 KB Output is correct
14 Correct 145 ms 169020 KB Output is correct
15 Correct 156 ms 168976 KB Output is correct
16 Correct 143 ms 168952 KB Output is correct
17 Correct 143 ms 168952 KB Output is correct
18 Correct 145 ms 168960 KB Output is correct
19 Correct 144 ms 168960 KB Output is correct
20 Correct 144 ms 168888 KB Output is correct
21 Correct 143 ms 168900 KB Output is correct
22 Correct 144 ms 168988 KB Output is correct
23 Correct 145 ms 168924 KB Output is correct
24 Correct 145 ms 168952 KB Output is correct
25 Correct 145 ms 168872 KB Output is correct
26 Correct 143 ms 168952 KB Output is correct
27 Correct 145 ms 168904 KB Output is correct
28 Correct 157 ms 168892 KB Output is correct
29 Correct 144 ms 169048 KB Output is correct
30 Correct 168 ms 169080 KB Output is correct
31 Correct 186 ms 169080 KB Output is correct
32 Correct 146 ms 168948 KB Output is correct
33 Correct 143 ms 168888 KB Output is correct
34 Correct 143 ms 168952 KB Output is correct
35 Correct 145 ms 169104 KB Output is correct
36 Correct 143 ms 168952 KB Output is correct
37 Correct 144 ms 168996 KB Output is correct
38 Correct 144 ms 168996 KB Output is correct
39 Correct 144 ms 168952 KB Output is correct
40 Correct 144 ms 168928 KB Output is correct
41 Correct 145 ms 168952 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 168976 KB Output is correct
2 Correct 144 ms 168960 KB Output is correct
3 Correct 144 ms 169104 KB Output is correct
4 Correct 143 ms 168924 KB Output is correct
5 Correct 143 ms 169000 KB Output is correct
6 Correct 143 ms 168920 KB Output is correct
7 Correct 143 ms 168924 KB Output is correct
8 Correct 143 ms 169052 KB Output is correct
9 Correct 145 ms 169052 KB Output is correct
10 Correct 143 ms 169080 KB Output is correct
11 Correct 143 ms 168924 KB Output is correct
12 Correct 145 ms 168992 KB Output is correct
13 Correct 143 ms 168968 KB Output is correct
14 Correct 143 ms 169072 KB Output is correct
15 Correct 144 ms 168944 KB Output is correct
16 Correct 146 ms 168904 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 168992 KB Output is correct
2 Correct 146 ms 168952 KB Output is correct
3 Correct 143 ms 168952 KB Output is correct
4 Correct 143 ms 168952 KB Output is correct
5 Correct 144 ms 169024 KB Output is correct
6 Correct 146 ms 169080 KB Output is correct
7 Correct 148 ms 168804 KB Output is correct
8 Correct 144 ms 168908 KB Output is correct
9 Correct 143 ms 168952 KB Output is correct
10 Correct 144 ms 168952 KB Output is correct
11 Correct 143 ms 169064 KB Output is correct
12 Correct 144 ms 168952 KB Output is correct
13 Correct 143 ms 168936 KB Output is correct
14 Correct 145 ms 169020 KB Output is correct
15 Correct 156 ms 168976 KB Output is correct
16 Correct 143 ms 168952 KB Output is correct
17 Correct 143 ms 168952 KB Output is correct
18 Correct 145 ms 168960 KB Output is correct
19 Correct 144 ms 168960 KB Output is correct
20 Correct 144 ms 168888 KB Output is correct
21 Correct 143 ms 168900 KB Output is correct
22 Correct 144 ms 168988 KB Output is correct
23 Correct 145 ms 168924 KB Output is correct
24 Correct 145 ms 168952 KB Output is correct
25 Correct 145 ms 168872 KB Output is correct
26 Correct 143 ms 168952 KB Output is correct
27 Correct 145 ms 168904 KB Output is correct
28 Correct 157 ms 168892 KB Output is correct
29 Correct 144 ms 169048 KB Output is correct
30 Correct 168 ms 169080 KB Output is correct
31 Correct 186 ms 169080 KB Output is correct
32 Correct 146 ms 168948 KB Output is correct
33 Correct 143 ms 168888 KB Output is correct
34 Correct 143 ms 168952 KB Output is correct
35 Correct 145 ms 169104 KB Output is correct
36 Correct 143 ms 168952 KB Output is correct
37 Correct 144 ms 168996 KB Output is correct
38 Correct 144 ms 168996 KB Output is correct
39 Correct 144 ms 168952 KB Output is correct
40 Correct 144 ms 168928 KB Output is correct
41 Correct 145 ms 168952 KB Output is correct
42 Correct 143 ms 168976 KB Output is correct
43 Correct 144 ms 168960 KB Output is correct
44 Correct 144 ms 169104 KB Output is correct
45 Correct 143 ms 168924 KB Output is correct
46 Correct 143 ms 169000 KB Output is correct
47 Correct 143 ms 168920 KB Output is correct
48 Correct 143 ms 168924 KB Output is correct
49 Correct 143 ms 169052 KB Output is correct
50 Correct 145 ms 169052 KB Output is correct
51 Correct 143 ms 169080 KB Output is correct
52 Correct 143 ms 168924 KB Output is correct
53 Correct 145 ms 168992 KB Output is correct
54 Correct 143 ms 168968 KB Output is correct
55 Correct 143 ms 169072 KB Output is correct
56 Correct 144 ms 168944 KB Output is correct
57 Correct 146 ms 168904 KB Output is correct
58 Correct 259 ms 169016 KB Output is correct
59 Correct 258 ms 168952 KB Output is correct
60 Correct 265 ms 168952 KB Output is correct
61 Correct 253 ms 169208 KB Output is correct
62 Correct 145 ms 168960 KB Output is correct
63 Correct 144 ms 168952 KB Output is correct
64 Correct 161 ms 168996 KB Output is correct
65 Correct 183 ms 169120 KB Output is correct
66 Correct 252 ms 169080 KB Output is correct
67 Correct 248 ms 168968 KB Output is correct
68 Correct 255 ms 169080 KB Output is correct
69 Correct 268 ms 169036 KB Output is correct
70 Correct 263 ms 169016 KB Output is correct
71 Correct 247 ms 169080 KB Output is correct
72 Correct 145 ms 168948 KB Output is correct
73 Correct 143 ms 168952 KB Output is correct