oj.uz

Submission #444534

# Submission time Handle Problem Language Result Execution time Memory
444534 2021-07-14T08:28:28 Z zaneyu Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 479 ms 766628 KB 
/*input
20
YYGYYYGGGGRGYYGRGRYG
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=400+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
int arr[maxn];
int dp[maxn][maxn][maxn][3];
int c[3];
int pos[3][maxn];
int cnt[3][maxn];
int main(){
	ios::sync_with_stdio(false),cin.tie(0);
	int n;
	cin>>n;
	map<char,int> mp;
	mp['R']=0,mp['G']=1,mp['Y']=2;
	REP(i,n){
		char x;
		cin>>x;
		int z=mp[x];
		REP(j,3) cnt[j][i]=c[j];
		pos[z][c[z]]=i;
		c[z]++;
	}
	REP(i,n+1) REP(j,n+1) REP(k,n+1) REP(a,3) dp[i][j][k][a]=INF;
	REP(a,3) dp[0][0][0][a]=0;
	REP(i,c[0]+1){
		REP(j,c[1]+1){
			REP(k,c[2]+1){
				REP(z,3){
					if(z){
						int p=pos[0][i];
						MNTO(dp[i+1][j][k][0],dp[i][j][k][z]+max(0,cnt[1][p]-j)+max(0,cnt[2][p]-k));
					}
					if(z!=1){
						int p=pos[1][j];
						MNTO(dp[i][j+1][k][1],dp[i][j][k][z]+max(0,cnt[0][p]-i)+max(0,cnt[2][p]-k));
					}
					if(z!=2){
						int p=pos[2][k];
						MNTO(dp[i][j][k+1][2],dp[i][j][k][z]+max(0,cnt[1][p]-j)+max(0,cnt[0][p]-i));
					}
				}
			}
		}
	}
	int ans=INF;
	REP(a,3) MNTO(ans,dp[c[0]][c[1]][c[2]][a]);
	if(ans==INF) ans=-1;
	cout<<ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 1356 KB Output is correct
6 Correct 1 ms 1344 KB Output is correct
7 Correct 1 ms 1356 KB Output is correct
8 Correct 1 ms 1356 KB Output is correct
9 Correct 1 ms 1344 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 1 ms 1356 KB Output is correct
13 Correct 1 ms 1356 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1356 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 1356 KB Output is correct
6 Correct 1 ms 1344 KB Output is correct
7 Correct 1 ms 1356 KB Output is correct
8 Correct 1 ms 1356 KB Output is correct
9 Correct 1 ms 1344 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 1 ms 1356 KB Output is correct
13 Correct 1 ms 1356 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1356 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 9 ms 17996 KB Output is correct
19 Correct 8 ms 17996 KB Output is correct
20 Correct 8 ms 17996 KB Output is correct
21 Correct 8 ms 17996 KB Output is correct
22 Correct 8 ms 18076 KB Output is correct
23 Correct 8 ms 17996 KB Output is correct
24 Correct 8 ms 17996 KB Output is correct
25 Correct 7 ms 17996 KB Output is correct
26 Correct 8 ms 17996 KB Output is correct
27 Correct 8 ms 17996 KB Output is correct
28 Correct 8 ms 17996 KB Output is correct
29 Correct 8 ms 17996 KB Output is correct
30 Correct 8 ms 17996 KB Output is correct
31 Correct 8 ms 17996 KB Output is correct
32 Correct 8 ms 17996 KB Output is correct
33 Correct 8 ms 17484 KB Output is correct
34 Correct 8 ms 17484 KB Output is correct
35 Correct 7 ms 16844 KB Output is correct
36 Correct 8 ms 17416 KB Output is correct
37 Correct 7 ms 16204 KB Output is correct
38 Correct 8 ms 17996 KB Output is correct
39 Correct 11 ms 18112 KB Output is correct
40 Correct 8 ms 17484 KB Output is correct
41 Correct 8 ms 17996 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 407 ms 766584 KB Output is correct
3 Correct 398 ms 762760 KB Output is correct
4 Correct 406 ms 766568 KB Output is correct
5 Correct 410 ms 766564 KB Output is correct
6 Correct 406 ms 766476 KB Output is correct
7 Correct 421 ms 762648 KB Output is correct
8 Correct 398 ms 762644 KB Output is correct
9 Correct 401 ms 758848 KB Output is correct
10 Correct 406 ms 766488 KB Output is correct
11 Correct 404 ms 766484 KB Output is correct
12 Correct 96 ms 204672 KB Output is correct
13 Correct 175 ms 360896 KB Output is correct
14 Correct 261 ms 522576 KB Output is correct
15 Correct 405 ms 766532 KB Output is correct
16 Correct 412 ms 766628 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 1356 KB Output is correct
6 Correct 1 ms 1344 KB Output is correct
7 Correct 1 ms 1356 KB Output is correct
8 Correct 1 ms 1356 KB Output is correct
9 Correct 1 ms 1344 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 1 ms 1356 KB Output is correct
13 Correct 1 ms 1356 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1356 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 9 ms 17996 KB Output is correct
19 Correct 8 ms 17996 KB Output is correct
20 Correct 8 ms 17996 KB Output is correct
21 Correct 8 ms 17996 KB Output is correct
22 Correct 8 ms 18076 KB Output is correct
23 Correct 8 ms 17996 KB Output is correct
24 Correct 8 ms 17996 KB Output is correct
25 Correct 7 ms 17996 KB Output is correct
26 Correct 8 ms 17996 KB Output is correct
27 Correct 8 ms 17996 KB Output is correct
28 Correct 8 ms 17996 KB Output is correct
29 Correct 8 ms 17996 KB Output is correct
30 Correct 8 ms 17996 KB Output is correct
31 Correct 8 ms 17996 KB Output is correct
32 Correct 8 ms 17996 KB Output is correct
33 Correct 8 ms 17484 KB Output is correct
34 Correct 8 ms 17484 KB Output is correct
35 Correct 7 ms 16844 KB Output is correct
36 Correct 8 ms 17416 KB Output is correct
37 Correct 7 ms 16204 KB Output is correct
38 Correct 8 ms 17996 KB Output is correct
39 Correct 11 ms 18112 KB Output is correct
40 Correct 8 ms 17484 KB Output is correct
41 Correct 8 ms 17996 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 407 ms 766584 KB Output is correct
44 Correct 398 ms 762760 KB Output is correct
45 Correct 406 ms 766568 KB Output is correct
46 Correct 410 ms 766564 KB Output is correct
47 Correct 406 ms 766476 KB Output is correct
48 Correct 421 ms 762648 KB Output is correct
49 Correct 398 ms 762644 KB Output is correct
50 Correct 401 ms 758848 KB Output is correct
51 Correct 406 ms 766488 KB Output is correct
52 Correct 404 ms 766484 KB Output is correct
53 Correct 96 ms 204672 KB Output is correct
54 Correct 175 ms 360896 KB Output is correct
55 Correct 261 ms 522576 KB Output is correct
56 Correct 405 ms 766532 KB Output is correct
57 Correct 412 ms 766628 KB Output is correct
58 Correct 449 ms 766476 KB Output is correct
59 Correct 452 ms 766576 KB Output is correct
60 Correct 438 ms 759044 KB Output is correct
61 Correct 434 ms 762720 KB Output is correct
62 Correct 413 ms 766544 KB Output is correct
63 Correct 420 ms 766532 KB Output is correct
64 Correct 431 ms 766608 KB Output is correct
65 Correct 439 ms 762692 KB Output is correct
66 Correct 444 ms 755156 KB Output is correct
67 Correct 438 ms 766532 KB Output is correct
68 Correct 435 ms 762648 KB Output is correct
69 Correct 479 ms 766628 KB Output is correct
70 Correct 476 ms 766580 KB Output is correct
71 Correct 441 ms 762704 KB Output is correct
72 Correct 414 ms 762808 KB Output is correct
73 Correct 400 ms 766524 KB Output is correct