oj.uz

Submission #18634

# Submission time Handle Problem Language Result Execution time Memory
18634 2016-02-13T04:25:00 Z mindol Three Friends (BOI14_friends) C++14
100 / 100
 144 ms 92524 KB 
#include<iostream>
#include<memory.h>
#include<string>
using namespace std;

const int mod=1e9+7;
int len;
string s,a,b;

int dp[1000002][2];

int f(int st,bool use)
{
    if(~dp[st][use]) return dp[st][use];
    if(st==b.size())
    {
        if(!use) return dp[st][use]=1;
        else return dp[st][use]=(a[st]==b[st-1]);
    }
    int res=use?0:f(st+1,true);
    if(a[st]!=b[st-use]) return dp[st][use]=res;
    else return dp[st][use]=f(st+1,use)+res;
}

int main()
{
    cin>>len>>s;
    if(!(len&1) || len==1) { cout<<"NOT POSSIBLE"; return 0; }
    if(s.substr(0,len/2)==s.substr(len/2+1,len/2)) { cout<<s.substr(0,len/2); return 0; }

    a=s.substr(0,len/2+1);
    b=s.substr(len/2+1,len/2);
    memset(dp,-1,sizeof(dp));
    int cnt1=f(0,false);

    a=s.substr(len/2,len/2+1);
    b=s.substr(0,len/2);
    memset(dp,-1,sizeof(dp));
    int cnt2=f(0,false);

    if(cnt1+cnt2==0) cout<<"NOT POSSIBLE";
    else if(cnt1 && cnt2) cout<<"NOT UNIQUE";
    else cout<<(cnt1?s.substr(len/2+1,len/2):s.substr(0,len/2));

    return 0;
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 92516 KB Output is correct
2 Correct 104 ms 92524 KB Output is correct
3 Correct 117 ms 92516 KB Output is correct
4 Correct 95 ms 92516 KB Output is correct
5 Correct 122 ms 92516 KB Output is correct
6 Correct 83 ms 12600 KB Output is correct
7 Correct 83 ms 13536 KB Output is correct
8 Correct 144 ms 84408 KB Output is correct
9 Correct 135 ms 84408 KB Output is correct
10 Correct 64 ms 84404 KB Output is correct
11 Correct 66 ms 14028 KB Output is correct
12 Correct 0 ms 9532 KB Output is correct
13 Correct 0 ms 9532 KB Output is correct
14 Correct 0 ms 9532 KB Output is correct
15 Correct 0 ms 9532 KB Output is correct
16 Correct 0 ms 9532 KB Output is correct
17 Correct 3 ms 9532 KB Output is correct
18 Correct 0 ms 9532 KB Output is correct
19 Correct 0 ms 9532 KB Output is correct
20 Correct 0 ms 9532 KB Output is correct
21 Correct 3 ms 9532 KB Output is correct
22 Correct 0 ms 9532 KB Output is correct
23 Correct 0 ms 9532 KB Output is correct
24 Correct 0 ms 9532 KB Output is correct
25 Correct 0 ms 9532 KB Output is correct
26 Correct 0 ms 9532 KB Output is correct
27 Correct 3 ms 9532 KB Output is correct
28 Correct 0 ms 9532 KB Output is correct
29 Correct 0 ms 9532 KB Output is correct
30 Correct 0 ms 9532 KB Output is correct
31 Correct 0 ms 9532 KB Output is correct
32 Correct 0 ms 9532 KB Output is correct
33 Correct 0 ms 9532 KB Output is correct
34 Correct 0 ms 9532 KB Output is correct
35 Correct 0 ms 9532 KB Output is correct
36 Correct 0 ms 9532 KB Output is correct
37 Correct 0 ms 9532 KB Output is correct
38 Correct 0 ms 9532 KB Output is correct
39 Correct 3 ms 9532 KB Output is correct
40 Correct 0 ms 9532 KB Output is correct
41 Correct 0 ms 9532 KB Output is correct
42 Correct 0 ms 9532 KB Output is correct
43 Correct 3 ms 9532 KB Output is correct
44 Correct 0 ms 9532 KB Output is correct
45 Correct 0 ms 9532 KB Output is correct
46 Correct 0 ms 9532 KB Output is correct
47 Correct 3 ms 9532 KB Output is correct
48 Correct 0 ms 9532 KB Output is correct
49 Correct 0 ms 9532 KB Output is correct
50 Correct 0 ms 9532 KB Output is correct
51 Correct 0 ms 9532 KB Output is correct
52 Correct 2 ms 9532 KB Output is correct
53 Correct 0 ms 9532 KB Output is correct
54 Correct 0 ms 9532 KB Output is correct