제출 #991870

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991870		tamir1	Miners (IOI07_miners)	C++17	25 / 100	3 ms	860 KiB

miners

#include<bits/stdc++.h>
using namespace std;
int n,i,j,ans,x[100005],p,q;
string s;
array<int,3> a,b;
int give(int a,int b,int c){
	int ans=0;
	if(a==1 || b==1 || c==1) ans++;
	if(a==2 || b==2 || c==2) ans++;
	if(a==3 || b==3 || c==3) ans++;
	return ans;
}
array<int,3> split(array<int,3> a,int val){
	return {val,a[0],a[1]};
}
int main(){
	cin >> n >> s;
	for(i=0;i<n;i++){
		if(s[i]=='M') x[i]=1;
		if(s[i]=='F') x[i]=2;
		if(s[i]=='B') x[i]=3;
	}
	for(i=0;i<n;i++){
		if(a==b){
			a=split(a,x[i]);
			ans+=give(a[0],a[1],a[2]);
			continue;
		}
		p=give(x[i],a[0],a[1]);
		q=give(x[i],b[0],b[1]);
		if(p>q){
			a=split(a,x[i]);
			ans+=p;
			continue;
		}
		else{
			b=split(b,x[i]);
			ans+=q;
			continue;
		}
	}
	cout << ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 7 / 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