제출 #207034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207034		Saboon	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	15 / 100	711 ms	752048 KiB

joi2019_ho_t3

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
 
const int maxn = 400;
const int inf = 1e9;

int dp[maxn][maxn][maxn][3];

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	string s;
	cin >> n >> s;
	vector<int> G, R, Y;
	for (int i = 0; i < n; i++){
		if (s[i] == 'G')
			G.push_back(i);
		else if (s[i] == 'R')
			R.push_back(i);
		else
			Y.push_back(i);
	}
	memset(dp, 63, sizeof dp);
	for (int g = 0; g <= (int)G.size(); g++){
		for (int r = 0; r <= (int)R.size(); r++){
			for (int y = 0; y <= (int)Y.size(); y++){
				if (g + r + y == 0){
					dp[g][r][y][0] = dp[g][r][y][1] = dp[g][r][y][2] = 0;
					continue;
				}
				if (2 * max({g, r, y}) - 1 > g + r + y)
					continue;
				int now = g + r + y - 1;
				if (g > 0){
					int me = G[g - 1];
					dp[g][r][y][0] = min(dp[g-1][r][y][1], dp[g-1][r][y][2]) + abs(now-me);
				}
				if (r > 0){
					int me = R[r - 1];
					dp[g][r][y][1] = min(dp[g][r-1][y][0], dp[g][r-1][y][2]) + abs(now-me);
				}
				if (y > 0){
					int me = Y[y - 1];
					dp[g][r][y][2] = min(dp[g][r][y-1][0], dp[g][r][y-1][1]) + abs(now-me);
				}
			}
		}
	}
	int g = (int)G.size(), r = (int)R.size(), y = (int)Y.size();
	int answer = min({dp[g][r][y][0], dp[g][r][y][1], dp[g][r][y][2]});
	if (answer > n * n)
		answer = -1;
	else
		answer /= 2;
	cout << answer << '\n';
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 55
• Subtask 3: 15 / 15
• Subtask 4: 0 / 25