oj.uz

Submission #398925

# Submission time Handle Problem Language Result Execution time Memory
398925 2021-05-04T22:20:51 Z YaserFaisal Three Friends (BOI14_friends) C++14
100 / 100
 8 ms 5196 KB 
#include <bits/stdc++.h>
 
using namespace std ;
 
//#define int long long 
int MOD = 1e9+7 ;
int freq[200] ;
vector < int > v[200] ;

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n ; cin >> n ; 
    string s ; cin >> s ; 
	if ( n % 2 == 0 )
    {
        cout << "NOT POSSIBLE" << endl ;
        return 0 ;
    }
    int counter = 0 , bo = 0 ;
    for ( int i = 0 , j = (n/2) ; i < (n/2) ; i++ , j++ )
    {
        if ( s[i] == s[j] ) counter++ ;
        else if ( !bo )
        {
            bo = 1 ;
            i-- ;
        }
    }
    string ans = "-" ;
    if ( counter == (n/2) ) ans = s.substr(0,(n/2)) ;
    //====================================================
    counter = bo = 0 ;
    for ( int i = (n/2)+1 , j = 0 ; i < n ; i++ , j++ )
    {
        if ( s[i] == s[j] ) counter++ ;
        else if ( !bo )
        {
            bo = 1 ;
            i-- ;
        }
    }
    if ( counter == (n/2) )
    {
        if ( ans == "-" ) ans = s.substr((n/2)+1) ;
        else if ( ans != s.substr((n/2)+1) )
        {
            cout << "NOT UNIQUE" << endl ;
            return 0 ;
        }
    }
    if ( ans == "-" ) cout << "NOT POSSIBLE" << endl ;
    else cout << ans << endl ;
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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