oj.uz

Submission #17420

# Submission time Handle Problem Language Result Execution time Memory
17420 2015-12-01T12:18:04 Z choyi0521 Three Friends (BOI14_friends) C++
0 / 100
 79 ms 3676 KB 
#include<iostream>
using namespace std;
const int MAX_N=2000001;
int n;
char str[MAX_N+1];
int query(int f1,int f2){
	int i,flag=0;
	if(f2 && str[0]!=str[n/2]) return 0;
	for(i=0; i<n/2; i++){
		if(str[i+f1]==str[i+n/2+f2]) continue;
		if(flag++) break;
		f2?f1++:f2++;
		i--;
	}
	return i==n/2;
}
int main(){
	cin >> n >> str;
	int r1=query(0,0),r2=query(0,1);
	if(!r1&!r2 || n%2==0) cout << "NOT POSSIBLE";
	else if(r1&r2) cout<<"NOT UNIQUE";
	else if(r1)
		for(int i=0; i<n/2; i++) cout << str[i];
	else
		for(int i=n/2+1; i<n; i++) cout << str[i];
	return 0;
}

Subtask #1
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 3676 KB Output isn't correct
2 Halted 0 ms 0 KB -