oj.uz

Submission #968778

# Submission time Handle Problem Language Result Execution time Memory
968778 2024-04-24T04:15:45 Z youssef_3breheem Three Friends (BOI14_friends) C++14
100 / 100
 14 ms 15092 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

typedef long long i64;
#define speed_up ios::sync_with_stdio(false);cin.tie(nullptr);
#define ordered_set(datatype) tree<datatype,null_type,less<datatype>,rb_tree_tag,tree_order_statistics_node_update>
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()
#define isON(N,K) (N&(1<<K))
#define endl '\n'

const int N = 2e3 + 7;
const int mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
long double EPS = 1e-9;
const int dr[]={-1,0,1,0};
const int dc[]={0,1,0,-1};

template<class T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &it : v) in >> it;
    return in;
}

template<class T>
ostream &operator<<(ostream &out, vector<T> &v) {
    for (auto &it : v) out << it << ' ';
    return out;
}

i64 powmod(i64 b,i64 p){
    b%=mod;
    i64 res=1;
    while(p){
        if(p&1)res=res*b%mod;
        p>>=1;
        b=b*b%mod;
    }
    return res;
}

i64 mul(i64 a,i64 b){
    return ((a%mod)*(b%mod))%mod;
}

i64 inv(i64 b){
    return powmod(b,mod-2);
}

string comp(string a,string b){
    if(a.size()>b.size())swap(a,b);
    int i=0,j=0,cnt=0;
    while(i<a.size()){
        while(j<b.size()&&a[i]!=b[j]){
            cnt++,j++;
        }
        j++,i++;
    }
    return (cnt<=1?a:"");;
}

void TC(){
    int n;
    cin >> n;
    string s;
    cin >> s;
    if(n%2==0)return void(cout << "NOT POSSIBLE" << endl);
    string a1,b1,a2,b2;
    a1=s.substr(0,n/2),b1=s.substr(n/2);
    a2=s.substr(0,n/2+1),b2=s.substr(n/2+1);
    string ans1,ans2;
    ans1=comp(a1,b1),ans2=comp(a2,b2);
    if(!ans1.size()&&!ans2.size())cout << "NOT POSSIBLE" << endl;
    else if(ans1.size()&&ans2.size()&&ans1!=ans2)cout << "NOT UNIQUE" << endl;
    else cout << (ans1.size()? ans1:ans2) << endl;
    
}

signed main() {
    speed_up
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    // #endif
    int tt = 1;
//    cin >> tt;
    while(tt--) {
        TC();
        // cout << endl;
    }
}

Compilation message

friends.cpp: In function 'std::string comp(std::string, std::string)':
friends.cpp:58:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     while(i<a.size()){
      |           ~^~~~~~~~~
friends.cpp:59:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         while(j<b.size()&&a[i]!=b[j]){
      |               ~^~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 460 KB Output is correct
5 Correct 0 ms 348 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 448 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 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 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14040 KB Output is correct
2 Correct 13 ms 14060 KB Output is correct
3 Correct 11 ms 14076 KB Output is correct
4 Correct 11 ms 14076 KB Output is correct
5 Correct 14 ms 14152 KB Output is correct
6 Correct 4 ms 4352 KB Output is correct
7 Correct 11 ms 15092 KB Output is correct
8 Correct 9 ms 12540 KB Output is correct
9 Correct 9 ms 12796 KB Output is correct
10 Correct 10 ms 12600 KB Output is correct
11 Correct 9 ms 10032 KB Output is correct
12 Correct 0 ms 348 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 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 452 KB Output is correct
22 Correct 0 ms 460 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 452 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 408 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 456 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 600 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 1 ms 348 KB Output is correct