제출 #69001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69001		TuGSGeReL	Miners (IOI07_miners)	C++14	100 / 100	96 ms	32528 KiB

miners

#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back
#define ss second
#define ff first
#define ext exit(0)
using namespace std;
int n,i,j,p,t,k,a,dp[100001][3][3][3][3],ans;
string s;
inline int sol(int o, int oo , int ooo){
	if(o==oo && oo==ooo) return 1;
	else if(o==oo || o==ooo || ooo==oo) return 2;
	else return 3;
}
int main (){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>s;
	for(i=0;i<n;i++){
		if(s[i]=='M') a=0;
		else if(s[i]=='B') a=1;
		else a=2;
		for(j=0;j<3;j++){
			for(k=0;k<3;k++){
				for(t=0;t<3;t++){
					for(p=0;p<3;p++){
						dp[i+1][k][a][t][p]=max(dp[i+1][k][a][t][p],dp[i][j][k][t][p]+sol(k,a,j));
						dp[i+1][j][k][p][a]=max(dp[i+1][j][k][p][a],dp[i][j][k][t][p]+sol(t,a,p));
					}
				}
			}
		}
	}
	for(j=0;j<3;j++){
		for(k=0;k<3;k++){
			for(t=0;t<3;t++){
				for(p=0;p<3;p++) ans=max(ans,dp[n][j][k][t][p]-6);
			}
		}
	}
	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