oj.uz

답안 #136892

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136892 2019-07-26T13:09:08 Z SirCeness Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
0 / 100
 500 ms 774584 KB 
#include <bits/stdc++.h>

using namespace std;
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define bas(x) #x << ": " << x << " "
#define prarr(x, n) cout << #x << ": "; for (int qsd = 0; qsd < n; qsd++) cout << x[qsd] << " "; cout << endl;
#define prarrv(x) cout << #x << ": "; for (int qsd = 0; qsd < (int)x.size(); qsd++) cout << x[qsd] << " "; cout << endl;
#define ppair(x) "(" << x.first << ", " << x.second << ")"
#define inside sl<=l&&r<=sr
#define outside sr<l||r<sl

typedef long long ll;

string s;

int dist(string str){
	string ana = s;
	ll ans = 0;
	int say = 0;
	for (int i = str.size()-1; i >= 0; i--){
		for (int j = ana.size()-1; j >= 0; j--){
			if (ana[j] == str[i]){
				ana[j] = 'x';
				say++;
				break;
			} else if (ana[j] != 'x') ans++;
		}
	}
	if (say != str.size()) return 1000000000;
	return ans;
}

int dp[404][404][404][3];
vector<int> rler, gler, yler;

int f(int r, int g, int y, int last){
	if (dp[r][g][y][last] != -1) return dp[r][g][y][last];
	int minn = 1000000000;
	if (r > 0 && last != 0){
		int ret = f(r-1, g, y, 0);
		ret += max(0, (int)s.size() - (r+g+y) - rler[rler.size()-r]);
		minn = min(minn, ret);
	} 
	if (g > 0 && last != 1){
		int ret = f(r, g-1, y, 1);
		ret += max(0, (int)s.size() - (r+g+y) - gler[gler.size()-g]);
		minn = min(minn, ret);
	} 
	if (y > 0 && last != 2){
		int ret = f(r, g, y-1, 2);
		ret += max(0, (int)s.size() - (r+g+y) - yler[yler.size()-y]);
		minn = min(minn, ret);
	}
	if (g == 0 && r == 0 && y == 0){
		return dp[r][g][y][last] = 0;
	} 
	return dp[r][g][y][last] = minn;
}

int main(){
	//freopen("in", "r", stdin);
	//freopen("out", "w", stdout);
	
	int n;
	cin >> n;
	cin >> s;

	for (int i1 = 0; i1 < 404; i1++)
		for (int i2 = 0; i2 < 404; i2++)
			for (int i3 = 0; i3 < 404; i3++)
				for (int i4 = 0; i4 < 3; i4++)
					dp[i1][i2][i3][i4] = -1;

	int r = 0, g = 0, y = 0;
	for (int i = 0; i < n; i++){
		r += s[i] == 'R';
		g += s[i] == 'G';
		y += s[i] == 'Y';
		if (s[i] == 'R') rler.pb(i);
		else if (s[i] == 'G') gler.pb(i);
		else yler.pb(i);
	}
	//cout << f(0, 1, 0, 0) << endl;
	int ans = f(r, g, y, -1);
	if (ans >= 1000000000) cout << -1 << endl;
	else cout << ans << endl;
	//cout << "bitti" << endl;

}

Compilation message

joi2019_ho_t3.cpp: In function 'int dist(std::__cxx11::string)':
joi2019_ho_t3.cpp:31:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (say != str.size()) return 1000000000;
      ~~~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:39:22: warning: array subscript is below array bounds [-Warray-bounds]
  if (dp[r][g][y][last] != -1) return dp[r][g][y][last];
      ~~~~~~~~~~~~~~~~^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 660 ms 774580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 660 ms 774580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 749 ms 774584 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 660 ms 774580 KB Time limit exceeded
2 Halted 0 ms 0 KB -