oj.uz

Submission #209217

# Submission time Handle Problem Language Result Execution time Memory
209217 2020-03-13T12:37:39 Z kostia244 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
75 / 100
 500 ms 786296 KB 
#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,fma,tune=native")
#pragma GCC optimize("unroll-loops")
#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 pp[maxn][maxn][3][3];
void lb(int c, int n1, int i, int j, int &ans) {
	if(pp[i][j][c][n1]!= -1) {
		ans -= pp[i][j][c][n1];
		return;
	}
	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 -= (pp[i][j][c][n1]=min(t+1, j));
	else
		pp[i][j][c][n1] = 0;
}
inline 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;
	lb(c, n1, i, j, ans);
	lb(c, n2, i, k, ans);
	return ans;
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	memset(pp, -1, sizeof pp);
	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 <= p[0].size(); i++) {
		for(int j = 0; j <= p[1].size(); j++) {
			for(int k = 0; k <= p[2].size(); 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 'void lb(int, int, int, int, int&)':
joi2019_ho_t3.cpp:32: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: In function 'int cost(int, int, int, int, int)':
joi2019_ho_t3.cpp:58:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(p[c].size()<=i) return 1<<20;
     ~~~~~~~~~~~^~~
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:73:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i <= p[0].size(); i++) {
                 ~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:74:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j <= p[1].size(); j++) {
                  ~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:75:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int k = 0; k <= p[2].size(); k++) {
                   ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 786124 KB Output is correct
2 Correct 449 ms 786160 KB Output is correct
3 Correct 411 ms 786060 KB Output is correct
4 Correct 415 ms 786168 KB Output is correct
5 Correct 424 ms 786168 KB Output is correct
6 Correct 432 ms 786144 KB Output is correct
7 Correct 433 ms 786048 KB Output is correct
8 Correct 426 ms 786060 KB Output is correct
9 Correct 426 ms 786040 KB Output is correct
10 Correct 438 ms 786092 KB Output is correct
11 Correct 433 ms 786080 KB Output is correct
12 Correct 431 ms 786284 KB Output is correct
13 Correct 464 ms 786120 KB Output is correct
14 Correct 441 ms 786044 KB Output is correct
15 Correct 424 ms 786076 KB Output is correct
16 Correct 408 ms 786164 KB Output is correct
17 Correct 423 ms 786168 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 786124 KB Output is correct
2 Correct 449 ms 786160 KB Output is correct
3 Correct 411 ms 786060 KB Output is correct
4 Correct 415 ms 786168 KB Output is correct
5 Correct 424 ms 786168 KB Output is correct
6 Correct 432 ms 786144 KB Output is correct
7 Correct 433 ms 786048 KB Output is correct
8 Correct 426 ms 786060 KB Output is correct
9 Correct 426 ms 786040 KB Output is correct
10 Correct 438 ms 786092 KB Output is correct
11 Correct 433 ms 786080 KB Output is correct
12 Correct 431 ms 786284 KB Output is correct
13 Correct 464 ms 786120 KB Output is correct
14 Correct 441 ms 786044 KB Output is correct
15 Correct 424 ms 786076 KB Output is correct
16 Correct 408 ms 786164 KB Output is correct
17 Correct 423 ms 786168 KB Output is correct
18 Correct 439 ms 786172 KB Output is correct
19 Correct 403 ms 786168 KB Output is correct
20 Correct 416 ms 786040 KB Output is correct
21 Correct 427 ms 786040 KB Output is correct
22 Correct 420 ms 786040 KB Output is correct
23 Correct 413 ms 786116 KB Output is correct
24 Correct 412 ms 786296 KB Output is correct
25 Correct 424 ms 786168 KB Output is correct
26 Correct 416 ms 786040 KB Output is correct
27 Correct 416 ms 786168 KB Output is correct
28 Correct 403 ms 786040 KB Output is correct
29 Correct 429 ms 786168 KB Output is correct
30 Correct 410 ms 786040 KB Output is correct
31 Correct 412 ms 786040 KB Output is correct
32 Correct 431 ms 786168 KB Output is correct
33 Correct 414 ms 786040 KB Output is correct
34 Correct 411 ms 786108 KB Output is correct
35 Correct 421 ms 786040 KB Output is correct
36 Correct 416 ms 786040 KB Output is correct
37 Correct 433 ms 786040 KB Output is correct
38 Correct 422 ms 786040 KB Output is correct
39 Correct 420 ms 786168 KB Output is correct
40 Correct 437 ms 786168 KB Output is correct
41 Correct 429 ms 786040 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 786192 KB Output is correct
2 Correct 432 ms 786108 KB Output is correct
3 Correct 428 ms 786168 KB Output is correct
4 Correct 429 ms 786056 KB Output is correct
5 Correct 425 ms 786168 KB Output is correct
6 Correct 425 ms 786040 KB Output is correct
7 Correct 423 ms 786144 KB Output is correct
8 Correct 447 ms 786100 KB Output is correct
9 Correct 461 ms 786144 KB Output is correct
10 Correct 442 ms 786172 KB Output is correct
11 Correct 416 ms 786168 KB Output is correct
12 Correct 411 ms 786168 KB Output is correct
13 Correct 424 ms 786168 KB Output is correct
14 Correct 415 ms 786168 KB Output is correct
15 Correct 422 ms 786040 KB Output is correct
16 Correct 419 ms 786152 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 786124 KB Output is correct
2 Correct 449 ms 786160 KB Output is correct
3 Correct 411 ms 786060 KB Output is correct
4 Correct 415 ms 786168 KB Output is correct
5 Correct 424 ms 786168 KB Output is correct
6 Correct 432 ms 786144 KB Output is correct
7 Correct 433 ms 786048 KB Output is correct
8 Correct 426 ms 786060 KB Output is correct
9 Correct 426 ms 786040 KB Output is correct
10 Correct 438 ms 786092 KB Output is correct
11 Correct 433 ms 786080 KB Output is correct
12 Correct 431 ms 786284 KB Output is correct
13 Correct 464 ms 786120 KB Output is correct
14 Correct 441 ms 786044 KB Output is correct
15 Correct 424 ms 786076 KB Output is correct
16 Correct 408 ms 786164 KB Output is correct
17 Correct 423 ms 786168 KB Output is correct
18 Correct 439 ms 786172 KB Output is correct
19 Correct 403 ms 786168 KB Output is correct
20 Correct 416 ms 786040 KB Output is correct
21 Correct 427 ms 786040 KB Output is correct
22 Correct 420 ms 786040 KB Output is correct
23 Correct 413 ms 786116 KB Output is correct
24 Correct 412 ms 786296 KB Output is correct
25 Correct 424 ms 786168 KB Output is correct
26 Correct 416 ms 786040 KB Output is correct
27 Correct 416 ms 786168 KB Output is correct
28 Correct 403 ms 786040 KB Output is correct
29 Correct 429 ms 786168 KB Output is correct
30 Correct 410 ms 786040 KB Output is correct
31 Correct 412 ms 786040 KB Output is correct
32 Correct 431 ms 786168 KB Output is correct
33 Correct 414 ms 786040 KB Output is correct
34 Correct 411 ms 786108 KB Output is correct
35 Correct 421 ms 786040 KB Output is correct
36 Correct 416 ms 786040 KB Output is correct
37 Correct 433 ms 786040 KB Output is correct
38 Correct 422 ms 786040 KB Output is correct
39 Correct 420 ms 786168 KB Output is correct
40 Correct 437 ms 786168 KB Output is correct
41 Correct 429 ms 786040 KB Output is correct
42 Correct 441 ms 786192 KB Output is correct
43 Correct 432 ms 786108 KB Output is correct
44 Correct 428 ms 786168 KB Output is correct
45 Correct 429 ms 786056 KB Output is correct
46 Correct 425 ms 786168 KB Output is correct
47 Correct 425 ms 786040 KB Output is correct
48 Correct 423 ms 786144 KB Output is correct
49 Correct 447 ms 786100 KB Output is correct
50 Correct 461 ms 786144 KB Output is correct
51 Correct 442 ms 786172 KB Output is correct
52 Correct 416 ms 786168 KB Output is correct
53 Correct 411 ms 786168 KB Output is correct
54 Correct 424 ms 786168 KB Output is correct
55 Correct 415 ms 786168 KB Output is correct
56 Correct 422 ms 786040 KB Output is correct
57 Correct 419 ms 786152 KB Output is correct
58 Execution timed out 509 ms 786080 KB Time limit exceeded
59 Halted 0 ms 0 KB -