oj.uz

Submission #54989

# Submission time Handle Problem Language Result Execution time Memory
54989 2018-07-05T16:48:04 Z cki86201 Three Friends (BOI14_friends) C++11
100 / 100
 34 ms 26684 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>
#include <complex.h>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<ll, ll> pll;
typedef long double ldouble;
typedef pair<double, double> pdd;

int N;
char S[2000020];
char T1[2000020];
char T2[2000020];

void solve(){
	scanf("%d", &N);
	scanf("%s", S+1);
	if(N % 2 == 0) { puts("NOT POSSIBLE"); return; }
	for(int i=1;i<=N-1;i++) {
		if(i <= N / 2) T1[i] = S[i];
		else T1[i] = S[i - N/2];
	}
	int ok = 3;
	int f1 = -1;
	for(int i=1;i<=N-1;i++) if(S[i] != T1[i]) { f1 = i; break; }
	if(f1 != -1) {
		for(int i=f1+1;i<=N;i++) if(S[i] != T1[i-1]) { ok ^= 1; break; }
	}
	for(int i=N;i>N-N/2;i--) T2[i-1] = S[i];
	for(int i=N/2;i;i--) T2[i] = T2[i+N/2];
	f1 = -1;
	for(int i=1;i<=N-1;i++) if(S[i] != T2[i]) { f1 = i; break; }
	if(f1 != -1) {
		for(int i=f1+1;i<=N;i++) if(S[i] != T2[i-1]) { ok ^= 2; break; }
	}
	if(ok == 3 && !strcmp(T1+1, T2+1)) ok = 1;
	T1[N/2+1] = T2[N/2+1] = 0;
	if(ok == 0) { puts("NOT POSSIBLE"); return; }
	else if(ok == 1) printf("%s\n", T1+1);
	else if(ok == 2) printf("%s\n", T2+1);
	else puts("NOT UNIQUE");
}

int main(){
	int Tc = 1; // scanf("%d\n", &Tc);
	for(int tc=1;tc<=Tc;tc++){
		solve();
	}
	return 0;
}

Compilation message

friends.cpp: In function 'void solve()':
friends.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
friends.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", S+1);
  ~~~~~^~~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 628 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 660 KB Output is correct
6 Correct 3 ms 664 KB Output is correct
7 Correct 2 ms 668 KB Output is correct
8 Correct 2 ms 808 KB Output is correct
9 Correct 2 ms 808 KB Output is correct
10 Correct 2 ms 808 KB Output is correct
11 Correct 3 ms 808 KB Output is correct
12 Correct 2 ms 836 KB Output is correct
13 Correct 2 ms 840 KB Output is correct
14 Correct 3 ms 844 KB Output is correct
15 Correct 3 ms 848 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 2 ms 856 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 2 ms 864 KB Output is correct
20 Correct 2 ms 868 KB Output is correct
21 Correct 2 ms 872 KB Output is correct
22 Correct 3 ms 896 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 2 ms 904 KB Output is correct
25 Correct 2 ms 948 KB Output is correct
26 Correct 3 ms 952 KB Output is correct
27 Correct 3 ms 956 KB Output is correct
28 Correct 3 ms 956 KB Output is correct
29 Correct 2 ms 964 KB Output is correct
30 Correct 3 ms 968 KB Output is correct
31 Correct 4 ms 972 KB Output is correct
32 Correct 2 ms 992 KB Output is correct
33 Correct 2 ms 996 KB Output is correct
34 Correct 2 ms 1004 KB Output is correct
35 Correct 3 ms 1004 KB Output is correct
36 Correct 2 ms 1012 KB Output is correct
37 Correct 2 ms 1016 KB Output is correct
38 Correct 2 ms 1020 KB Output is correct
39 Correct 3 ms 1024 KB Output is correct
40 Correct 2 ms 1028 KB Output is correct
41 Correct 3 ms 1032 KB Output is correct
42 Correct 2 ms 1036 KB Output is correct
43 Correct 3 ms 1040 KB Output is correct
44 Correct 2 ms 1040 KB Output is correct
45 Correct 2 ms 1048 KB Output is correct
46 Correct 3 ms 1056 KB Output is correct
47 Correct 2 ms 1056 KB Output is correct
48 Correct 3 ms 1064 KB Output is correct
49 Correct 3 ms 1064 KB Output is correct
50 Correct 2 ms 1068 KB Output is correct
51 Correct 2 ms 1072 KB Output is correct
52 Correct 2 ms 1076 KB Output is correct
53 Correct 3 ms 1076 KB Output is correct
54 Correct 2 ms 1076 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 9908 KB Output is correct
2 Correct 21 ms 11780 KB Output is correct
3 Correct 21 ms 13752 KB Output is correct
4 Correct 34 ms 15804 KB Output is correct
5 Correct 31 ms 17680 KB Output is correct
6 Correct 14 ms 17680 KB Output is correct
7 Correct 30 ms 21612 KB Output is correct
8 Correct 25 ms 21900 KB Output is correct
9 Correct 23 ms 24556 KB Output is correct
10 Correct 23 ms 26188 KB Output is correct
11 Correct 17 ms 26684 KB Output is correct
12 Correct 2 ms 26684 KB Output is correct
13 Correct 3 ms 26684 KB Output is correct
14 Correct 2 ms 26684 KB Output is correct
15 Correct 2 ms 26684 KB Output is correct
16 Correct 2 ms 26684 KB Output is correct
17 Correct 3 ms 26684 KB Output is correct
18 Correct 3 ms 26684 KB Output is correct
19 Correct 2 ms 26684 KB Output is correct
20 Correct 2 ms 26684 KB Output is correct
21 Correct 3 ms 26684 KB Output is correct
22 Correct 2 ms 26684 KB Output is correct
23 Correct 3 ms 26684 KB Output is correct
24 Correct 4 ms 26684 KB Output is correct
25 Correct 4 ms 26684 KB Output is correct
26 Correct 3 ms 26684 KB Output is correct
27 Correct 3 ms 26684 KB Output is correct
28 Correct 2 ms 26684 KB Output is correct
29 Correct 2 ms 26684 KB Output is correct
30 Correct 2 ms 26684 KB Output is correct
31 Correct 2 ms 26684 KB Output is correct
32 Correct 2 ms 26684 KB Output is correct
33 Correct 2 ms 26684 KB Output is correct
34 Correct 3 ms 26684 KB Output is correct
35 Correct 3 ms 26684 KB Output is correct
36 Correct 3 ms 26684 KB Output is correct
37 Correct 2 ms 26684 KB Output is correct
38 Correct 3 ms 26684 KB Output is correct
39 Correct 2 ms 26684 KB Output is correct
40 Correct 2 ms 26684 KB Output is correct
41 Correct 2 ms 26684 KB Output is correct
42 Correct 2 ms 26684 KB Output is correct
43 Correct 2 ms 26684 KB Output is correct
44 Correct 2 ms 26684 KB Output is correct
45 Correct 3 ms 26684 KB Output is correct
46 Correct 2 ms 26684 KB Output is correct
47 Correct 3 ms 26684 KB Output is correct
48 Correct 2 ms 26684 KB Output is correct
49 Correct 2 ms 26684 KB Output is correct
50 Correct 2 ms 26684 KB Output is correct
51 Correct 3 ms 26684 KB Output is correct
52 Correct 3 ms 26684 KB Output is correct
53 Correct 2 ms 26684 KB Output is correct
54 Correct 3 ms 26684 KB Output is correct