oj.uz

답안 #10704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
10704 2014-11-09T05:48:09 Z dohyun0324 세 명의 친구들 (BOI14_friends) C++
0 / 100
 24 ms 18664 KB 
#include<stdio.h>
int dap,cnt,p,n,arr1[2000010],arr2[2000010],s1,s2;
char a[2000010];
int main()
{
    int i;
    scanf("%d",&n);
    scanf("%s",a);
    for(i=0;i<=n/2;i++)
    {
        if(a[i]==a[i+n/2]) arr1[i]=1;
        if(a[i]==a[i+n/2+1]) arr2[i]=1;
    }
    for(i=n/2;i>=0;i--) if(arr1[i]!=1) break;
    s1=n/2-i;
    for(i=0;i<=n/2;i++) if(arr2[i]!=1) break;
    s2=i;
    if(s1+s2==n/2) dap=s2, cnt++;
    if(dap==n/2) cnt=0;
    if(s1+s2>n/2){ printf("NOT UNIQUE"); return 0;}
    for(i=0;i<n/2;i++) if(arr1[i]!=1) break;
    s1=i;
    for(i=n/2-1;i>=0;i--) if(arr2[i]!=1) break;
    s2=n/2-1-i;
    if(s1+s2==n/2)
    {
        if(cnt){printf("NOT UNIQUE"); return 0;}
        else{ dap=n/2; cnt++;}
    }
    if(s1+s2>n/2){printf("NOT UNIQUE"); return 0;}
    if(cnt)
    {
        for(i=0;i<=n/2;i++)
        {
            if(i!=dap) printf("%c",a[i]);
        }
    }
    else printf("NOT POSSIBLE");
    return 0;
}

Subtask #1
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 18664 KB Output is correct
2 Correct 0 ms 18664 KB Output is correct
3 Correct 0 ms 18664 KB Output is correct
4 Correct 0 ms 18664 KB Output is correct
5 Correct 0 ms 18664 KB Output is correct
6 Correct 0 ms 18664 KB Output is correct
7 Correct 0 ms 18664 KB Output is correct
8 Correct 0 ms 18664 KB Output is correct
9 Correct 0 ms 18664 KB Output is correct
10 Correct 0 ms 18664 KB Output is correct
11 Correct 0 ms 18664 KB Output is correct
12 Correct 0 ms 18664 KB Output is correct
13 Correct 0 ms 18664 KB Output is correct
14 Correct 0 ms 18664 KB Output is correct
15 Correct 0 ms 18664 KB Output is correct
16 Correct 0 ms 18664 KB Output is correct
17 Correct 0 ms 18664 KB Output is correct
18 Correct 0 ms 18664 KB Output is correct
19 Correct 0 ms 18664 KB Output is correct
20 Correct 0 ms 18664 KB Output is correct
21 Correct 0 ms 18664 KB Output is correct
22 Correct 0 ms 18664 KB Output is correct
23 Correct 0 ms 18664 KB Output is correct
24 Incorrect 0 ms 18664 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #2
0.0 / 65.0

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