oj.uz

Submission #180312

# Submission time Handle Problem Language Result Execution time Memory
180312 2020-01-08T22:20:26 Z rzbt Three Friends (BOI14_friends) C++14
100 / 100
 121 ms 50168 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 2000006
typedef long long ll;


using namespace std;

const ll MOD = 1e9+9;

ll n;
char s[MAXN];
ll hes[MAXN];
ll stepen[MAXN];
ll res=0;
ll posl;
vector<ll> svi;
int main()
{

    scanf("%lld", &n);
    if(!(n&1)){
        printf("NOT POSSIBLE");
        return 0;
    }
    scanf("%s",s);
    hes[0]=s[0]-'A'+1;
    stepen[0]=1;
    for(ll i=1;i<n;i++){
        stepen[i]=(79*stepen[i-1])%MOD;
        hes[i]=(stepen[i]*(s[i]-'A'+1)+hes[i-1])%MOD;

    }
    for(ll i=0;i<n;i++){
        if(i<(n>>1)){
            ll th=hes[n>>1]-hes[i];
            if(i!=0)th+=hes[i-1]*stepen[1];
            th=(MOD+MOD+MOD+th)%MOD;
            th*=stepen[n/2];
            th%=MOD;
            if(th==(MOD+hes[n-1]-hes[n>>1])%MOD){
                res++,posl=i;
                svi.pb(th);
            }


        }
        if(i>(n>>1)){
            ll th=hes[n-1]-hes[i];
            th+=(hes[i-1]-hes[(n>>1)-1])*stepen[1];
            th=(MOD+MOD+MOD+th)%MOD;
            //printf("   %lld %lld\n",th,(hes[(n>>1)-1]*stepen[(n>>1)+1])%MOD );
            if(th==(hes[(n>>1)-1]*stepen[(n>>1)+1])%MOD  ){
                res++,posl=i;
                svi.pb(th);
            }
        }
        if(i==(n>>1)){
            ll ta=hes[(n>>1)-1];
            ll tb=(MOD+hes[n-1]-hes[(n>>1)])%MOD;
            //printf("%lld %lld    %lld %lld",ta,tb,stepen[(n>>1)+1],(ta*stepen[(n>>1)+1])%MOD);
            if(tb==(ta*stepen[(n>>1)+1])%MOD){
                res++,posl=i;
                svi.pb(tb);
            }

        }

    }
    if(res==0)printf("NOT POSSIBLE");
    else{
        for(int i=0;i<svi.size()-1;i++){
            if(svi[i]!=svi[i+1]){
                printf("NOT UNIQUE");
                return 0;
            }
        }
        ll gran=(n>>1);
        for(ll i=0;i<gran;i++){
            if(i==posl)gran++;
            else putchar(s[i]);
        }
    }

    return 0;
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:76:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<svi.size()-1;i++){
                     ~^~~~~~~~~~~~~
friends.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &n);
     ~~~~~^~~~~~~~~~~~
friends.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",s);
     ~~~~~^~~~~~~~

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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 252 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 380 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 34560 KB Output is correct
2 Correct 83 ms 34564 KB Output is correct
3 Correct 83 ms 34680 KB Output is correct
4 Correct 84 ms 34652 KB Output is correct
5 Correct 87 ms 34684 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 121 ms 50168 KB Output is correct
8 Correct 59 ms 30328 KB Output is correct
9 Correct 75 ms 31224 KB Output is correct
10 Correct 75 ms 31224 KB Output is correct
11 Correct 55 ms 28024 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 308 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 1 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 1 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct