oj.uz

Submission #5948

# Submission time Handle Problem Language Result Execution time Memory
5948 2014-06-05T15:17:13 Z model_code Three Friends (BOI14_friends) C++
100 / 100
 100 ms 9592 KB 
#include <iostream>
#include <set>

using namespace std;

string s;
int n;
set<string> q;

bool ok(string a, string b) {
    int j = 0;
    int v = 0;
    for (int i = 0; i < a.size(); i++) {
        if (a[i] != b[j] && v == 0) {v++; i--;}
        else if (a[i] != b[j]) return false;
        j++;
    }
    return true;
}

int main() {
 	int NN;
	cin >> NN;
 	cin >> s;
    int n = s.size();
    if (n%2 == 0) {
        cout << "NOT POSSIBLE\n";
        return 0;
    }
    string a1 = s.substr(0, (n-1)/2);
    string b1 = s.substr((n-1)/2);
    if (ok(a1, b1)) q.insert(a1);
    string a2 = s.substr((n-1)/2+1);
    string b2 = s.substr(0, (n-1)/2+1);
    if (ok(a2, b2)) q.insert(a2);
    if (q.size() == 0) {
        cout << "NOT POSSIBLE\n";
    } else if (q.size() > 1) {
        cout << "NOT UNIQUE\n";
    } else {
        cout << *(q.begin()) << endl;
    }
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 9592 KB Output is correct
2 Correct 100 ms 9592 KB Output is correct
3 Correct 92 ms 9592 KB Output is correct
4 Correct 96 ms 9592 KB Output is correct
5 Correct 96 ms 9592 KB Output is correct
6 Correct 92 ms 4744 KB Output is correct
7 Correct 96 ms 9592 KB Output is correct
8 Correct 96 ms 9000 KB Output is correct
9 Correct 96 ms 9000 KB Output is correct
10 Correct 84 ms 9000 KB Output is correct
11 Correct 72 ms 8616 KB Output is correct
12 Correct 0 ms 1676 KB Output is correct
13 Correct 0 ms 1676 KB Output is correct
14 Correct 0 ms 1676 KB Output is correct
15 Correct 0 ms 1676 KB Output is correct
16 Correct 0 ms 1676 KB Output is correct
17 Correct 0 ms 1676 KB Output is correct
18 Correct 0 ms 1676 KB Output is correct
19 Correct 0 ms 1676 KB Output is correct
20 Correct 0 ms 1676 KB Output is correct
21 Correct 0 ms 1676 KB Output is correct
22 Correct 0 ms 1676 KB Output is correct
23 Correct 0 ms 1676 KB Output is correct
24 Correct 0 ms 1676 KB Output is correct
25 Correct 0 ms 1676 KB Output is correct
26 Correct 0 ms 1676 KB Output is correct
27 Correct 0 ms 1676 KB Output is correct
28 Correct 0 ms 1676 KB Output is correct
29 Correct 0 ms 1676 KB Output is correct
30 Correct 0 ms 1676 KB Output is correct
31 Correct 0 ms 1676 KB Output is correct
32 Correct 0 ms 1676 KB Output is correct
33 Correct 0 ms 1676 KB Output is correct
34 Correct 0 ms 1676 KB Output is correct
35 Correct 0 ms 1676 KB Output is correct
36 Correct 0 ms 1676 KB Output is correct
37 Correct 0 ms 1676 KB Output is correct
38 Correct 0 ms 1676 KB Output is correct
39 Correct 0 ms 1676 KB Output is correct
40 Correct 0 ms 1676 KB Output is correct
41 Correct 0 ms 1676 KB Output is correct
42 Correct 0 ms 1676 KB Output is correct
43 Correct 0 ms 1676 KB Output is correct
44 Correct 0 ms 1676 KB Output is correct
45 Correct 0 ms 1676 KB Output is correct
46 Correct 0 ms 1676 KB Output is correct
47 Correct 0 ms 1676 KB Output is correct
48 Correct 0 ms 1676 KB Output is correct
49 Correct 0 ms 1676 KB Output is correct
50 Correct 0 ms 1676 KB Output is correct
51 Correct 0 ms 1676 KB Output is correct
52 Correct 0 ms 1676 KB Output is correct
53 Correct 0 ms 1676 KB Output is correct
54 Correct 0 ms 1676 KB Output is correct