Submission #18544

#	Time	Username	Problem	Language	Result	Execution time	Memory
18544		choyi0521	JOIOJI (JOI14_joioji)	C++14	100 / 100	37 ms	6952 KiB

joioji

#include<stdio.h>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
int n,x,y,res;
char str[200001];
map<pair<int,int>,int> mp;
int main(){
	scanf("%d %s", &n, str);
	mp[{0, 0}] = -1;
	for (int i = 0; i < n; i++) {
		if (str[i] == 'J') x++;
		else if (str[i] == 'O') y++;
		else x--,y--;
		auto it = mp.find({ x,y });
		if (it == mp.end()) mp[{x, y}] = i;
		else res = max(res,i - it->second);
	}
	printf("%d", res);
	return 0;
}

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