oj.uz

Submission #398814

# Submission time Handle Problem Language Result Execution time Memory
398814 2021-05-04T20:32:12 Z ALI_SQUARED Three Friends (BOI14_friends) C++14
100 / 100
 104 ms 15260 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    cin >> n;

    string s, a = "", b = "", c = "", d = "", answer1 = "", answer2 = "";
    cin >> s;

    if (n % 2 == 0){cout << "NOT POSSIBLE"; return 0;}

    for (int i = 0; i < n; i++){
        if (i < n/2) a += s[i], c += s[i];
        else if (i == n/2) b += s[i], c += s[i];
        else b += s[i], d += s[i];
    }

    string x = "", y = "";
    int add = 0;

    for (int i = 0; i < n/2; i++){
        if (a[i] == b[i+add]) x += a[i], y += b[i+add];
        else x += a[i], y += b[i+1], add = 1;
    }

    if (x == y) answer1 = x;

    x = "", y = "";
    add = 0;

    for (int i = 0; i < n/2; i++){
        if (d[i] == c[i+add]) x += d[i], y += c[i+add];
        else x += d[i], y += c[i+1], add = 1;
    }

    if (x == y) answer2 = x;

    //cout << "answer2: " << answer2 << "\n";

    if (answer1.size() && answer2.size() && answer1 != answer2) cout << "NOT UNIQUE";
    else if (!answer1.size() && !answer2.size()) cout << "NOT POSSIBLE";
    else if (answer1.size()) cout << answer1;
    else cout << answer2;

    return 0;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 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 1 ms 204 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 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 1 ms 300 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 296 KB Output is correct
22 Correct 1 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 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 292 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 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 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 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 292 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 1 ms 204 KB Output is correct
51 Correct 1 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

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 15124 KB Output is correct
2 Correct 104 ms 15260 KB Output is correct
3 Correct 104 ms 15148 KB Output is correct
4 Correct 102 ms 15156 KB Output is correct
5 Correct 104 ms 15112 KB Output is correct
6 Correct 47 ms 6124 KB Output is correct
7 Correct 101 ms 15208 KB Output is correct
8 Correct 92 ms 11176 KB Output is correct
9 Correct 92 ms 11240 KB Output is correct
10 Correct 97 ms 11184 KB Output is correct
11 Correct 85 ms 9620 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 4 ms 296 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 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 204 KB Output is correct
22 Correct 1 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 1 ms 204 KB Output is correct
27 Correct 2 ms 204 KB Output is correct
28 Correct 1 ms 292 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 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 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 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 296 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 1 ms 276 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 292 KB Output is correct
54 Correct 1 ms 204 KB Output is correct