제출 #583265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583265		beaconmc	Miners (IOI07_miners)	C++14	100 / 100	137 ms	1328 KiB

miners

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
#define FOR(i,x,y) for(ll i = x; i<y; i++)
 
ll dp[2][4][4][4][4];
 
int main(){
	ll n;
	cin >> n;
	string sussy;

 
	cin >> sussy;
 
	vector<ll> food(n+1);
 
	FOR(i,1,n+1){
		if (sussy[i-1] == 'M') food[i] = 1;
		if (sussy[i-1] == 'F') food[i] = 2;
		if (sussy[i-1] == 'B') food[i] = 3;
	}
 
	FOR(i,0,2){
		FOR(j,0,4){
			FOR(k,0,4){
				FOR(l,0,4){
					FOR(m,0,4){
						dp[i][j][k][l][m] = -1;
					}
				}
			}
		}
	}


	dp[0][0][0][0][0] = 0;
 
	FOR(i,1,n+1){
		FOR(j,0,4){
			FOR(k,0,4){
				FOR(l,0,4){
					FOR(m,0,4){
						if (dp[0][j][k][l][m] == -1) continue;
						ll sus = 1;
 
						if (food[i] != j && j!=0) sus += 1;
						if (food[i] != k && k!=0) sus += 1;
						if (j == k && j!=0 && k!=0 && (food[i] != j || food[i] != k )) sus -= 1;
 
						dp[1][k][food[i]][l][m] = max(dp[1][k][food[i]][l][m], dp[0][j][k][l][m] + sus);
 
						sus = 1;
 
						if (food[i] != l && l!=0) sus += 1;
						if (food[i] != m && m!=0) sus += 1;
						if (l==m && l!=0 && m!=0 && (food[i] != l || food[i] != m )) sus -= 1;
 
						dp[1][j][k][m][food[i]] = max(dp[1][j][k][m][food[i]], dp[0][j][k][l][m] + sus);
					}
				}
			}
		}
		FOR(j,0,4){
			FOR(k,0,4){
				FOR(l,0,4){
					FOR(m,0,4){
						dp[0][j][k][l][m] = dp[1][j][k][l][m];
					}
				}
			}
		}
	}

	ll ans = 0;
 
 
	FOR(j,0,4){
		FOR(k,0,4){
			FOR(l,0,4){
				FOR(m,0,4){
					ans = max(ans,dp[1][j][k][l][m]);
				}
			}
		}
	}
	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: 8 / 8