Submission #464044

#	Time	Username	Problem	Language	Result	Execution time	Memory
464044		dutch	Miners (IOI07_miners)	C++17	92 / 100	1576 ms	324 KiB

miners

#include <bits/stdc++.h>
using namespace std;
#define F(z) for(int z=0; z<4; ++z)
#define remax(x, y) x = max(x, y)
#define fill(z) F(a) F(b) F(x) F(y) z[a][b][x][y] = -2e9

int cost(int a, int b, int c){
	int m[3] = {a, b, c};
	sort(m, m+3);
	return -(m[2] == 3) + (unique(m, m+3) - m);
}

int n, dp[4][4][4][4], c[4][4][4][4], ans;
char inp;

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n;
	fill(c);
	c[3][3][3][3] = 0;
	for(int i=0, j; i<n; ++i){
		cin >> inp; j = (inp > 'B') + (inp > 'F');
		swap(c, dp);
		fill(c);
		for(int k : {j, 3}) F(a) F(b) F(x) F(y){
			remax(c[b][k][x][y], dp[a][b][x][y] + cost(a, b, k));
			remax(c[a][b][y][k], dp[a][b][x][y] + cost(x, y, k));
			remax(ans, c[a][b][x][y]);
		}
	}
	cout << ans;
}

• 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: 0 / 8