제출 #344976

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344976		Iwanttobreakfree	Miners (IOI07_miners)	C++98	34 / 100	7 ms	876 KiB

miners

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
int ship,production=0,cont1,cont2,production1,production2;
using namespace std;
string mine1;
string mine2;
int main(){
	while(cin>>ship){
	char food[ship];
	for(int a=0;a<ship;a++){
		cin>>food[a];
	}
	cont1=1;
	cont2=0;
	mine1[0]=food[0];
	production=1;
	
	for(int b=1;b<ship;b++){	
		if(cont1==1&&cont2==0){
			if(food[b]!=mine1[cont1-1]) mine1[cont1]=food[b],cont1++,production+=2;
			else mine2[cont2]=food[b],cont2++,production++;
		}
		else if(cont1>=2&&cont2==0){
			if(food[b]!=mine1[cont1-1]&&mine1[cont1-1]!=mine1[cont1-2]&&food[b]!=mine1[cont1-2]) mine1[cont1]=food[b],cont1++,production+=3;
			else mine2[cont2]=food[b],cont2++,production++;
		}
		else if(cont1==1&&cont2==1){
			if(food[b]!=mine1[cont1-1]) mine1[cont1]=food[b],cont1++,production+=2;
			else if(food[b]!=mine2[cont2-1]) mine2[cont2]=food[b],cont2++,production+=2;
			else mine1[cont1]=food[b],cont1++,production++;
		}
		else if(cont1>=2&&cont2==1){
			if(food[b]!=mine1[cont1-1]&&mine1[cont1-1]!=mine1[cont1-2]&&food[b]!=mine1[cont1-2]) mine1[cont1]=food[b],cont1++,production+=3;
			else if(food[b]!=mine2[cont2-1])mine2[cont2]=food[b],cont2++,production+=2;
			else if(food[b]!=mine1[cont1-1]||food[b]!=mine1[cont1-2])mine1[cont1]=food[b],cont1++,production+=2;
			else mine1[cont1]=food[b],cont1++,production++;
		}
		else{
		if(food[b]!=mine1[cont1-1]&&mine1[cont1-1]!=mine1[cont1-2]&&food[b]!=mine1[cont1-2]) mine1[cont1]=food[b],cont1++,production+=3;
		else if(food[b]!=mine2[cont2-1]&&mine2[cont2-1]!=mine2[cont2-2]&&food[b]!=mine2[cont2-2]) mine2[cont2]=food[b],cont2++,production+=3;
		else if(food[b]!=mine1[cont1-1]||food[b]!=mine1[cont1-2])mine1[cont1]=food[b],cont1++,production+=2;
		else if(food[b]!=mine2[cont2-1]||food[b]!=mine2[cont2-2])mine2[cont2]=food[b],cont2++,production+=2;
		else mine1[cont1]=food[b],cont1++,production++;
	}
	}
	cout<<production<<endl;	
}
	return 0;
}

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