oj.uz

Submission #41125

# Submission time Handle Problem Language Result Execution time Memory
41125 2018-02-13T03:12:10 Z 14kg Three Friends (BOI14_friends) C++11
100 / 100
 75 ms 19636 KB 
#include <stdio.h>
#define N 2000005

int n, link[N];
char in[N];

int main(){
    int scnt=0, out=0, len=0;
    scanf("%d %s",&n,in+1);

    if(n%2==0){ printf("NOT POSSIBLE"); return 0; }
    for(int i=2; i<=n/2+1; i++){
        int j=n/2+i;
        scnt+=(in[i]==in[j]);
        link[i]=j, link[j]=i;
    }

    if(scnt==n/2) out=1;
    for(int i=2; i<=n; i++){
        int x=i-1, y=link[i];

        scnt-=(in[i]==in[y]);
        link[x]=y, link[y]=x;
        scnt+=(in[x]==in[y]);

        if(scnt==n/2 && out){
            if(out==i-1 && in[i-1]==in[i]) out++;
            else{ printf("NOT UNIQUE"); return 0; }
        }
        else if(scnt==n/2) out=i;
    }

    if(!out){ printf("NOT POSSIBLE"); return 0; }
    for(int i=1; len<n/2; i++){
        if(i==out) continue;
        len++, printf("%c",in[i]);
    }
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:9:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %s",&n,in+1);
                           ^

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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