oj.uz

답안 #1034932

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034932 2024-07-25T22:18:44 Z ten_xd Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
75 / 100
 500 ms 763380 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define all(t) t.begin(), t.end()
#define pb push_back

const int N = 402, INF = 2e9+54321;
const ll INF_L = (ll)2e18+54321;

int n;
string A;
int B[N];
int S[3][N];
vector<int> V[3];
int dp[N][N][N][3];

void solve()
{
	cin >> n >> A;
	rep(i,n)
	{
		if(A[i] == 'R') B[i] = 0;
		else if(A[i] == 'Y') B[i] = 1;
		else B[i] = 2;
	}

	rep(i,3)
	{
		int s = 0;
		rep(j,n)
		{
			S[i][j] = s;
			if(B[j] == i) ++s;
		}
	}
	rep(i,n) V[B[i]].pb(i);

	rep(i,N) rep(j,N) rep(k,N) rep(f,3) dp[i][j][k][f] = INF;

	if((int)V[0].size() > 0) dp[1][1][0][0] = V[0][0];
	if((int)V[1].size() > 0) dp[1][0][1][1] = V[1][0];
	if((int)V[2].size() > 0) dp[1][0][0][2] = V[2][0];

	for(int i = 1; i < n; ++i)
	{
		for(int A = 0; A <= i; ++A)
		{
			for(int B = 0; B <= i-A; ++B)
			{
				int C = i-A-B;
				int W[3];
				W[0] = A, W[1] = B, W[2] = C;
				rep(k,3)
				{
					rep(f,3)
					{
						if(k == f or (int)V[f].size() <= W[f]) continue;

						int idx = V[f][W[f]], poz = 0;
						poz = idx + (max(0,W[0]-S[0][idx])) + (max(0,W[1]-S[1][idx])) + (max(0,W[2]-S[2][idx]));

						int H[3];
						H[0] = W[0], H[1] = W[1], H[2] = W[2], ++H[f];
						int cost = dp[i][W[0]][W[1]][k]+(poz-i);

						dp[i+1][H[0]][H[1]][f] = min(dp[i+1][H[0]][H[1]][f],cost);
					}
				}
			}
		}
	}

	int wyn = INF;
	rep(i,N) rep(j,N) rep(k,3) wyn = min(wyn,dp[n][i][j][k]);

	if(wyn >= INF) cout << "-1" << '\n';
	else cout << wyn << '\n';
}

int main()
{	
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int T = 1;
	//cin >> T;
	while(T--) solve();

	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 241 ms 762992 KB Output is correct
2 Correct 253 ms 763180 KB Output is correct
3 Correct 258 ms 763204 KB Output is correct
4 Correct 267 ms 763088 KB Output is correct
5 Correct 233 ms 763216 KB Output is correct
6 Correct 235 ms 763216 KB Output is correct
7 Correct 265 ms 763116 KB Output is correct
8 Correct 248 ms 763216 KB Output is correct
9 Correct 257 ms 763216 KB Output is correct
10 Correct 249 ms 763068 KB Output is correct
11 Correct 269 ms 763220 KB Output is correct
12 Correct 267 ms 763220 KB Output is correct
13 Correct 254 ms 763220 KB Output is correct
14 Correct 264 ms 763220 KB Output is correct
15 Correct 246 ms 763060 KB Output is correct
16 Correct 257 ms 763036 KB Output is correct
17 Correct 250 ms 763216 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 241 ms 762992 KB Output is correct
2 Correct 253 ms 763180 KB Output is correct
3 Correct 258 ms 763204 KB Output is correct
4 Correct 267 ms 763088 KB Output is correct
5 Correct 233 ms 763216 KB Output is correct
6 Correct 235 ms 763216 KB Output is correct
7 Correct 265 ms 763116 KB Output is correct
8 Correct 248 ms 763216 KB Output is correct
9 Correct 257 ms 763216 KB Output is correct
10 Correct 249 ms 763068 KB Output is correct
11 Correct 269 ms 763220 KB Output is correct
12 Correct 267 ms 763220 KB Output is correct
13 Correct 254 ms 763220 KB Output is correct
14 Correct 264 ms 763220 KB Output is correct
15 Correct 246 ms 763060 KB Output is correct
16 Correct 257 ms 763036 KB Output is correct
17 Correct 250 ms 763216 KB Output is correct
18 Correct 243 ms 763216 KB Output is correct
19 Correct 265 ms 763184 KB Output is correct
20 Correct 250 ms 763216 KB Output is correct
21 Correct 235 ms 763216 KB Output is correct
22 Correct 256 ms 763220 KB Output is correct
23 Correct 257 ms 763036 KB Output is correct
24 Correct 245 ms 763136 KB Output is correct
25 Correct 258 ms 763216 KB Output is correct
26 Correct 260 ms 763144 KB Output is correct
27 Correct 256 ms 763216 KB Output is correct
28 Correct 239 ms 763048 KB Output is correct
29 Correct 260 ms 763220 KB Output is correct
30 Correct 251 ms 763216 KB Output is correct
31 Correct 266 ms 763220 KB Output is correct
32 Correct 268 ms 763204 KB Output is correct
33 Correct 263 ms 763072 KB Output is correct
34 Correct 250 ms 763220 KB Output is correct
35 Correct 252 ms 763080 KB Output is correct
36 Correct 258 ms 763188 KB Output is correct
37 Correct 268 ms 763032 KB Output is correct
38 Correct 251 ms 763216 KB Output is correct
39 Correct 260 ms 763220 KB Output is correct
40 Correct 268 ms 763220 KB Output is correct
41 Correct 259 ms 763216 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 763120 KB Output is correct
2 Correct 488 ms 763236 KB Output is correct
3 Correct 462 ms 763348 KB Output is correct
4 Correct 465 ms 763216 KB Output is correct
5 Correct 462 ms 763220 KB Output is correct
6 Correct 468 ms 763380 KB Output is correct
7 Correct 468 ms 763220 KB Output is correct
8 Correct 465 ms 763216 KB Output is correct
9 Correct 477 ms 763232 KB Output is correct
10 Correct 498 ms 763048 KB Output is correct
11 Correct 461 ms 763192 KB Output is correct
12 Correct 298 ms 763228 KB Output is correct
13 Correct 338 ms 763216 KB Output is correct
14 Correct 376 ms 763220 KB Output is correct
15 Correct 461 ms 763216 KB Output is correct
16 Correct 452 ms 763188 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 241 ms 762992 KB Output is correct
2 Correct 253 ms 763180 KB Output is correct
3 Correct 258 ms 763204 KB Output is correct
4 Correct 267 ms 763088 KB Output is correct
5 Correct 233 ms 763216 KB Output is correct
6 Correct 235 ms 763216 KB Output is correct
7 Correct 265 ms 763116 KB Output is correct
8 Correct 248 ms 763216 KB Output is correct
9 Correct 257 ms 763216 KB Output is correct
10 Correct 249 ms 763068 KB Output is correct
11 Correct 269 ms 763220 KB Output is correct
12 Correct 267 ms 763220 KB Output is correct
13 Correct 254 ms 763220 KB Output is correct
14 Correct 264 ms 763220 KB Output is correct
15 Correct 246 ms 763060 KB Output is correct
16 Correct 257 ms 763036 KB Output is correct
17 Correct 250 ms 763216 KB Output is correct
18 Correct 243 ms 763216 KB Output is correct
19 Correct 265 ms 763184 KB Output is correct
20 Correct 250 ms 763216 KB Output is correct
21 Correct 235 ms 763216 KB Output is correct
22 Correct 256 ms 763220 KB Output is correct
23 Correct 257 ms 763036 KB Output is correct
24 Correct 245 ms 763136 KB Output is correct
25 Correct 258 ms 763216 KB Output is correct
26 Correct 260 ms 763144 KB Output is correct
27 Correct 256 ms 763216 KB Output is correct
28 Correct 239 ms 763048 KB Output is correct
29 Correct 260 ms 763220 KB Output is correct
30 Correct 251 ms 763216 KB Output is correct
31 Correct 266 ms 763220 KB Output is correct
32 Correct 268 ms 763204 KB Output is correct
33 Correct 263 ms 763072 KB Output is correct
34 Correct 250 ms 763220 KB Output is correct
35 Correct 252 ms 763080 KB Output is correct
36 Correct 258 ms 763188 KB Output is correct
37 Correct 268 ms 763032 KB Output is correct
38 Correct 251 ms 763216 KB Output is correct
39 Correct 260 ms 763220 KB Output is correct
40 Correct 268 ms 763220 KB Output is correct
41 Correct 259 ms 763216 KB Output is correct
42 Correct 269 ms 763120 KB Output is correct
43 Correct 488 ms 763236 KB Output is correct
44 Correct 462 ms 763348 KB Output is correct
45 Correct 465 ms 763216 KB Output is correct
46 Correct 462 ms 763220 KB Output is correct
47 Correct 468 ms 763380 KB Output is correct
48 Correct 468 ms 763220 KB Output is correct
49 Correct 465 ms 763216 KB Output is correct
50 Correct 477 ms 763232 KB Output is correct
51 Correct 498 ms 763048 KB Output is correct
52 Correct 461 ms 763192 KB Output is correct
53 Correct 298 ms 763228 KB Output is correct
54 Correct 338 ms 763216 KB Output is correct
55 Correct 376 ms 763220 KB Output is correct
56 Correct 461 ms 763216 KB Output is correct
57 Correct 452 ms 763188 KB Output is correct
58 Execution timed out 508 ms 763236 KB Time limit exceeded
59 Halted 0 ms 0 KB -