oj.uz

Submission #930726

# Submission time Handle Problem Language Result Execution time Memory
930726 2024-02-20T10:26:12 Z emptypringlescan Three Friends (BOI14_friends) C++17
0 / 100
 11 ms 8196 KB 
#include <bits/stdc++.h>
using namespace std;
int32_t main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int n;
    cin >> n;
    if(n%2==0||n<3){
		cout << "NOT POSSIBLE";
		return 0;
	}
    string s;
    cin >> s;
    set<string> ans;
    string a="",b="";
    int mid=n/2;
    for(int i=mid+1; i<n; i++) a+=s[i];
    int p1,p2;
    for(p1=0; p1<mid; p1++){
		if(s[p1]!=a[p1]) break;
	}
	for(p2=mid; p2>0; p2--){
		if(s[p2]!=a[p2-1]) break;
	}
	if(p1>=p2) ans.insert(a);
	for(int i=0; i<mid; i++) b+=s[i];
    for(p1=mid; p1<n-1; p1++){
		if(s[p1]!=b[p1-mid]) break;
	}
	for(p2=n-1; p2>mid; p2--){
		if(s[p2]!=b[p2-1-mid]) break;
	}
	if(p1>=p2) ans.insert(b);
	if(ans.size()>1) cout << "NOT UNIQUE";
	else cout << *ans.begin();
}

Subtask #1
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 0 ms 348 KB Output is correct
15 Correct 1 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 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 0 ms 348 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8196 KB Output is correct
2 Correct 10 ms 8164 KB Output is correct
3 Correct 10 ms 8196 KB Output is correct
4 Correct 10 ms 8084 KB Output is correct
5 Correct 10 ms 8196 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 11 ms 8192 KB Output is correct
8 Correct 8 ms 5628 KB Output is correct
9 Correct 8 ms 5628 KB Output is correct
10 Correct 8 ms 6652 KB Output is correct
11 Incorrect 7 ms 4604 KB Output isn't correct
12 Halted 0 ms 0 KB -