oj.uz

답안 #18539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18539 2016-02-08T10:06:27 Z choyi0521 JOIOJI (JOI14_joioji) C++14
20 / 100
 37 ms 5896 KB 
#include<stdio.h>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
int n,x,y,z,res;
char str[200001];
map<ll,int> mp;
int main(){
	scanf("%d %s", &n, str);
	mp[0] = -1;
	for (int i = 0; i < n; i++) {
		if (str[i] == 'J') x++;
		else if (str[i] == 'O') y++;
		else z++;
		if (x&&y&&z) x--, y--, z--;
		ll h = ((ll)x*1e12) + ((ll)y*1e6) + z;
		auto it = mp.find(h);
		if (it == mp.end()) mp[h]=i;
		else res = max(res,i - it->second);
	}
	printf("%d", res);
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1408 KB Output is correct
2 Correct 0 ms 1408 KB Output is correct
3 Correct 0 ms 1408 KB Output is correct
4 Correct 0 ms 1408 KB Output is correct
5 Correct 0 ms 1408 KB Output is correct
6 Correct 0 ms 1408 KB Output is correct
7 Correct 0 ms 1408 KB Output is correct
8 Correct 0 ms 1408 KB Output is correct
9 Correct 0 ms 1408 KB Output is correct
10 Correct 0 ms 1408 KB Output is correct
11 Correct 0 ms 1408 KB Output is correct
12 Correct 0 ms 1408 KB Output is correct
13 Correct 0 ms 1408 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1408 KB Output is correct
2 Correct 0 ms 1408 KB Output is correct
3 Correct 0 ms 1408 KB Output is correct
4 Correct 0 ms 1408 KB Output is correct
5 Correct 0 ms 1408 KB Output is correct
6 Correct 0 ms 1408 KB Output is correct
7 Correct 1 ms 1408 KB Output is correct
8 Correct 0 ms 1408 KB Output is correct
9 Correct 0 ms 1408 KB Output is correct
10 Correct 0 ms 1540 KB Output is correct

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1540 KB Output is correct
2 Correct 6 ms 1936 KB Output is correct
3 Correct 10 ms 2332 KB Output is correct
4 Correct 19 ms 3124 KB Output is correct
5 Correct 29 ms 4180 KB Output is correct
6 Correct 35 ms 4312 KB Output is correct
7 Correct 27 ms 4708 KB Output is correct
8 Correct 33 ms 4180 KB Output is correct
9 Correct 37 ms 4444 KB Output is correct
10 Correct 34 ms 4180 KB Output is correct
11 Correct 20 ms 5896 KB Output is correct
12 Correct 13 ms 2992 KB Output is correct
13 Correct 15 ms 2332 KB Output is correct
14 Incorrect 24 ms 5368 KB Output isn't correct
15 Halted 0 ms 0 KB -