Submission #95164

#	Time	Username	Problem	Language	Result	Execution time	Memory
95164		FedericoS	Miners (IOI07_miners)	C++14	100 / 100	160 ms	73508 KiB

miners

#include <iostream>
using namespace std;
typedef pair<int,int> pii;

int N;
char c;
int DP[4][4][4][4][100005];
int T[100005];

int C(pii a, int b){
	int A[]={0,0,0,0};
	A[a.first]=1;
	A[a.second]=1;
	A[b]=1;
	return A[1]+A[2]+A[3];
}

int F(pii a, pii b, int k){
	if(k==N) return 0;

	if(!DP[a.first][a.second][b.first][b.second][k])
		DP[a.first][a.second][b.first][b.second][k]=
			max(
				F({a.second,T[k]},b,k+1)+C(a,T[k]),
				F(a,{b.second,T[k]},k+1)+C(b,T[k])
			);

	return DP[a.first][a.second][b.first][b.second][k];
}


int main(){
	cin>>N;
	for(int i=0;i<N;i++){
		cin>>c;
		if(c=='M')
			T[i]=1;
		else if(c=='F')
			T[i]=2;
		else
			T[i]=3;
	}

	cout<<F({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