oj.uz

Submission #584469

# Submission time Handle Problem Language Result Execution time Memory
584469 2022-06-27T12:31:03 Z Blagoj Three Friends (BOI14_friends) C++14
100 / 100
 18 ms 18120 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(0);
    int sz;
    cin >> sz;
    string u;
    cin >> u;
    if (sz % 2 == 0)
    {
        cout << "NOT POSSIBLE";
        return 0;
    }
    int result = 0;
    string kraj;
    set<string>s;
    string a1 = u.substr(0, sz / 2), a2 = u.substr(sz / 2 + 1);
    if (a1 == a2)
    {
        s.insert(a1);
        result++;
        kraj = a1;
    }
    a1 = u.substr(1, sz / 2), a2 = u.substr(sz / 2 + 1);
    if (a1 == a2 && s.count(a1) == 0)
    {
        s.insert(a1);
        result++;
        if (result > 1)
        {
            cout << "NOT UNIQUE";
            return 0;
        }
        kraj = a1;
    }
    a1 = u.substr(0, sz / 2), a2 = u.substr(sz / 2, sz / 2);
    if (a1 == a2 && s.count(a1) == 0)
    {
        s.insert(a1);
        result++;
        if (result > 1)
        {
            cout << "NOT UNIQUE";
            return 0;
        }
        kraj = a1;
    }
    a1 = u.substr(0, sz / 2 + 1), a2 = u.substr(sz / 2 + 1);
    for (int i = 0; i < sz / 2; i++)
    {
        if (a1[i] != a2[i])
        {
            string l = u.substr(0, i), r = u.substr(i + 1);
            string temp = l + r;
            string temp1 = temp.substr(0, sz / 2), temp2 = temp.substr(sz / 2);
            if (temp1 == temp2 && s.count(temp1) == 0)
            {
                s.insert (temp1);
                result++;
                if (result > 1)
                {
                    cout << "NOT UNIQUE";
                    return 0;
                }
                kraj = temp1;
            }
            if (sz / 2 + i + 1 < sz)
            {
                r = u.substr(sz / 2 + i + 1);
            }
            l = u.substr(0, sz / 2 + i);
            temp = l + r;
            temp1 = temp.substr(0, sz / 2), temp2 = temp.substr(sz / 2);
            if (temp1 == temp2 && s.count(temp1) == 0)
            {
                s.insert(temp1);
                result++;
                if(result > 1)
                {
                    cout << "NOT UNIQUE";
                    return 0;
                }
                kraj = temp1;
            }
            break;
        }
    }
    a1 = u.substr(0, sz / 2), a2 = u.substr(sz / 2);
    for (int i = 0; i < sz / 2; i++)
    {
        if (a1[i] != a2[i])
        {
            string l = u.substr(0, i), r = u.substr(i + 1);
            string temp = l + r;
            string temp1 = temp.substr(0, sz / 2), temp2 = temp.substr(sz / 2);
            if (temp1 == temp2 && s.count(temp1) == 0)
            {
                s.insert(temp1);
                result++;
                if (result > 1)
                {
                    cout << "NOT UNIQUE";
                    return 0;
                }
                kraj = temp1;
            }
            if (sz / 2 + i + 1 < sz)
            {
                r = u.substr(sz / 2 + i + 1);
            }
            l = u.substr(0, sz / 2 + i);
            temp = l + r;
            temp1 = temp.substr(0, sz / 2), temp2 = temp.substr(sz / 2);
            if (temp1 == temp2 && s.count(temp1) == 0)
            {
                s.insert(temp1);
                result++;
                if(result > 1)
                {
                    cout << "NOT UNIQUE";
                    return 0;
                }
                kraj = temp1;
            }
            break;
        }
    }
    if (result == 0)
    {
        cout << "NOT POSSIBLE";
        return 0;
    }
    cout << kraj;
    return 0;
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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