제출 #707779

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707779		TAhmed33	Miners (IOI07_miners)	C++98	100 / 100	1068 ms	147052 KiB

miners

#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> adds;
int dp[100001][4][4][4][4];
int ans (int pos, int a, int b, int c, int d) {
	int &ret = dp[pos][a][b][c][d];
	if (ret != -1) return ret;
	if (pos == n) {
		return ret = 0;
	}
	map <int, int> distinct;
	if (a != 0) distinct[a]++;
	if (b != 0) distinct[b]++;
	distinct[adds[pos]]++;
	int x = ans(pos + 1, b, adds[pos], c, d) + (int)distinct.size();
	map <int, int> distinct2;
	if (c != 0) distinct2[c]++;
	if (d != 0) distinct2[d]++;
	distinct2[adds[pos]]++;
	x = max(x, ans(pos + 1, a, b, d, adds[pos]) + (int)distinct2.size());
	return ret = x;
}
int main () {
	memset(dp, -1, sizeof(dp));
	string s;
	cin >> n >> s;
	for (auto i : s) {
		if (i == 'M') adds.push_back(1);
		else if (i == 'F') adds.push_back(2);
		else adds.push_back(3);
	}
	cout << ans(0, 0, 0, 0, 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