oj.uz

Submission #103460

# Submission time Handle Problem Language Result Execution time Memory
103460 2019-03-30T18:37:06 Z pedro_sponchiado Three Friends (BOI14_friends) C++17
0 / 100
 18 ms 7180 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=2000010;
int n_, n;
char str[maxn], s1[maxn], s2[maxn], s3[maxn], s4[maxn];
int mini;

int verif(char str1[maxn], char str2[maxn]){
	for(int i=0; i<=n; i++){
		if(str1[i]!=str2[i]){
			mini=i;
			break;	
		}
	}
//	printf("mini=%d\n", mini);
	
	int cont=0, da=1;
	for(int i=0; i<n; i++){
		if(cont==mini) cont++;
//		printf("%c %c\n", str1[i], str2[cont]);
		if(str1[i]!=str2[cont]) da=0;
		cont++;
	}
//	printf("%d\n", da);
	if(da==0) return 0;
	if( (str2[mini]==str2[mini-1] && mini>=1) || (str2[mini]==str2[mini+1] && mini<=n-1) ) return 2;
	return 1;
}

int main(){
	scanf("%d", &n_);
	scanf(" %s ", &str);
	if(n_%2==0){
		printf("NOT POSSIBLE\n");
		return 0;
	}
	n=n_/2;
	
	for(int i=0; i<n; i++) s1[i]=str[i];
	for(int i=n; i<=2*n; i++) s2[i-n]=str[i];
	for(int i=n+1; i<=2*n; i++) s3[i-n-1]=str[i];
	for(int i=0; i<=n; i++) s4[i]=str[i];
	
	int x=verif(s1, s2);
	int mini1=mini;
	int y=verif(s3, s4);
	int mini2=mini;
//	printf("%s %s %s %s\n", s1, s2, s3, s4);
	
	if(x+y==0) printf("NOT POSSIBLE\n");
	if(x+y==1){
		if(x==1) printf("%s\n", s1);
		else printf("%s\n", s3);
	}
	if(x+y>=2){
	//	printf("%d %d %d %d\n", x, y, mini1, mini2);
		if(x==1 && y==1 && mini1==0 && mini2==n) printf("%s\n", s1);
		else printf("NOT UNIQUE\n");
	}
	return 0;
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:32:20: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[2000010]' [-Wformat=]
  scanf(" %s ", &str);
                ~~~~^
friends.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n_);
  ~~~~~^~~~~~~~~~~
friends.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf(" %s ", &str);
  ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 35.0

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

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 7180 KB Output is correct
2 Correct 17 ms 7132 KB Output is correct
3 Correct 17 ms 7168 KB Output is correct
4 Correct 18 ms 7168 KB Output is correct
5 Incorrect 16 ms 6144 KB Output isn't correct
6 Halted 0 ms 0 KB -