oj.uz

Submission #10693

# Submission time Handle Problem Language Result Execution time Memory
10693 2014-11-05T08:45:43 Z baneling100 Three Friends (BOI14_friends) C++
100 / 100
 16 ms 3040 KB 
#include <stdio.h>
#include <vector>

using namespace std;

int N, Size, Left[3], Right[3];
char S[2000005];

void Check(int L1, int R1, int L2, int R2) {

    int i, j, Num, Cnt=0;

    for(i=L1, j=L2 ; i<=R1 && j<=R2 ; i++, j++) {
        if(S[i]!=S[j]) {
            Num=i;
            Cnt++;
            j--;
        }
        if(Cnt>1)
            return;
    }
    if(!Cnt)
        Num=R1;
    Size++;
    Left[Size]=L2;
    Right[Size]=R2;
}

int Same(void) {

    int i, j;

    for(i=Left[1], j=Left[2] ; i<=Right[1] && j<=Right[2] ; i++, j++)
        if(S[i]!=S[j])
            return 0;
    return 1;
}

int main(void) {

    int mid;

    scanf("%d %s",&N,&S[1]);

    if(!(N%2)) {
        printf("NOT POSSIBLE");
        return 0;
    }
    mid=(N+1)/2;
    Check(1,mid,mid+1,N);
    Check(mid,N,1,mid-1);
    if(Size==0)
        printf("NOT POSSIBLE");
    else if(Size==1 || (Size==2 && Same())) {
        S[Right[1]+1]=NULL;
        printf("%s",&S[Left[1]]);
    }
    else
        printf("NOT UNIQUE");

    return 0;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3040 KB Output is correct
2 Correct 0 ms 3040 KB Output is correct
3 Correct 0 ms 3040 KB Output is correct
4 Correct 0 ms 3040 KB Output is correct
5 Correct 0 ms 3040 KB Output is correct
6 Correct 0 ms 3040 KB Output is correct
7 Correct 0 ms 3040 KB Output is correct
8 Correct 0 ms 3040 KB Output is correct
9 Correct 0 ms 3040 KB Output is correct
10 Correct 0 ms 3040 KB Output is correct
11 Correct 0 ms 3040 KB Output is correct
12 Correct 0 ms 3040 KB Output is correct
13 Correct 0 ms 3040 KB Output is correct
14 Correct 0 ms 3040 KB Output is correct
15 Correct 0 ms 3040 KB Output is correct
16 Correct 0 ms 3040 KB Output is correct
17 Correct 0 ms 3040 KB Output is correct
18 Correct 0 ms 3040 KB Output is correct
19 Correct 0 ms 3040 KB Output is correct
20 Correct 0 ms 3040 KB Output is correct
21 Correct 0 ms 3040 KB Output is correct
22 Correct 0 ms 3040 KB Output is correct
23 Correct 0 ms 3040 KB Output is correct
24 Correct 0 ms 3040 KB Output is correct
25 Correct 0 ms 3040 KB Output is correct
26 Correct 0 ms 3040 KB Output is correct
27 Correct 0 ms 3040 KB Output is correct
28 Correct 0 ms 3040 KB Output is correct
29 Correct 0 ms 3040 KB Output is correct
30 Correct 0 ms 3040 KB Output is correct
31 Correct 0 ms 3040 KB Output is correct
32 Correct 0 ms 3040 KB Output is correct
33 Correct 0 ms 3040 KB Output is correct
34 Correct 0 ms 3040 KB Output is correct
35 Correct 0 ms 3040 KB Output is correct
36 Correct 0 ms 3040 KB Output is correct
37 Correct 0 ms 3040 KB Output is correct
38 Correct 0 ms 3040 KB Output is correct
39 Correct 0 ms 3040 KB Output is correct
40 Correct 0 ms 3040 KB Output is correct
41 Correct 0 ms 3040 KB Output is correct
42 Correct 0 ms 3040 KB Output is correct
43 Correct 0 ms 3040 KB Output is correct
44 Correct 0 ms 3040 KB Output is correct
45 Correct 0 ms 3040 KB Output is correct
46 Correct 0 ms 3040 KB Output is correct
47 Correct 0 ms 3040 KB Output is correct
48 Correct 0 ms 3040 KB Output is correct
49 Correct 0 ms 3040 KB Output is correct
50 Correct 0 ms 3040 KB Output is correct
51 Correct 0 ms 3040 KB Output is correct
52 Correct 0 ms 3040 KB Output is correct
53 Correct 0 ms 3040 KB Output is correct
54 Correct 0 ms 3040 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 3040 KB Output is correct
2 Correct 12 ms 3040 KB Output is correct
3 Correct 12 ms 3040 KB Output is correct
4 Correct 8 ms 3040 KB Output is correct
5 Correct 4 ms 3040 KB Output is correct
6 Correct 4 ms 3040 KB Output is correct
7 Correct 16 ms 3040 KB Output is correct
8 Correct 8 ms 3040 KB Output is correct
9 Correct 8 ms 3040 KB Output is correct
10 Correct 8 ms 3040 KB Output is correct
11 Correct 8 ms 3040 KB Output is correct
12 Correct 0 ms 3040 KB Output is correct
13 Correct 0 ms 3040 KB Output is correct
14 Correct 0 ms 3040 KB Output is correct
15 Correct 0 ms 3040 KB Output is correct
16 Correct 0 ms 3040 KB Output is correct
17 Correct 0 ms 3040 KB Output is correct
18 Correct 0 ms 3040 KB Output is correct
19 Correct 0 ms 3040 KB Output is correct
20 Correct 0 ms 3040 KB Output is correct
21 Correct 0 ms 3040 KB Output is correct
22 Correct 0 ms 3040 KB Output is correct
23 Correct 0 ms 3040 KB Output is correct
24 Correct 0 ms 3040 KB Output is correct
25 Correct 0 ms 3040 KB Output is correct
26 Correct 0 ms 3040 KB Output is correct
27 Correct 0 ms 3040 KB Output is correct
28 Correct 0 ms 3040 KB Output is correct
29 Correct 0 ms 3040 KB Output is correct
30 Correct 0 ms 3040 KB Output is correct
31 Correct 0 ms 3040 KB Output is correct
32 Correct 0 ms 3040 KB Output is correct
33 Correct 0 ms 3040 KB Output is correct
34 Correct 0 ms 3040 KB Output is correct
35 Correct 0 ms 3040 KB Output is correct
36 Correct 0 ms 3040 KB Output is correct
37 Correct 0 ms 3040 KB Output is correct
38 Correct 0 ms 3040 KB Output is correct
39 Correct 0 ms 3040 KB Output is correct
40 Correct 0 ms 3040 KB Output is correct
41 Correct 0 ms 3040 KB Output is correct
42 Correct 0 ms 3040 KB Output is correct
43 Correct 0 ms 3040 KB Output is correct
44 Correct 0 ms 3040 KB Output is correct
45 Correct 0 ms 3040 KB Output is correct
46 Correct 0 ms 3040 KB Output is correct
47 Correct 0 ms 3040 KB Output is correct
48 Correct 0 ms 3040 KB Output is correct
49 Correct 0 ms 3040 KB Output is correct
50 Correct 0 ms 3040 KB Output is correct
51 Correct 0 ms 3040 KB Output is correct
52 Correct 0 ms 3040 KB Output is correct
53 Correct 0 ms 3040 KB Output is correct
54 Correct 0 ms 3040 KB Output is correct