답안 #944684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944684 2024-03-13T03:27:09 Z tamir1 세 명의 친구들 (BOI14_friends) C++17
35 / 100
500 ms 7204 KB
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,i,j,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.clear();
		for(j=0;j<n;j++){
			if(j==i) continue;
			t=t+u[j];
		}
		if(check(t)){
			ans=i;
			if(s!=t) 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:34: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]
   34 |   for(i=0;i<s.size()/2;i++) cout << s[i];
      |           ~^~~~~~~~~~~
# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 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 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 436 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 432 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 426 ms 592 KB Output is correct
45 Correct 421 ms 344 KB Output is correct
46 Correct 422 ms 596 KB Output is correct
47 Correct 424 ms 500 KB Output is correct
48 Correct 430 ms 596 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 426 ms 504 KB Output is correct
51 Correct 353 ms 344 KB Output is correct
52 Correct 322 ms 348 KB Output is correct
53 Correct 382 ms 492 KB Output is correct
54 Correct 267 ms 492 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1049 ms 7204 KB Time limit exceeded
2 Halted 0 ms 0 KB -