Submission #394892

# Submission time Handle Problem Language Result Execution time Memory
394892 2021-04-27T12:32:24 Z Nicholas_Patrick Three Friends (BOI14_friends) C++17
100 / 100
54 ms 7180 KB
#include <iostream>
#include <string>
using namespace std;

bool valid(string& s, string& a){
	int n=a.size();
	bool miss=false;
	for(int i=0, j=0; i<s.size(); i++){
		if(s[i]!=a[j]){
			if(miss)
				return false;
			miss=true;
		}else{
			j++;
			if(j==n)
				j=0;
		}
	}
	return true;
}
int main(){
	int n;
	string s;
	cin>>n>>s;
	if(~n&1){
		cout<<"NOT POSSIBLE"<<endl;
		return 0;
	}
	n>>=1;
	string a=s.substr(0, n), b=s.substr(n+1, n*2+1);
	if(valid(s, a)){
		if(valid(s, b)){
			if(a==b){
				cout<<a<<endl;
			}else{
				cout<<"NOT UNIQUE"<<endl;
			}
		}else{
			cout<<a<<endl;
		}
	}else{
		if(valid(s, b)){
			cout<<b<<endl;
		}else{
			cout<<"NOT POSSIBLE"<<endl;
		}
	}
}

Compilation message

friends.cpp: In function 'bool valid(std::string&, std::string&)':
friends.cpp:8:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |  for(int i=0, j=0; i<s.size(); i++){
      |                    ~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 208 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 224 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 300 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 54 ms 7120 KB Output is correct
2 Correct 52 ms 7092 KB Output is correct
3 Correct 53 ms 7180 KB Output is correct
4 Correct 53 ms 7172 KB Output is correct
5 Correct 52 ms 7096 KB Output is correct
6 Correct 47 ms 6176 KB Output is correct
7 Correct 53 ms 7104 KB Output is correct
8 Correct 51 ms 5504 KB Output is correct
9 Correct 53 ms 6364 KB Output is correct
10 Correct 47 ms 6476 KB Output is correct
11 Correct 39 ms 5064 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 292 KB Output is correct
24 Correct 1 ms 292 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 292 KB Output is correct
48 Correct 1 ms 296 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct