oj.uz

답안 #476744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
476744 2021-09-28T12:41:43 Z SamAnd 세 명의 친구들 (BOI14_friends) C++17
100 / 100
 88 ms 7160 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2000006;
 
int n;
char aa[N], a[N];
 
int pp, ss;
 
int main()
{
    //freopen("input.txt", "r", stdin);
    cin >> n >> aa;
    for (int i = 1; i <= n; ++i)
        a[i] = aa[i - 1];
    if (n % 2 == 0)
    {
        cout << "NOT POSSIBLE" << endl;
        return 0;
    }
    for (int i = 1, j = n / 2 + 2; i <= n / 2; ++i, ++j)
    {
        if (a[i] != a[j])
            break;
        ++pp;
    }
    for (int i = n / 2 + 1, j = n; j > n / 2 + 1; --i, --j)
    {
        if (a[i] != a[j])
            break;
        ++ss;
    }
    bool z2 = false;
    for (int i = 1; i <= n / 2; ++i)
    {
        if (pp >= i - 1 && ss >= (n / 2 - i + 1))
        {
            z2 = true;
            break;
        }
    }
    pp = ss = 0;
    for (int i = 1, j = n / 2 + 1; i <= n / 2; ++i, ++j)
    {
        if (a[i] != a[j])
            break;
        ++pp;
    }
    for (int i = n / 2, j = n; i >= 1; --i, --j)
    {
        if (a[i] != a[j])
            break;
        ++ss;
    }
    bool z1 = false;
    for (int i = n / 2 + 2; i <= n; ++i)
    {
        if (ss >= (n - i) && pp >= (i - n / 2 - 1))
        {
            z1 = true;
            break;
        }
    }
    bool z = true;
    for (int i = 1, j = n / 2 + 2; i <= n / 2; ++i, ++j)
    {
        if (a[i] != a[j])
        {
            z = false;
            break;
        }
    }
    if (!z && !z1 && !z2)
    {
        cout << "NOT POSSIBLE" << endl;
        return 0;
    }
    if (z1 && z2 && !z)
    {
        cout << "NOT UNIQUE" << endl;
        return 0;
    }
    if (z1 || z)
    {
        for (int i = 1; i <= n / 2; ++i)
        {
            cout << a[i];
        }
        cout << endl;
        return 0;
    }
    if (z2)
    {
        for (int i = n / 2 + 2; i <= n; ++i)
        {
            cout << a[i];
        }
        cout << endl;
        return 0;
    }
    return 0;
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 7104 KB Output is correct
2 Correct 80 ms 7128 KB Output is correct
3 Correct 83 ms 7160 KB Output is correct
4 Correct 81 ms 7108 KB Output is correct
5 Correct 81 ms 7096 KB Output is correct
6 Correct 44 ms 6036 KB Output is correct
7 Correct 86 ms 7084 KB Output is correct
8 Correct 41 ms 5516 KB Output is correct
9 Correct 74 ms 6440 KB Output is correct
10 Correct 88 ms 6468 KB Output is correct
11 Correct 38 ms 5108 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 304 KB Output is correct
30 Correct 0 ms 304 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct