Submission #338217

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
338217	2020-12-22T18:09:37 Z	limabeans	Three Friends (BOI14_friends)	C++17	35 / 100	500 ms	7668 KB

friends

#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;



void notp() {
    out("NOT POSSIBLE");
}


void notu() {
    out("NOT UNIQUE");
}


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    int n;
    string u;
    cin>>n>>u;

    if (n%2==0) notp();


    string ans;
    
    for (int i=0; i<n; i++) {
	string tmp = u.substr(0,i) + u.substr(i+1);
	string s = tmp.substr(0,(n-1)/2);
	string t = tmp.substr((n-1)/2);
	if (s==t) {
	    if (ans!="" && ans!=s) notu();
	    ans = s;
	}
    }

    if (ans=="") notp();
    cout<<ans<<endl;    
    return 0;
}

Subtask #1

35.0 / 35.0

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

Subtask #2

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1080 ms	7668 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-