답안 #931292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931292	2024-02-21T14:37:25 Z	Bulbasheen	세 명의 친구들 (BOI14_friends)	C++14	100 / 100	25 ms	5284 KB

friends

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()

int N, pt, a;
char U[2000010];
bool front, back, uni;

int32_t main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> N;
    if (N%2 == 0){
        cout << "NOT POSSIBLE";
        return 0;
    }
    cin >> U;
    pt = (N-1)/2;
    a = 0;
    front = true;
    while (a < (N-1)/2){
        if (pt > N-1){
            front = false;
            break;
        }
        if (U[pt] != U[a]){
            pt++;
            continue;
        }
        else {
            pt++;
            a++;
        }
    }
    pt = 0;
    a = (N+1)/2;
    back = true;
    while (a < N){
        if (pt > (N-1)/2){
            back = false;
            break;
        }
        if (U[pt] != U[a]){
            pt++;
            continue;
        }
        else{
            pt++;
            a++;
        }
    }
    if (back and front){
        for (int i = 0; i < (N-1)/2; i++){
            if (U[i] != U[i+(N+1)/2]){
                cout << "NOT UNIQUE";
                return 0;
            }
        }
        for (int i = 0; i < (N-1)/2; i++){
            cout << U[i];
        }
    }
    else if (!back and !front){
        cout << "NOT POSSIBLE";
    }
    else if (front){
        for (int i = 0; i < (N-1)/2; i++){
            cout << U[i];
        }
    }
    else{
        for (int i = (N+1)/2; i < N; i++){
            cout << U[i];
        }
    }
}

Subtask #1

35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	464 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	460 KB	Output is correct
29	Correct	0 ms	468 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	500 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	464 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	600 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct

Subtask #2

65.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	5184 KB	Output is correct
2	Correct	22 ms	5212 KB	Output is correct
3	Correct	25 ms	5200 KB	Output is correct
4	Correct	23 ms	5284 KB	Output is correct
5	Correct	23 ms	5204 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	24 ms	5200 KB	Output is correct
8	Correct	6 ms	3928 KB	Output is correct
9	Correct	21 ms	4688 KB	Output is correct
10	Correct	21 ms	4944 KB	Output is correct
11	Correct	6 ms	3676 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	468 KB	Output is correct
43	Correct	0 ms	344 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	344 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	1 ms	468 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct