oj.uz

Submission #938399

# Submission time Handle Problem Language Result Execution time Memory
938399 2024-03-05T05:48:38 Z Ghulam_Junaid Three Friends (BOI14_friends) C++17
0 / 100
 42 ms 13632 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const ll mod = 1e9 + 7;
const ll base = 727;

ll k;
set<int> st;

void check(string s, string t, bool is_suff){
    int j = 0;
    int i = 0;
    int ind = t.size() - 1;
    for (; i < s.size() and j < t.size();){
        if (s[i] == t[j]){
            i++;
            j++;
        }
        else{
            ind = j;
            j++;
        }
    }

    if (i == s.size())
        st.insert(ind + k * is_suff);

    j = t.size() - 1;
    ind = 0;
    for (int i = s.size() - 1; i >= 0 and j >= 0;){
        if (s[i] == t[j]){
            i--;
            j--;
        }
        else{
            ind = j;
            j--;
        }
    }

    if (i == -1)
        st.insert(ind + k * is_suff);
}

int main(){
    ll n;
    string s;
    cin >> n >> s;

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

    k = n / 2;
    ll poss = 0;

    string P, S;
    for (ll i = 0; i < k; i ++)
        P += s[i];
    for (ll i = k + 1; i < n; i ++)
        S += s[i];

    string ans;

    string Q = s[k] + S;
    check(P, Q, 1);
    if (st.size())
        ans = P;

    int prev = st.size();

    Q = P + s[k];
    check(S, Q, 0);
    if (st.size() - prev)
        ans = S;

    if (st.size() > 1)
        cout << "NOT UNIQUE" << endl;
    else if (st.size() == 0)
        cout << "NOT POSSIBLE" << endl;
    else
        cout << ans << endl;
}

Compilation message

friends.cpp: In function 'void check(std::string, std::string, bool)':
friends.cpp:16:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (; i < s.size() and j < t.size();){
      |            ~~^~~~~~~~~~
friends.cpp:16:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (; i < s.size() and j < t.size();){
      |                             ~~^~~~~~~~~~
friends.cpp:27:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     if (i == s.size())
      |         ~~^~~~~~~~~~~
friends.cpp: In function 'int main()':
friends.cpp:58:8: warning: unused variable 'poss' [-Wunused-variable]
   58 |     ll poss = 0;
      |        ^~~~

Subtask #1
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 372 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 440 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 0 ms 432 KB Output is correct
32 Correct 0 ms 436 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 420 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 352 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 356 KB Output is correct
46 Correct 0 ms 440 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Incorrect 0 ms 348 KB Output isn't correct
51 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 12124 KB Output is correct
2 Correct 37 ms 12988 KB Output is correct
3 Correct 36 ms 12228 KB Output is correct
4 Correct 36 ms 13632 KB Output is correct
5 Correct 36 ms 12992 KB Output is correct
6 Correct 28 ms 7748 KB Output is correct
7 Incorrect 35 ms 11688 KB Output isn't correct
8 Halted 0 ms 0 KB -