oj.uz

답안 #10952

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
10952 2014-11-13T05:55:12 Z dohyun0324 JOIOJI (JOI14_joioji) C++
0 / 100
 4 ms 9352 KB 
#include<stdio.h>
#include<map>
using namespace std;
map<long long,long long>m;
char s[200010];
long long int p,len,dap,a[200010],b[200010],c[200010];
long long int arr1[200010],arr2[200010];
int main()
{
    int i;
    scanf("%lld",&len);
    scanf("%s",s);
    for(i=0;i<len;i++)
    {
        a[i]=a[i-1]; b[i]=b[i-1]; c[i]=c[i-1];
        if(s[i]=='J') a[i]=a[i-1]+1;
        if(s[i]=='O') b[i]=b[i-1]+1;
        if(s[i]=='I') c[i]=c[i-1]+1;
    }
    for(i=0;i<len;i++) arr1[i]=a[i]-b[i]+100000, arr2[i]=b[i]-c[i]+100000;
    for(i=0;i<len;i++)
    {
        if(arr1[i]==100000 && arr2[i]==100000 && dap<i+1) dap=i+1;
    }
    for(i=0;i<len;i++)
    {
        if(m[arr1[i]*1000000+arr2[i]])
        {
            p=m[arr1[i]*1000000+arr2[i]]-1;
            if(dap<i-p) dap=i-p;
        }
        m[arr1[i]*1000000+arr2[i]]=i+1;
    }
    printf("%lld",dap);
    return 0;
}

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 9220 KB Output is correct
2 Correct 0 ms 9220 KB Output is correct
3 Correct 0 ms 9220 KB Output is correct
4 Incorrect 0 ms 9220 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 9220 KB Output is correct
2 Incorrect 0 ms 9220 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 9352 KB Output isn't correct
2 Halted 0 ms 0 KB -