글 읽기 - 몇일동안 반례를 못찾고 있습니다

ksoosung77 1년 전 0

12%에서 계속 틀리는걸 보아 저가 고려 못한부분이 있는거 같습니다
어디를 놓친걸까요?
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#pragma warning(disable:4996)
#define nINF -1000000000
#define INF 1000000000

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int a,scount,kcount,hcount,skh=0,s=0,k=0,h=0,sk=0,sh=0,kh=0,cani=0;
	char writing;
	cin>>a>>scount>>kcount>>hcount;
	while(a--){
		if(cani==0)cin>>writing;
		else cani=0;
		if(writing=='S'){
			if(a==0){
				s++;
				break;
			}
			a--;
			cin>>writing;
			if(writing=='K'){
				if(a==0){
				sk++;
				break;
				}
				a--;
				cin>>writing;
				if(writing=='H')skh++;
				else{
					 sk++;
					 cani=1;
					 a++;
				}
			}
			else if(writing=='H')sh++;
			else{
				s++;
				cani=1;
				a++;
			}
		}
		else if(writing=='K'){
			if(a==0){
				k++;
				break;
			}
				a--;
				cin>>writing;
				if(writing=='H')kh++;
				else{
					 k++;
					 cani=1;
					 a++;
			}
		}
		else if(writing=='H')h++;
		else{
			cout<<"ERROR\n";
		}
	}
	cout<<"skh:"<<skh<<",sk:"<<sk<<",sh:"<<sh<<",kh:"<<kh<<",s:"<<s<<",k:"<<k<<",h:"<<h<<"\n";
	if(sk>=hcount){
		skh+=hcount;
		hcount=0;
	}
	else {
		skh+=sk;
		hcount-=sk;
	}
	if(sh>=kcount){
		skh+=kcount;
		kcount=0;
	}
	else {
		skh+=sh;
		kcount-=sh;
	}
	if(kh>=scount){
		skh+=scount;
		scount=0;
	}
	else {
		skh+=kh;
		scount-=kh;
	}
	//cout<<"1n:"<<skh<<"\n";
	//cout<<"현황:"<<scount<<","<<kcount<<","<<hcount<<"\n";
	
	int maximum=s>k?k:s,gth=scount>kcount?kcount:scount;
	gth=gth>hcount?hcount:gth;
	gth/=2;
	maximum=maximum>h?h:maximum;
	maximum=maximum>gth?gth:maximum;
	skh+=3*maximum;
	s-=maximum;
	k-=maximum;
	h-=maximum;
	scount-=2*maximum;
	kcount-=2*maximum;
	hcount-=2*maximum;
	maximum=0;
	gth=0;
	//cout<<"1.5:"<<skh<<"\n";
	//cout<<"현황:"<<scount<<","<<kcount<<","<<hcount<<"\n";
	int x=scount,y=kcount,z=hcount,rs=0,rk=0,rh=0;
	if(y>=x){
		a=x;
		cani=1;
	}
	else{
		a=y;
		cani=2;
	}
	//cout<<"c:"<<x<<","<<y<<","<<z<<","<<cani<<"\n";
	if(h>=a){
		gth+=a;
		if(cani==1){
			x=0;
			y-=a;
		}
		else {
			y=0;
			x-=a;
		}
	}
	else {
		gth+=h;
		y-=h;
		x-=h;
	}
	if(z>=y){
		a=y;
		cani=1;
	}
	else{
		a=z;
		cani=2;
	}
	if(s>=a){
		gth+=a;
		if(cani==1){
			y=0;
			z-=a;
		}
		else {
			z=0;
			y-=a;
		}
	}
	else {
		gth+=s;
		y-=s;
		z-=s;
	}
	if(z>=x){
		a=x;
		cani=1;
	}
	else{
		a=z;
		cani=2;
	}
	if(k>=a){
		gth+=a;
		if(cani==1){
			x=0;
			z-=a;
		}
		else {
			z=0;
			x-=a;
		}
	}
	else {
		gth+=k;
		x-=k;
		z-=k;
	}
	if(gth>=maximum){
		maximum=gth;
		rs=x;
		rk=y;
		rh=z;
	}
	//cout<<"now xyz:"<<x<<","<<y<<","<<z<<"\n";
	//cout<<"gth , maximum:"<<gth<<","<<maximum<<"\n";
	gth=0;
	x=scount,y=kcount,z=hcount;
	//cout<<"now max:"<<rs<<","<<rk<<","<<rh<<"\n";
	if(z>=x){
		a=x;
		cani=1;
	}
	else{
		a=z;
		cani=2;
	}
	if(k>=a){
		gth+=a;
		if(cani==1){
			x=0;
			z-=a;
		}
		else {
			z=0;
			x-=a;
		}
	}
	else {
		gth+=k;
		x-=k;
		z-=k;
	}
	if(y>=x){
		a=x;
		cani=1;
	}
	else{
		a=y;
		cani=2;
	}
	if(h>=a){
		gth+=a;
		if(cani==1){
			x=0;
			y-=a;
		}
		else {
			y=0;
			x-=a;
		}
	}
	else {
		gth+=h;
		y-=h;
		x-=h;
	}
	if(z>=y){
		a=y;
		cani=1;
	}
	else{
		a=z;
		cani=2;
	}
	if(s>=a){
		gth+=a;
		if(cani==1){
			y=0;
			z-=a;
		}
		else {
			z=0;
			y-=a;
		}
	}
	else {
		gth+=s;
		y-=s;
		z-=s;
	}
	if(gth>=maximum){
		maximum=gth;
		rs=x;
		rk=y;
		rh=z;
	}
	//cout<<"now xyz2:"<<x<<","<<y<<","<<z<<"\n";
	//cout<<"gth , maximum:"<<gth<<","<<maximum<<"\n";
	gth=0;
	x=scount,y=kcount,z=hcount;
	//cout<<"now max2:"<<rs<<","<<rk<<","<<rh<<"\n";
	if(z>=x){
		a=x;
		cani=1;
	}
	else{
		a=z;
		cani=2;
	}
	if(k>=a){
		gth+=a;
		if(cani==1){
			x=0;
			z-=a;
		}
		else {
			z=0;
			x-=a;
		}
	}
	else {
		gth+=k;
		x-=k;
		z-=k;
	}
	if(z>=y){
		a=y;
		cani=1;
	}
	else{
		a=z;
		cani=2;
	}
	if(s>=a){
		gth+=a;
		if(cani==1){
			y=0;
			z-=a;
		}
		else {
			z=0;
			y-=a;
		}
	}
	else {
		gth+=s;
		y-=s;
		z-=s;
	}
	if(y>=x){
		a=x;
		cani=1;
	}
	else{
		a=y;
		cani=2;
	}
	if(h>=a){
		gth+=a;
		if(cani==1){
			x=0;
			y-=a;
		}
		else {
			y=0;
			x-=a;
		}
	}
	else {
		gth+=h;
		y-=h;
		x-=h;
	}
	if(gth>=maximum){
		maximum=gth;
		rs=x;
		rk=y;
		rh=z;
	}
	//cout<<"now xyz3:"<<x<<","<<y<<","<<z<<"\n";
	//cout<<"gth , maximum:"<<gth<<","<<maximum<<"\n";
	//cout<<"now max3:"<<rs<<","<<rk<<","<<rh<<"\n";
	skh+=maximum;
	scount=rs;
	kcount=rk;
	hcount=rh;
	//cout<<"2n:"<<skh<<"\n";
	//cout<<"현황:"<<scount<<","<<kcount<<","<<hcount<<"\n";
	a=scount>=kcount?kcount:scount;
	a=a>=hcount?hcount:a;
	skh+=a;
	cout<<skh;
}
댓글을 작성하려면 로그인해야 합니다.
문제

문제

출처

ICPC

몇일동안 반례를 못찾고 있습니다

ksoosung77 1년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말
