oj.uz

Submission #84689

# Submission time Handle Problem Language Result Execution time Memory
84689 2018-11-16T14:04:42 Z teomrn Three Friends (BOI14_friends) C++14
100 / 100
 85 ms 25308 KB 
#include <bits/stdc++.h>
using namespace std;

string ans;
bool uniq;

void proc(string a, string b)
{
    if (a.size() < b.size())
        swap(a, b);
    char c = 0;
    int p = 0;
    for (auto i : a) {
        if (p == b.size() || b[p] != i) {
            if (c)
                return;
            c = i;
            p--;
        }
        p++;
    }
    if (c) {
        if (!ans.empty() && ans != b)
            uniq = 1;
        ans = b;
    }
}

int main()
{
    int l;
    cin >> l;
    string s;
    cin >> s;

    if (l % 2 == 0) {
        cout << "NOT POSSIBLE\n";
        return 0;
    }
    proc(s.substr(0, l / 2), s.substr(l / 2, l / 2 + 1));
    proc(s.substr(0, l / 2 + 1), s.substr(l / 2 + 1, l / 2));

    if (uniq)
        cout << "NOT UNIQUE\n";
    else if (ans.empty())
        cout << "NOT POSSIBLE\n";
    else
        cout << ans << '\n';

    return 0;
}

Compilation message

friends.cpp: In function 'void proc(std::__cxx11::string, std::__cxx11::string)':
friends.cpp:14:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (p == b.size() || b[p] != i) {
             ~~^~~~~~~~~~~

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 8836 KB Output is correct
2 Correct 85 ms 10872 KB Output is correct
3 Correct 76 ms 12828 KB Output is correct
4 Correct 81 ms 14736 KB Output is correct
5 Correct 75 ms 16752 KB Output is correct
6 Correct 76 ms 16876 KB Output is correct
7 Correct 75 ms 20644 KB Output is correct
8 Correct 70 ms 20904 KB Output is correct
9 Correct 70 ms 23668 KB Output is correct
10 Correct 68 ms 25308 KB Output is correct
11 Correct 61 ms 25308 KB Output is correct
12 Correct 2 ms 25308 KB Output is correct
13 Correct 2 ms 25308 KB Output is correct
14 Correct 2 ms 25308 KB Output is correct
15 Correct 2 ms 25308 KB Output is correct
16 Correct 2 ms 25308 KB Output is correct
17 Correct 2 ms 25308 KB Output is correct
18 Correct 2 ms 25308 KB Output is correct
19 Correct 2 ms 25308 KB Output is correct
20 Correct 2 ms 25308 KB Output is correct
21 Correct 2 ms 25308 KB Output is correct
22 Correct 2 ms 25308 KB Output is correct
23 Correct 2 ms 25308 KB Output is correct
24 Correct 2 ms 25308 KB Output is correct
25 Correct 2 ms 25308 KB Output is correct
26 Correct 2 ms 25308 KB Output is correct
27 Correct 2 ms 25308 KB Output is correct
28 Correct 2 ms 25308 KB Output is correct
29 Correct 2 ms 25308 KB Output is correct
30 Correct 2 ms 25308 KB Output is correct
31 Correct 2 ms 25308 KB Output is correct
32 Correct 2 ms 25308 KB Output is correct
33 Correct 2 ms 25308 KB Output is correct
34 Correct 2 ms 25308 KB Output is correct
35 Correct 2 ms 25308 KB Output is correct
36 Correct 2 ms 25308 KB Output is correct
37 Correct 2 ms 25308 KB Output is correct
38 Correct 2 ms 25308 KB Output is correct
39 Correct 2 ms 25308 KB Output is correct
40 Correct 2 ms 25308 KB Output is correct
41 Correct 2 ms 25308 KB Output is correct
42 Correct 2 ms 25308 KB Output is correct
43 Correct 2 ms 25308 KB Output is correct
44 Correct 2 ms 25308 KB Output is correct
45 Correct 2 ms 25308 KB Output is correct
46 Correct 2 ms 25308 KB Output is correct
47 Correct 2 ms 25308 KB Output is correct
48 Correct 2 ms 25308 KB Output is correct
49 Correct 2 ms 25308 KB Output is correct
50 Correct 2 ms 25308 KB Output is correct
51 Correct 2 ms 25308 KB Output is correct
52 Correct 3 ms 25308 KB Output is correct
53 Correct 2 ms 25308 KB Output is correct
54 Correct 2 ms 25308 KB Output is correct