oj.uz

Submission #961657

# Submission time Handle Problem Language Result Execution time Memory
961657 2024-04-12T09:39:50 Z noobcodur Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 208 ms 558932 KB 
#include<bits/stdc++.h>
using namespace std;

using ld = long double;

#define int long long
#define pii pair<int,int>
#define forn(i,j) for(int i = 0; i < j; ++i)
#define forrange(i,j,k) for(int i = j; i < k; ++i)
#define vi vector<int>
#define vpii vector<pii>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()

const int MOD = 1e9+7; const int INF = 1e17+1; const int maxN = 2e5+1;

void setIO(string name){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	if(!name.empty()){
		freopen((name + ".in").c_str(),"r",stdin);
		freopen((name + ".out").c_str(),"w",stdout);
	}
}

int dp[401][401][401][3],pre[3][401],freq[3],pos[3][401],arr[401];

void chmin(int &x, int y){
	x = min(x,y);
}

signed main(){
	setIO("");
	int n; cin >> n;
	string a; cin >> a;

	forn(i,n){
		if(a[i] == 'R') arr[i] = 0;
		if(a[i] == 'G') arr[i] = 1;
		if(a[i] == 'Y') arr[i] = 2;
	}

	forn(i,n){
		freq[arr[i]]++;
		pos[arr[i]][freq[arr[i]]-1] = i;

		forn(j,3) pre[j][i] = freq[j];
	}

	forn(a,freq[0]+1){
		forn(b,freq[1]+1){
			forn(c,freq[2]+1){
				forn(col,3){
					dp[a][b][c][col] = INF;
				}
			}
		}
	}

	dp[0][0][0][0] = 0; dp[0][0][0][1] = 0; dp[0][0][0][2] = 0;


	forn(a,freq[0]+1){
		forn(b,freq[1]+1){
			forn(c,freq[2]+1){
				forn(col,3){
					if(col != 0 && a != freq[0]){
						int pt = pos[0][a];
						chmin(dp[a+1][b][c][0],dp[a][b][c][col]+max(0LL,pre[1][pt]-b) + max(0LL,pre[2][pt]-c));
					}

					if(col != 1 && b != freq[1]){
						int pt = pos[1][b];
						chmin(dp[a][b+1][c][1],dp[a][b][c][col]+max(0LL,pre[0][pt]-a) + max(0LL,pre[2][pt]-c));
					}

					if(col != 2 && c != freq[2]){
						int pt = pos[2][c];
						chmin(dp[a][b][c+1][2],dp[a][b][c][col]+max(0LL,pre[0][pt]-a) + max(0LL,pre[1][pt]-b));
					}
				}
			}
		}
	}

	int res = INF;

	forn(j,3){
		chmin(res,dp[freq[0]][freq[1]][freq[2]][j]);
	}

	if(res == INF){
		cout << -1 << endl; return 0;
	}

	cout << res << endl;
}

Compilation message

joi2019_ho_t3.cpp: In function 'void setIO(std::string)':
joi2019_ho_t3.cpp:24:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   freopen((name + ".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:25:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   freopen((name + ".out").c_str(),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 20824 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 1 ms 8536 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 20824 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 1 ms 8536 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 6 ms 51804 KB Output is correct
19 Correct 5 ms 43612 KB Output is correct
20 Correct 7 ms 56148 KB Output is correct
21 Correct 6 ms 45656 KB Output is correct
22 Correct 6 ms 51804 KB Output is correct
23 Correct 5 ms 39516 KB Output is correct
24 Correct 3 ms 25180 KB Output is correct
25 Correct 9 ms 84568 KB Output is correct
26 Correct 9 ms 74332 KB Output is correct
27 Correct 7 ms 62044 KB Output is correct
28 Correct 6 ms 47708 KB Output is correct
29 Correct 6 ms 49752 KB Output is correct
30 Correct 5 ms 39512 KB Output is correct
31 Correct 5 ms 35416 KB Output is correct
32 Correct 5 ms 41564 KB Output is correct
33 Correct 7 ms 59996 KB Output is correct
34 Correct 6 ms 51804 KB Output is correct
35 Correct 6 ms 51804 KB Output is correct
36 Correct 5 ms 43612 KB Output is correct
37 Correct 4 ms 31304 KB Output is correct
38 Correct 5 ms 33368 KB Output is correct
39 Correct 5 ms 43612 KB Output is correct
40 Correct 0 ms 2396 KB Output is correct
41 Correct 3 ms 24924 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 208 ms 556800 KB Output is correct
3 Correct 73 ms 552788 KB Output is correct
4 Correct 74 ms 553300 KB Output is correct
5 Correct 74 ms 549876 KB Output is correct
6 Correct 73 ms 555064 KB Output is correct
7 Correct 73 ms 554288 KB Output is correct
8 Correct 73 ms 552388 KB Output is correct
9 Correct 74 ms 549200 KB Output is correct
10 Correct 73 ms 551816 KB Output is correct
11 Correct 76 ms 552140 KB Output is correct
12 Correct 34 ms 316488 KB Output is correct
13 Correct 48 ms 460064 KB Output is correct
14 Correct 64 ms 517716 KB Output is correct
15 Correct 74 ms 554664 KB Output is correct
16 Correct 75 ms 552528 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 20824 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 1 ms 8536 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 6 ms 51804 KB Output is correct
19 Correct 5 ms 43612 KB Output is correct
20 Correct 7 ms 56148 KB Output is correct
21 Correct 6 ms 45656 KB Output is correct
22 Correct 6 ms 51804 KB Output is correct
23 Correct 5 ms 39516 KB Output is correct
24 Correct 3 ms 25180 KB Output is correct
25 Correct 9 ms 84568 KB Output is correct
26 Correct 9 ms 74332 KB Output is correct
27 Correct 7 ms 62044 KB Output is correct
28 Correct 6 ms 47708 KB Output is correct
29 Correct 6 ms 49752 KB Output is correct
30 Correct 5 ms 39512 KB Output is correct
31 Correct 5 ms 35416 KB Output is correct
32 Correct 5 ms 41564 KB Output is correct
33 Correct 7 ms 59996 KB Output is correct
34 Correct 6 ms 51804 KB Output is correct
35 Correct 6 ms 51804 KB Output is correct
36 Correct 5 ms 43612 KB Output is correct
37 Correct 4 ms 31304 KB Output is correct
38 Correct 5 ms 33368 KB Output is correct
39 Correct 5 ms 43612 KB Output is correct
40 Correct 0 ms 2396 KB Output is correct
41 Correct 3 ms 24924 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 208 ms 556800 KB Output is correct
44 Correct 73 ms 552788 KB Output is correct
45 Correct 74 ms 553300 KB Output is correct
46 Correct 74 ms 549876 KB Output is correct
47 Correct 73 ms 555064 KB Output is correct
48 Correct 73 ms 554288 KB Output is correct
49 Correct 73 ms 552388 KB Output is correct
50 Correct 74 ms 549200 KB Output is correct
51 Correct 73 ms 551816 KB Output is correct
52 Correct 76 ms 552140 KB Output is correct
53 Correct 34 ms 316488 KB Output is correct
54 Correct 48 ms 460064 KB Output is correct
55 Correct 64 ms 517716 KB Output is correct
56 Correct 74 ms 554664 KB Output is correct
57 Correct 75 ms 552528 KB Output is correct
58 Correct 77 ms 404820 KB Output is correct
59 Correct 82 ms 486744 KB Output is correct
60 Correct 79 ms 466260 KB Output is correct
61 Correct 77 ms 441760 KB Output is correct
62 Correct 83 ms 558932 KB Output is correct
63 Correct 79 ms 549460 KB Output is correct
64 Correct 92 ms 543620 KB Output is correct
65 Correct 89 ms 523600 KB Output is correct
66 Correct 80 ms 449928 KB Output is correct
67 Correct 73 ms 392504 KB Output is correct
68 Correct 79 ms 453972 KB Output is correct
69 Correct 83 ms 449872 KB Output is correct
70 Correct 80 ms 460372 KB Output is correct
71 Correct 89 ms 474500 KB Output is correct
72 Correct 66 ms 509260 KB Output is correct
73 Correct 4 ms 14940 KB Output is correct