oj.uz

Submission #89357

# Submission time Handle Problem Language Result Execution time Memory
89357 2018-12-12T08:31:24 Z Tieuphong Three Friends (BOI14_friends) C++11
100 / 100
 23 ms 13084 KB 
/***************************************************************************/
/**********************  LANG TU HAO HOA  **********************************/
/***************************************************************************/
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pii pair<int, int>
#define sz(x) ((int) x.size())
#define PB push_back
#define PF push_front
#define MP make_pair
#define ll long long
#define F first
#define S second
#define maxc 1000000007
#define MOD 1000000007
#define base 107
#define eps 1e-6
#define pi acos(-1)
#define N 2000006
#define task ""
#define remain(x) ((x > MOD) ? (x - MOD) : x)

using namespace std;

int n;

string s, ans[3];

int dem = 0;

string Check(int st1, int st2, int id)
{
    bool dd = 0;
    string res = "";
    for (int i = st1, j = st2; i < st2 && j <= n; i++, j++)
    {
        if (s[i] == s[j]) res.PB(s[i]);
            else
            {
                if (dd) break;
                if (id == 1) i--;
                    else j--;
                dd = 1;
                continue;
            }
    }
    if (res.length() != n/2) return "NOT";
    return res;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
   // freopen(task".inp", "r", stdin);
    //freopen(task".out", "w", stdout);
    cin >> n >> s;
    if ((n & 1) == 0) return cout << "NOT POSSIBLE", 0;
    s = "#" + s;
    //cout << s << '\n';
    ans[1] = Check(1, n/2+1, 1);
    ans[2] = Check(1, n/2+2, 2);
    //cout << ans[1] << ' ' << ans[2] << '\n';
    if (ans[1] == "NOT" && ans[2] == "NOT") return cout << "NOT POSSIBLE", 0;
    if (ans[1] == "NOT") return cout << ans[2], 0;
    if (ans[2] == "NOT") return cout << ans[1], 0;
    if (ans[1] == ans[2]) return cout << ans[1], 0;
    cout << "NOT UNIQUE";
    return 0;
}

Compilation message

friends.cpp: In function 'std::__cxx11::string Check(int, int, int)':
friends.cpp:48:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (res.length() != n/2) return "NOT";
         ~~~~~~~~~~~~~^~~~~~

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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