oj.uz

Submission #209210

# Submission time Handle Problem Language Result Execution time Memory
209210 2020-03-13T12:25:55 Z kostia244 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
60 / 100
 500 ms 780664 KB 
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair<ll, ll>;
const int maxn = 405;
void minq(int &a, int b) {
	if(a > b) a = b;
}
int dp[maxn][maxn][maxn][3];
int n;
string s;
vi p[3];
int id(char c) {
	if(c=='R') return 0;
	if(c=='G') return 1;
	return 2;
}
int cost(int i, int j, int k, int l, int w) {
	if(l == w) return 1<<20;
	int c, n1, n2;
	if(w==0) {
		c = 0;
		n1 = 1;
		n2 = 2;
	}
	if(w==1) {// i, j, k => j i k
		swap(i, j);
		c = 1;
		n1 = 0;
		n2 = 2;
	}
	if(w==2) {// i, j, k => k, j, i
		swap(i, k);
		c = 2;
		n1 = 1;
		n2 = 0;
	}
	if(p[c].size()<=i) return 1<<20;
	int ans = p[c][i] - i;
	int t, z;
	for(t = 0, z = 1<<9; z>>=1;)
		if(t+z<p[n1].size()&&p[n1][t+z]<p[c][i]) t+=z;
	if(p[n1].size()&&p[n1][0]<p[c][i])
		ans -= min(t+1, j);
	for(t = 0, z = 1<<9; z>>=1;)
		if(t+z<p[n2].size()&&p[n2][t+z]<p[c][i]) t+=z;
	if(p[n2].size()&&p[n2][0]<p[c][i])
		ans -= min(t+1, k);
	return ans;
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> s;
	for(int i = 0; i < n; i++) p[id(s[i])].pb(i);
	memset(dp, 0x3f, sizeof dp);
	dp[0][0][0][0] = dp[0][0][0][1] = dp[0][0][0][2] = 0;
	int ans = 1<<30;
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= n; j++) {
			for(int k = 0; k <= n; k++) {
				for(int l = 0; l < 3; l++) {
					if(i+j+k==n) ans = min(ans, dp[i][j][k][l]);
					if(dp[i][j][k][l]>n*n) continue;
					minq(dp[i+1][j][k][0], dp[i][j][k][l] + cost(i, j, k, l, 0));
					minq(dp[i][j+1][k][1], dp[i][j][k][l] + cost(i, j, k, l, 1));
					minq(dp[i][j][k+1][2], dp[i][j][k][l] + cost(i, j, k, l, 2));
				}
			}
		}
	}
	if(ans>n*n) ans = -1;
	cout << ans;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int cost(int, int, int, int, int)':
joi2019_ho_t3.cpp:41:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(p[c].size()<=i) return 1<<20;
     ~~~~~~~~~~~^~~
joi2019_ho_t3.cpp:45:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(t+z<p[n1].size()&&p[n1][t+z]<p[c][i]) t+=z;
      ~~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:49:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(t+z<p[n2].size()&&p[n2][t+z]<p[c][i]) t+=z;
      ~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 780280 KB Output is correct
2 Correct 415 ms 780408 KB Output is correct
3 Correct 406 ms 780352 KB Output is correct
4 Correct 396 ms 780280 KB Output is correct
5 Correct 417 ms 780280 KB Output is correct
6 Correct 403 ms 780408 KB Output is correct
7 Correct 423 ms 780408 KB Output is correct
8 Correct 399 ms 780408 KB Output is correct
9 Correct 410 ms 780664 KB Output is correct
10 Correct 402 ms 780280 KB Output is correct
11 Correct 415 ms 780408 KB Output is correct
12 Correct 405 ms 780408 KB Output is correct
13 Correct 422 ms 780408 KB Output is correct
14 Correct 400 ms 780280 KB Output is correct
15 Correct 406 ms 780408 KB Output is correct
16 Correct 405 ms 780280 KB Output is correct
17 Correct 412 ms 780280 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 780280 KB Output is correct
2 Correct 415 ms 780408 KB Output is correct
3 Correct 406 ms 780352 KB Output is correct
4 Correct 396 ms 780280 KB Output is correct
5 Correct 417 ms 780280 KB Output is correct
6 Correct 403 ms 780408 KB Output is correct
7 Correct 423 ms 780408 KB Output is correct
8 Correct 399 ms 780408 KB Output is correct
9 Correct 410 ms 780664 KB Output is correct
10 Correct 402 ms 780280 KB Output is correct
11 Correct 415 ms 780408 KB Output is correct
12 Correct 405 ms 780408 KB Output is correct
13 Correct 422 ms 780408 KB Output is correct
14 Correct 400 ms 780280 KB Output is correct
15 Correct 406 ms 780408 KB Output is correct
16 Correct 405 ms 780280 KB Output is correct
17 Correct 412 ms 780280 KB Output is correct
18 Correct 410 ms 780336 KB Output is correct
19 Correct 414 ms 780536 KB Output is correct
20 Correct 403 ms 780408 KB Output is correct
21 Correct 406 ms 780408 KB Output is correct
22 Correct 409 ms 780408 KB Output is correct
23 Correct 413 ms 780408 KB Output is correct
24 Correct 404 ms 780280 KB Output is correct
25 Correct 399 ms 780280 KB Output is correct
26 Correct 397 ms 780280 KB Output is correct
27 Correct 401 ms 780408 KB Output is correct
28 Correct 405 ms 780280 KB Output is correct
29 Correct 405 ms 780408 KB Output is correct
30 Correct 405 ms 780408 KB Output is correct
31 Correct 404 ms 780280 KB Output is correct
32 Correct 410 ms 780364 KB Output is correct
33 Correct 411 ms 780284 KB Output is correct
34 Correct 403 ms 780408 KB Output is correct
35 Correct 413 ms 780280 KB Output is correct
36 Correct 410 ms 780536 KB Output is correct
37 Correct 404 ms 780284 KB Output is correct
38 Correct 410 ms 780456 KB Output is correct
39 Correct 401 ms 780280 KB Output is correct
40 Correct 404 ms 780536 KB Output is correct
41 Correct 407 ms 780280 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 411 ms 780412 KB Output is correct
2 Execution timed out 736 ms 780280 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 780280 KB Output is correct
2 Correct 415 ms 780408 KB Output is correct
3 Correct 406 ms 780352 KB Output is correct
4 Correct 396 ms 780280 KB Output is correct
5 Correct 417 ms 780280 KB Output is correct
6 Correct 403 ms 780408 KB Output is correct
7 Correct 423 ms 780408 KB Output is correct
8 Correct 399 ms 780408 KB Output is correct
9 Correct 410 ms 780664 KB Output is correct
10 Correct 402 ms 780280 KB Output is correct
11 Correct 415 ms 780408 KB Output is correct
12 Correct 405 ms 780408 KB Output is correct
13 Correct 422 ms 780408 KB Output is correct
14 Correct 400 ms 780280 KB Output is correct
15 Correct 406 ms 780408 KB Output is correct
16 Correct 405 ms 780280 KB Output is correct
17 Correct 412 ms 780280 KB Output is correct
18 Correct 410 ms 780336 KB Output is correct
19 Correct 414 ms 780536 KB Output is correct
20 Correct 403 ms 780408 KB Output is correct
21 Correct 406 ms 780408 KB Output is correct
22 Correct 409 ms 780408 KB Output is correct
23 Correct 413 ms 780408 KB Output is correct
24 Correct 404 ms 780280 KB Output is correct
25 Correct 399 ms 780280 KB Output is correct
26 Correct 397 ms 780280 KB Output is correct
27 Correct 401 ms 780408 KB Output is correct
28 Correct 405 ms 780280 KB Output is correct
29 Correct 405 ms 780408 KB Output is correct
30 Correct 405 ms 780408 KB Output is correct
31 Correct 404 ms 780280 KB Output is correct
32 Correct 410 ms 780364 KB Output is correct
33 Correct 411 ms 780284 KB Output is correct
34 Correct 403 ms 780408 KB Output is correct
35 Correct 413 ms 780280 KB Output is correct
36 Correct 410 ms 780536 KB Output is correct
37 Correct 404 ms 780284 KB Output is correct
38 Correct 410 ms 780456 KB Output is correct
39 Correct 401 ms 780280 KB Output is correct
40 Correct 404 ms 780536 KB Output is correct
41 Correct 407 ms 780280 KB Output is correct
42 Correct 411 ms 780412 KB Output is correct
43 Execution timed out 736 ms 780280 KB Time limit exceeded
44 Halted 0 ms 0 KB -