제출 #636319

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
636319		gromperen	Miners (IOI07_miners)	C++14	100 / 100	231 ms	852 KiB

miners

#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int MAXN = 1e5+5;
int dp[2][4][4][4][4];
const int INF = 1e9+7;

int f(int a, int b, int c) {
	int s = 0;
	for(int i = 1; i <= 3; ++i)
		if(a == i || b == i || c == i) s++;
	return s;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	memset(dp, -INF, sizeof(dp));

	int n; cin >> n;
	string s; cin >> s;
	vector<int>a(n);
	for (int i = 0; i < n; ++i) {
		if (s[i] == 'M') a[i] = 1;
		else if (s[i] == 'F') a[i] = 2;
		else if (s[i] == 'B') a[i] = 3;
	}
	dp[1][0][0][0][0] = 0;
	int ans = 0;
	for (int i = 0; i <n; ++i) {
		bool ic = i%2;
		int p = a[i];
		//cerr << p << " ";
		for (int j = 0; j <= 3; ++j) {for (int k = 0; k <= 3; ++k) {
			for (int l = 0; l <= 3; ++l) {for (int m = 0; m <= 3; ++m) {
				int inc = f(p,j,k);
				//if (p == 0 || j == 0 || k == 0) inc--;
				dp[ic][p][j][l][m] = max(dp[ic][p][j][l][m],
							inc+dp[ic^1][j][k][l][m]);
				dp[ic][l][m][p][j] = max(dp[ic][l][m][p][j],
							inc+dp[ic^1][l][m][j][k]);
			}
			}
		}
		}
	}

	for (int j = 0; j <= 3; ++j) {for (int k = 0; k <= 3; ++k) {
		for (int l = 0; l <= 3; ++l) {for (int m = 0; m <= 3; ++m) {
			ans = max(ans, dp[0][j][k][l][m]);
			ans = max(ans, dp[1][j][k][l][m]);
		}}}}
	cout << ans << "\n";

	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 7 / 7
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 8 / 8
• Subtask 11: 8 / 8
• Subtask 12: 8 / 8