Submission #944675

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
944675	2024-03-13T03:04:27 Z	tamir1	Three Friends (BOI14_friends)	C++17	0 / 100	500 ms	9128 KB

friends

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,i,cnt,ans;
string t,u,s;
bool check(string s){
	ll n=s.size(),i;
	for(i=0;i<n/2;i++){
		if(s[i]!=s[i+n/2]) return 0;
	}
	return 1;
}
int main(){
	cin >> n >> u;
	if(n%2==0){
		cout << "NOT POSSIBLE";
		return 0;
	}
	for(i=0;i<n;i++){
		t=u;
		t.erase(t.begin()+i);
		if(check(t)){
			ans=i;
			cnt++;
			s=t;
		}
	}
	if(cnt==0) cout << "NOT POSSIBLE";
	else if(cnt>1) cout << "NOT UNIQUE";
	else{
		for(i=0;i<s.size()/2;i++) cout << s[i];
	}
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:31:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for(i=0;i<s.size()/2;i++) cout << s[i];
      |           ~^~~~~~~~~~~

Subtask #1

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	0 ms	432 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 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	1 ms	344 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	344 KB	Output is correct
37	Correct	1 ms	344 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	0 ms	436 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	1 ms	644 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Incorrect	1 ms	348 KB	Output isn't correct
51	Halted	0 ms	0 KB	-

Subtask #2

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1045 ms	9128 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-