Submission #18713

#	Time	Username	Problem	Language	Result	Execution time	Memory
18713		suhgyuho_william	JOIOJI (JOI14_joioji)	C++98	100 / 100	46 ms	6952 KiB

joioji

#include <stdio.h>
#include <map>

using namespace std;

int N,ans;
char a[200010];
struct data{
	int j,o,i;
	bool operator < (const data x) const{
		if(j != x.j) return j < x.j;
		if(o != x.o) return o < x.o;
		return i < x.i;
	}
	data(int ij,int io,int ii){
		j = ij;
		o = io;
		i = ii;
	}
};
map<data,int> Map;

int main(){
	int i,tmp;
	int cj,co,ci;
	cj = co = ci = 0;
	//freopen("input.txt","r",stdin);

	scanf("%d\n",&N);
	gets(a);
	Map[data(0,0,0)] = 0;
	for(i=1; i<=N; i++){
		if(a[i-1] == 'J'){
			cj++;
		}else if(a[i-1] == 'O'){
			co++;
		}else{
			ci++;
		}
		if(Map.find(data(cj-co,co-ci,ci-cj)) != Map.end()){
            tmp = Map[data(cj-co,co-ci,ci-cj)];
            if(ans < i-tmp) ans = i-tmp;
		}else{
			Map[data(cj-co,co-ci,ci-cj)] = i;
		}
	}
	printf("%d\n",ans);

	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 80 / 80