oj.uz

Submission #122995

# Submission time Handle Problem Language Result Execution time Memory
122995 2019-06-29T23:15:02 Z zoooma13 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 415 ms 62584 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define MAX_N 402
#define INF 0x3f3f3f3f
 
int n;
string s;
vector <int> pos[3];
 
int root = -1;
int smlr[3][MAX_N][MAX_N];
vector<vector<vector<int>>> dp[3] ,to_rch[3];
int solve(int t ,int p0 ,int p1 ,int p2){
    if(p0+p1+p2 == n)
		return 0;
    int&ret = (~t ? dp[t][p0][p1][p2] : root);
    if(~ret)
        return ret;
    ret = INF;
 
    int st[] = {p0 ,p1 ,p2};
    for(int nt=0; nt<3; nt++)
        if(t != nt && st[nt] < pos[nt].size()){
			int cost = to_rch[nt][st[0]][st[1]][st[2]];
			st[nt]++;
            ret = min(ret ,cost+solve(nt ,st[0] ,st[1] ,st[2]));
            st[nt]--;
        }
    return ret;
}
 
int main()
{
	//freopen("input.in" ,"r" ,stdin);
	
	while(cin >> n){
		pos[0].clear();
		pos[1].clear();
		pos[2].clear();
		
		cin >> s; n = s.size();
		
		for(int i=0; i<n; i++){
			if(s[i] == 'R') pos[0].push_back(i);
			if(s[i] == 'G') pos[1].push_back(i);
			if(s[i] == 'Y') pos[2].push_back(i);
		}
		
		for(int i=0; i<3; i++){
			dp[i].clear() ,to_rch[i].clear();
			dp[i].resize(pos[0].size()+1 ,vector<vector<int>>(pos[1].size()+1 ,vector<int>(pos[2].size()+1 ,-1)));
			to_rch[i].resize(pos[0].size()+1 ,vector<vector<int>>(pos[1].size()+1 ,vector<int>(pos[2].size()+1 ,0)));
		}
		
		for(int t=0; t<3; t++)
		for(int i=0; i<pos[t].size(); i++){
			int pt_ptr = i;
			for(int j=0; j<n; j++){
				while(pt_ptr < pos[t].size() && pos[t][pt_ptr] <= j)
					pt_ptr++;
				smlr[t][i][j] = pt_ptr-i;
			}
		}
		
		for(int p0=0; p0<=pos[0].size(); p0++)
		for(int p1=0; p1<=pos[1].size(); p1++)
		for(int p2=0; p2<=pos[2].size(); p2++)
		{
			int st[] = {p0 ,p1 ,p2};
			for(int t=0; t<3; t++) if(st[t] < pos[t].size())
			for(int h=0; h<3; h++) if(h != t)
				to_rch[t][p0][p1][p2] += smlr[h][st[h]][pos[t][st[t]]];
		}
 
		root = -1 ,solve(-1 ,0 ,0 ,0);
		cout << (root == INF ? -1 : root) << endl;
	}
}

Compilation message

joi2019_ho_t3.cpp: In function 'int solve(int, int, int, int)':
joi2019_ho_t3.cpp:24:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(t != nt && st[nt] < pos[nt].size()){
                       ~~~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:57:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<pos[t].size(); i++){
                ~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:60:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(pt_ptr < pos[t].size() && pos[t][pt_ptr] <= j)
           ~~~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int p0=0; p0<=pos[0].size(); p0++)
                 ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int p1=0; p1<=pos[1].size(); p1++)
                 ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int p2=0; p2<=pos[2].size(); p2++)
                 ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:71:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int t=0; t<3; t++) if(st[t] < pos[t].size())
                              ~~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 760 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 3 ms 760 KB Output is correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 3 ms 760 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 2 ms 636 KB Output is correct
26 Correct 2 ms 760 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 3 ms 760 KB Output is correct
29 Correct 3 ms 764 KB Output is correct
30 Correct 3 ms 760 KB Output is correct
31 Correct 3 ms 760 KB Output is correct
32 Correct 3 ms 760 KB Output is correct
33 Correct 2 ms 760 KB Output is correct
34 Correct 2 ms 760 KB Output is correct
35 Correct 3 ms 632 KB Output is correct
36 Correct 3 ms 632 KB Output is correct
37 Correct 3 ms 632 KB Output is correct
38 Correct 3 ms 760 KB Output is correct
39 Correct 3 ms 760 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 632 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 25 ms 14328 KB Output is correct
3 Correct 25 ms 14076 KB Output is correct
4 Correct 25 ms 14328 KB Output is correct
5 Correct 25 ms 14328 KB Output is correct
6 Correct 26 ms 14328 KB Output is correct
7 Correct 25 ms 14328 KB Output is correct
8 Correct 25 ms 14328 KB Output is correct
9 Correct 25 ms 14200 KB Output is correct
10 Correct 25 ms 14328 KB Output is correct
11 Correct 26 ms 14328 KB Output is correct
12 Correct 8 ms 4216 KB Output is correct
13 Correct 13 ms 7160 KB Output is correct
14 Correct 18 ms 9976 KB Output is correct
15 Correct 25 ms 14328 KB Output is correct
16 Correct 25 ms 14328 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 760 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 3 ms 760 KB Output is correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 3 ms 760 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 2 ms 636 KB Output is correct
26 Correct 2 ms 760 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 3 ms 760 KB Output is correct
29 Correct 3 ms 764 KB Output is correct
30 Correct 3 ms 760 KB Output is correct
31 Correct 3 ms 760 KB Output is correct
32 Correct 3 ms 760 KB Output is correct
33 Correct 2 ms 760 KB Output is correct
34 Correct 2 ms 760 KB Output is correct
35 Correct 3 ms 632 KB Output is correct
36 Correct 3 ms 632 KB Output is correct
37 Correct 3 ms 632 KB Output is correct
38 Correct 3 ms 760 KB Output is correct
39 Correct 3 ms 760 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 632 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 25 ms 14328 KB Output is correct
44 Correct 25 ms 14076 KB Output is correct
45 Correct 25 ms 14328 KB Output is correct
46 Correct 25 ms 14328 KB Output is correct
47 Correct 26 ms 14328 KB Output is correct
48 Correct 25 ms 14328 KB Output is correct
49 Correct 25 ms 14328 KB Output is correct
50 Correct 25 ms 14200 KB Output is correct
51 Correct 25 ms 14328 KB Output is correct
52 Correct 26 ms 14328 KB Output is correct
53 Correct 8 ms 4216 KB Output is correct
54 Correct 13 ms 7160 KB Output is correct
55 Correct 18 ms 9976 KB Output is correct
56 Correct 25 ms 14328 KB Output is correct
57 Correct 25 ms 14328 KB Output is correct
58 Correct 379 ms 61560 KB Output is correct
59 Correct 385 ms 62584 KB Output is correct
60 Correct 372 ms 60408 KB Output is correct
61 Correct 413 ms 61816 KB Output is correct
62 Correct 34 ms 13944 KB Output is correct
63 Correct 52 ms 17528 KB Output is correct
64 Correct 132 ms 37624 KB Output is correct
65 Correct 200 ms 46712 KB Output is correct
66 Correct 415 ms 61080 KB Output is correct
67 Correct 355 ms 60536 KB Output is correct
68 Correct 366 ms 61176 KB Output is correct
69 Correct 370 ms 62312 KB Output is correct
70 Correct 382 ms 62044 KB Output is correct
71 Correct 360 ms 61164 KB Output is correct
72 Correct 57 ms 17272 KB Output is correct
73 Correct 13 ms 4984 KB Output is correct