oj.uz

Submission #314538

# Submission time Handle Problem Language Result Execution time Memory
314538 2020-10-20T08:59:01 Z Fidisk Three Friends (BOI14_friends) C++14
100 / 100
 110 ms 52340 KB 
#include <bits/stdc++.h>
using namespace std;

#define oo 1e9
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) ((xxxx>>(aaaa-1))&1)

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;

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

string s;
ll n,i,hashs[5000009],po[5000009],pos,type[5000009],cur;
bool ok;

ll get(ll x,ll y) {
    if (x>y) {
        return 0;
    }
    return (hashs[y]-hashs[x-1]*po[y-x+1]+mod*mod)%mod;
}

int main(){
    IO;
    //freopen("threefriend.inp","r",stdin);
//freopen("threefriend.out","w",stdout);
    cin>>n;
    cin>>s;
    //cout<<n<<'\n';
    //cout<<s<<'\n';
    if (n%2==0) {
        cout<<"NOT POSSIBLE";
        return 0;
    }
    s=" "+s;
    po[0]=1;
    for (i=1;i<=n;i++) {
        hashs[i]=(hashs[i-1]*base+s[i])%mod;
        po[i]=(po[i-1]*base)%mod;
    }
    for (i=1;i<=n;i++) {
        if (s[i]!=s[i-1]) {
            cur++;
        }
        type[i]=cur;
    }
    for (i=1;i<=n;i++) {
        if (i<=((n+1)/2)) {
            //cout<<1<<' '<<i-1<<' '<<(n+1)/2+1<<' '<<(n+1)/2+i-1<<' '<<i+1<<' '<<(n+1)/2<<' '<<(n+1)/2+i<<' '<<n<<'\n';
            if (get(1,i-1)==get((n+1)/2+1,(n+1)/2+i-1)&&get(i+1,(n+1)/2)==get((n+1)/2+i,n)) {
                if (ok&&type[i]!=type[pos]) {
                    cout<<"NOT UNIQUE";
                    return 0;
                }
                else {
                    ok=true;
                    pos=i;
                }
            }
        }
        else {
            //cout<<1<<' '<<i-(n+1)/2<<' '<<(n+1)/2<<' '<<i-1<<' '<<i-(n+1)/2+1<<' '<<(n+1)/2-1<<' '<<i+1<<' '<<n<<'\n';
            if (get(1,i-(n+1)/2)==get((n+1)/2,i-1)&&get(i-(n+1)/2+1,(n+1)/2-1)==get(i+1,n)) {
                if (ok&&type[i]!=type[pos]) {
                    cout<<"NOT UNIQUE";
                    return 0;
                }
                else {
                    ok=true;
                    pos=i;
                }
            }
        }
    }
    if (!ok) {
        cout<<"NOT POSSIBLE";
        return 0;
    }
    if (pos<=(n+1)/2) {
        for (i=(n+3)/2;i<=n;i++) {
            cout<<s[i];
        }
    }
    else {
        for (i=1;i<(n+1)/2;i++) {
            cout<<s[i];
        }
    }
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 50416 KB Output is correct
2 Correct 97 ms 52340 KB Output is correct
3 Correct 96 ms 52336 KB Output is correct
4 Correct 97 ms 52336 KB Output is correct
5 Correct 98 ms 52336 KB Output is correct
6 Correct 6 ms 4388 KB Output is correct
7 Correct 110 ms 52336 KB Output is correct
8 Correct 64 ms 46260 KB Output is correct
9 Correct 92 ms 47184 KB Output is correct
10 Correct 85 ms 47236 KB Output is correct
11 Correct 53 ms 42936 KB Output is correct
12 Correct 1 ms 400 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 1 ms 324 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct
54 Correct 1 ms 384 KB Output is correct