제출 #707735

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

miners

#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int ans (int pos, vector <char> mine1, vector <char> mine2) {
	if (pos == n) {
		return 0;
	}
	mine1.push_back(s[pos]);
	map <char, int> ds;
	for (int i = (int)mine1.size() - 1; i >= max(0, (int)mine1.size() - 3); i--) {
		ds[mine1[i]]++;
	}
	int ret = ans(pos + 1, mine1, mine2) + (int)ds.size();
	ds.clear();
	mine1.pop_back();
	mine2.push_back(s[pos]);
	for (int i = (int)mine2.size() - 1; i >= max(0, (int)mine2.size() - 3); i--) {
		ds[mine2[i]]++;
	}
	ret = max(ret, ans(pos + 1, mine1, mine2) + (int)ds.size());
	return ret;
}
int main () {
	cin >> n >> s;
	cout << ans(0, {}, {});
}

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