oj.uz

Submission #631033

# Submission time Handle Problem Language Result Execution time Memory
631033 2022-08-17T15:14:50 Z Karliver Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 92 ms 162904 KB 
	
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 405;
const double eps = 1e-7;
const  long  long inf = 1e18;
template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}



void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)


int n;
string s;
int dp[N][N][N][4];
int ca[N], cb[N], cc[N];
void solve() {	

	cin >> n >> s;
	vector<int> a(n);
	vector<int> pos[4];
	for(int j = 0;j < n;++j) {
		a[j] = (s[j] == 'R' ? 0 : (s[j] == 'G' ? 1 : 2));
		pos[a[j]].push_back(j);
	}
	
	for(int j = 0;j < n;++j) {
		if(j)ca[j] = ca[j-1], cb[j] = cb[j-1], cc[j] = cc[j-1];
		if(a[j] == 0)ca[j]++;
		else if(a[j] == 1) cb[j]++;
		else cc[j]++;
		
	}
	int A = sz(pos[0]), B = sz(pos[1]), C = sz(pos[2]);
	
	
	forn(i, A+1) forn(j, B+1) forn(k, C+1) forn(l, 3) dp[i][j][k][l] = INF;
	
	dp[0][0][0][0] = 0;
	forn(i, A+1) forn(j, B + 1) forn(k, C+1) forn(l, 3) {
		if(dp[i][j][k][l] == INF)continue;
		int x = i+j+k;
		if(i<A &&  (l != 0 || x==0))ckmi(dp[i+1][j][k][0], dp[i][j][k][l]+max(0, cb[pos[0][i]]-j)+max(0,cc[pos[0][i]]-k));
		if(j<B && (l != 1 || x == 0))ckmi(dp[i][j+1][k][1], dp[i][j][k][l]+max(0, ca[pos[1][j]]-i)+max(0, cc[pos[1][j]]-k));
		if(k<C && (l != 2 || x == 0))ckmi(dp[i][j][k+1][2], dp[i][j][k][l]+max(0, ca[pos[2][k]]-i)+max(0, cb[pos[2][k]]-j));
	}	
	
	int res = INF;
	forn(i, 3) {
		//debug(dp[A][B][C][i]);
		ckmi(res, dp[A][B][C][i]);
	}
	
	
	cout << (res == INF ? -1 : res) << '\n';
}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 2388 KB Output is correct
19 Correct 1 ms 1864 KB Output is correct
20 Correct 1 ms 2248 KB Output is correct
21 Correct 1 ms 2388 KB Output is correct
22 Correct 1 ms 1740 KB Output is correct
23 Correct 1 ms 2132 KB Output is correct
24 Correct 1 ms 1616 KB Output is correct
25 Correct 2 ms 3924 KB Output is correct
26 Correct 3 ms 4172 KB Output is correct
27 Correct 2 ms 3028 KB Output is correct
28 Correct 1 ms 2388 KB Output is correct
29 Correct 4 ms 2260 KB Output is correct
30 Correct 1 ms 2260 KB Output is correct
31 Correct 1 ms 2004 KB Output is correct
32 Correct 2 ms 2388 KB Output is correct
33 Correct 2 ms 3796 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 2 ms 2692 KB Output is correct
36 Correct 1 ms 1876 KB Output is correct
37 Correct 2 ms 1748 KB Output is correct
38 Correct 1 ms 2204 KB Output is correct
39 Correct 2 ms 2376 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 2132 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 60 ms 162884 KB Output is correct
3 Correct 60 ms 162096 KB Output is correct
4 Correct 60 ms 162880 KB Output is correct
5 Correct 58 ms 162892 KB Output is correct
6 Correct 62 ms 162844 KB Output is correct
7 Correct 60 ms 162076 KB Output is correct
8 Correct 62 ms 162000 KB Output is correct
9 Correct 63 ms 161260 KB Output is correct
10 Correct 62 ms 162872 KB Output is correct
11 Correct 59 ms 162860 KB Output is correct
12 Correct 17 ms 44036 KB Output is correct
13 Correct 29 ms 77124 KB Output is correct
14 Correct 42 ms 111308 KB Output is correct
15 Correct 59 ms 162888 KB Output is correct
16 Correct 64 ms 162904 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 2388 KB Output is correct
19 Correct 1 ms 1864 KB Output is correct
20 Correct 1 ms 2248 KB Output is correct
21 Correct 1 ms 2388 KB Output is correct
22 Correct 1 ms 1740 KB Output is correct
23 Correct 1 ms 2132 KB Output is correct
24 Correct 1 ms 1616 KB Output is correct
25 Correct 2 ms 3924 KB Output is correct
26 Correct 3 ms 4172 KB Output is correct
27 Correct 2 ms 3028 KB Output is correct
28 Correct 1 ms 2388 KB Output is correct
29 Correct 4 ms 2260 KB Output is correct
30 Correct 1 ms 2260 KB Output is correct
31 Correct 1 ms 2004 KB Output is correct
32 Correct 2 ms 2388 KB Output is correct
33 Correct 2 ms 3796 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 2 ms 2692 KB Output is correct
36 Correct 1 ms 1876 KB Output is correct
37 Correct 2 ms 1748 KB Output is correct
38 Correct 1 ms 2204 KB Output is correct
39 Correct 2 ms 2376 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 2132 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 60 ms 162884 KB Output is correct
44 Correct 60 ms 162096 KB Output is correct
45 Correct 60 ms 162880 KB Output is correct
46 Correct 58 ms 162892 KB Output is correct
47 Correct 62 ms 162844 KB Output is correct
48 Correct 60 ms 162076 KB Output is correct
49 Correct 62 ms 162000 KB Output is correct
50 Correct 63 ms 161260 KB Output is correct
51 Correct 62 ms 162872 KB Output is correct
52 Correct 59 ms 162860 KB Output is correct
53 Correct 17 ms 44036 KB Output is correct
54 Correct 29 ms 77124 KB Output is correct
55 Correct 42 ms 111308 KB Output is correct
56 Correct 59 ms 162888 KB Output is correct
57 Correct 64 ms 162904 KB Output is correct
58 Correct 69 ms 101316 KB Output is correct
59 Correct 86 ms 118816 KB Output is correct
60 Correct 84 ms 111036 KB Output is correct
61 Correct 76 ms 109052 KB Output is correct
62 Correct 60 ms 161224 KB Output is correct
63 Correct 67 ms 161352 KB Output is correct
64 Correct 72 ms 154472 KB Output is correct
65 Correct 76 ms 144972 KB Output is correct
66 Correct 92 ms 109444 KB Output is correct
67 Correct 75 ms 106712 KB Output is correct
68 Correct 75 ms 112204 KB Output is correct
69 Correct 77 ms 109812 KB Output is correct
70 Correct 76 ms 115556 KB Output is correct
71 Correct 76 ms 107560 KB Output is correct
72 Correct 28 ms 44756 KB Output is correct
73 Correct 3 ms 3668 KB Output is correct