oj.uz

답안 #938205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938205 2024-03-05T02:38:24 Z Faisal_Saqib 세 명의 친구들 (BOI14_friends) C++17
0 / 100
 41 ms 8132 KB 
#include <iostream>
#include <set>
using namespace std;
#define ll long long
const ll N=10000;
ll pre[N],pw[N],base=717,mod=1e9+9;
ll pre1[N],pw1[N],base1=911,mod1=1e9+7;
int get(int l,int r)// one base indexing 1<=l<=n
{
    if(r<l)
        return 0;
    return ((pre[r]-(pre[l-1]*pw[r-l+1])%mod)%mod+mod)%mod;
}
int get1(int l,int r)// one base indexing 1<=l<=n
{
    if(r<l)
        return 0;
    return ((pre1[r]-(pre1[l-1]*pw1[r-l+1])%mod1)%mod1+mod1)%mod1;
}
int main()
{
    int n;
    cin>>n;
    string s;
    cin>>s;
    pre[0]=0;
    pw[0]=1;
    for(int i=1;i<=n;i++)
        pw[i]=(pw[i-1]*base)%mod;
    for(int i=1;i<=n;i++)
        pre[i]=((pre[i-1]*base)%mod+(s[i-1]-'A'))%mod;
    pre1[0]=0;
    pw1[0]=1;
    for(int i=1;i<=n;i++)
        pw1[i]=(pw1[i-1]*base1)%mod1;
    for(int i=1;i<=n;i++)
        pre1[i]=((pre1[i-1]*base1)%mod1+(s[i-1]-'A'))%mod1;
    set<int> posa;
    int len=(n-1)/2;
    for(int i=1;(n%2==1) and i<=n;i++)
    {
        ll fit=-1;
        ll sec=-1;
        ll fit1=0;
        ll sec1=0;
        ll hash=0;
        int len1=0;
        for(int j=1;j<=n;j++)
        {
            if(j==i)
                continue;
            hash=(hash*base)%mod;
            hash=(hash+s[j-1]-'A')%mod;
            len1++;
            if(len==len1)
            {
                len1=0;
                if(fit==-1)
                    fit=hash;
                else
                    sec=hash;
                hash=0;
            }
        }
        // int lf=(i-1);
        // if(lf<=len)
        // {
        //     fit=((get(1,i-1)*pw[len-lf])%mod+get(i+1,i+len-lf))%mod;
        //     sec=get(i+len-lf+1,n);
        //     fit1=((get1(1,i-1)*pw1[len-lf])%mod1+get1(i+1,i+len-lf))%mod1;
        //     sec1=get1(i+len-lf+1,i+len-lf+len);
        // }
        // else{
        //     fit=get(1,len);
        //     sec=((get(len+1,i-1)*pw[n-i])%mod + get(i+1,n))%mod;
        //     fit1=get1(1,len);
        //     sec1=((get1(len+1,i-1)*pw1[n-i])%mod1 + get1(i+1,n))%mod1;
        // }
        if(fit==sec and fit1==sec1)
        {
            posa.insert(i);
        }
    }
    if(posa.size()==0 or n%2!=1)
    {
        cout<<"NOT POSSIBLE\n";
    }
    else if(posa.size()==1)
    {
        int j=*begin(posa);
        for(int i=1,p=0;p<len;i++)
        {
            if(i!=j)
            {
                cout<<s[i-1];
                p++;
            }
        }
        cout<<endl;
    }
    else{
        cout<<"NOT UNIQUE\n";
    }
    return 0;
}

Subtask #1
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 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 1 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 0 ms 348 KB Output is correct
19 Correct 0 ms 392 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 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 348 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 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 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 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 39 ms 348 KB Output is correct
45 Correct 40 ms 348 KB Output is correct
46 Correct 40 ms 496 KB Output is correct
47 Correct 41 ms 504 KB Output is correct
48 Correct 40 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Incorrect 35 ms 576 KB Output isn't correct
51 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 30 ms 8132 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -