oj.uz

답안 #631041

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631041 2022-08-17T15:19:11 Z Karliver Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 89 ms 162892 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#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;
	
	forn(i, 3) dp[0][0][0][i] = 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)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)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)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

# 결과 실행 시간 메모리 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 1 ms 340 KB Output is correct
5 Correct 0 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 1 ms 468 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 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 1 ms 340 KB Output is correct
5 Correct 0 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 1 ms 468 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 2260 KB Output is correct
19 Correct 1 ms 1876 KB Output is correct
20 Correct 1 ms 2260 KB Output is correct
21 Correct 1 ms 2388 KB Output is correct
22 Correct 1 ms 1620 KB Output is correct
23 Correct 1 ms 2188 KB Output is correct
24 Correct 1 ms 1620 KB Output is correct
25 Correct 2 ms 3924 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 2 ms 3028 KB Output is correct
28 Correct 2 ms 2388 KB Output is correct
29 Correct 1 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 1 ms 2388 KB Output is correct
33 Correct 2 ms 3924 KB Output is correct
34 Correct 2 ms 3572 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 1 ms 1876 KB Output is correct
37 Correct 1 ms 1748 KB Output is correct
38 Correct 1 ms 2132 KB Output is correct
39 Correct 1 ms 2260 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 59 ms 162872 KB Output is correct
3 Correct 60 ms 161996 KB Output is correct
4 Correct 62 ms 162892 KB Output is correct
5 Correct 60 ms 162876 KB Output is correct
6 Correct 60 ms 162880 KB Output is correct
7 Correct 62 ms 162120 KB Output is correct
8 Correct 71 ms 162040 KB Output is correct
9 Correct 68 ms 161228 KB Output is correct
10 Correct 63 ms 162892 KB Output is correct
11 Correct 60 ms 162836 KB Output is correct
12 Correct 17 ms 44076 KB Output is correct
13 Correct 31 ms 77140 KB Output is correct
14 Correct 49 ms 111364 KB Output is correct
15 Correct 65 ms 162864 KB Output is correct
16 Correct 63 ms 162852 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 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 1 ms 340 KB Output is correct
5 Correct 0 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 1 ms 468 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 2260 KB Output is correct
19 Correct 1 ms 1876 KB Output is correct
20 Correct 1 ms 2260 KB Output is correct
21 Correct 1 ms 2388 KB Output is correct
22 Correct 1 ms 1620 KB Output is correct
23 Correct 1 ms 2188 KB Output is correct
24 Correct 1 ms 1620 KB Output is correct
25 Correct 2 ms 3924 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 2 ms 3028 KB Output is correct
28 Correct 2 ms 2388 KB Output is correct
29 Correct 1 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 1 ms 2388 KB Output is correct
33 Correct 2 ms 3924 KB Output is correct
34 Correct 2 ms 3572 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 1 ms 1876 KB Output is correct
37 Correct 1 ms 1748 KB Output is correct
38 Correct 1 ms 2132 KB Output is correct
39 Correct 1 ms 2260 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 59 ms 162872 KB Output is correct
44 Correct 60 ms 161996 KB Output is correct
45 Correct 62 ms 162892 KB Output is correct
46 Correct 60 ms 162876 KB Output is correct
47 Correct 60 ms 162880 KB Output is correct
48 Correct 62 ms 162120 KB Output is correct
49 Correct 71 ms 162040 KB Output is correct
50 Correct 68 ms 161228 KB Output is correct
51 Correct 63 ms 162892 KB Output is correct
52 Correct 60 ms 162836 KB Output is correct
53 Correct 17 ms 44076 KB Output is correct
54 Correct 31 ms 77140 KB Output is correct
55 Correct 49 ms 111364 KB Output is correct
56 Correct 65 ms 162864 KB Output is correct
57 Correct 63 ms 162852 KB Output is correct
58 Correct 68 ms 101376 KB Output is correct
59 Correct 75 ms 118824 KB Output is correct
60 Correct 74 ms 111104 KB Output is correct
61 Correct 89 ms 109044 KB Output is correct
62 Correct 64 ms 161176 KB Output is correct
63 Correct 73 ms 161380 KB Output is correct
64 Correct 70 ms 154532 KB Output is correct
65 Correct 72 ms 145084 KB Output is correct
66 Correct 70 ms 109464 KB Output is correct
67 Correct 70 ms 106692 KB Output is correct
68 Correct 77 ms 112148 KB Output is correct
69 Correct 74 ms 109804 KB Output is correct
70 Correct 74 ms 115644 KB Output is correct
71 Correct 71 ms 107500 KB Output is correct
72 Correct 23 ms 44860 KB Output is correct
73 Correct 3 ms 3668 KB Output is correct