Submission #11764

#	Time	Username	Problem	Language	Result	Execution time	Memory
11764		gs12117	Three Friends (BOI14_friends)	C++98	100 / 100	16 ms	4996 KiB

friends

#include<stdio.h>
int n;
char a[2001000];
char b[2001000];
int main(){
	int i,t,flag;
	scanf("%d",&n);
	scanf("%s",a);
	if(n%2==0){
		puts("NOT POSSIBLE");
		return 0;
	}
	for(i=0;i<n/2;i++){
		if(a[i]!=a[i+n/2])break;
	}
	t=i;
	for(i=n/2-1;i>=0;i--){
		if(a[i]!=a[i+n/2+1])break;
	}
	if(t>i)flag=1;
	else flag=0;
	for(i=0;i<n/2+1;i++){
		if(a[i]!=a[i+n/2+1])break;
	}
	t=i;
	for(i=n/2;i>=0;i--){
		if(a[i]!=a[i+n/2])break;
	}
	if(t>=i){
		if(flag==1){
			for(i=0;i<n/2;i++){
				if(a[i]!=a[i+n/2+1])break;
			}
			if(i==n/2){
				for(i=0;i<n/2;i++){
					b[i]=a[i];
				}
				puts(b);
			}
			else{
				puts("NOT UNIQUE");
			}
		}
		else{
			for(i=0;i<n/2;i++){
				b[i]=a[i+n/2+1];
			}
			puts(b);
		}
	}
	else{
		if(flag==1){
			for(i=0;i<n/2;i++){
				b[i]=a[i];
			}
			puts(b);
		}
		else{
			puts("NOT POSSIBLE");
		}
	}
}

• Subtask 1: 35 / 35
• Subtask 2: 65 / 65