oj.uz

답안 #115792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115792 2019-06-09T06:44:26 Z Mahdi_Jfri 세 명의 친구들 (BOI14_friends) C++14
100 / 100
 79 ms 21912 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back

const int maxn = 2e6 + 20;
const int mod = 1e9 + 7;
const int base = 4001;

int pw[maxn] , h[maxn];

int get(int l , int r)
{
	if(l >= r)
		return 0;
	return (h[r] - (1LL * h[l] * pw[r - l] % mod) + mod) % mod;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	pw[0] = 1;
	for(int i = 1; i < maxn; i++)
		pw[i] = 1LL * pw[i - 1] * base % mod;

	int n;
	string s;
	cin >> n >> s;

	if(n % 2 == 0)
		return cout << "NOT POSSIBLE" << endl , 0;

	for(int i = 0; i < n; i++)
		h[i + 1] = (1LL * h[i] * base + s[i]) % mod;

	int ans = -1 , H = -1;
	for(int i = 0; i < n; i++)
	{
		int h1 , h2;
		if(i <= n / 2)
		{
			h1 = (1LL * get(0 , i) * pw[n / 2 - i] + get(i + 1 , n / 2 + 1)) % mod;
			h2 = get(n / 2 + 1 , n);
		}
		else
		{
			h1 = get(0 , n / 2);
			h2 = (1LL * get(n / 2 , i) * pw[n / 2 - (i - n / 2)] + get(i + 1 , n)) % mod;
		}

		if(h1 == h2)
		{
			if(ans != -1 && H != h1)
				return cout << "NOT UNIQUE" << endl , 0;
			ans = i;
			H = h1;
		}
	}

	if(ans == -1)
		return cout << "NOT POSSIBLE" << endl , 0;

	if(ans <= n / 2)
		cout << s.substr(n / 2 + 1 , n / 2) << endl;
	else
		cout << s.substr(0 , n / 2) << endl;
}

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 8164 KB Output is correct
2 Correct 19 ms 8192 KB Output is correct
3 Correct 19 ms 8192 KB Output is correct
4 Correct 20 ms 8192 KB Output is correct
5 Correct 19 ms 8164 KB Output is correct
6 Correct 19 ms 8192 KB Output is correct
7 Correct 20 ms 8192 KB Output is correct
8 Correct 19 ms 8288 KB Output is correct
9 Correct 18 ms 8192 KB Output is correct
10 Correct 18 ms 8192 KB Output is correct
11 Correct 18 ms 8192 KB Output is correct
12 Correct 18 ms 8192 KB Output is correct
13 Correct 18 ms 8192 KB Output is correct
14 Correct 18 ms 8184 KB Output is correct
15 Correct 18 ms 8184 KB Output is correct
16 Correct 19 ms 8184 KB Output is correct
17 Correct 18 ms 8192 KB Output is correct
18 Correct 18 ms 8192 KB Output is correct
19 Correct 18 ms 8184 KB Output is correct
20 Correct 19 ms 8184 KB Output is correct
21 Correct 18 ms 8192 KB Output is correct
22 Correct 20 ms 8184 KB Output is correct
23 Correct 18 ms 8192 KB Output is correct
24 Correct 20 ms 8192 KB Output is correct
25 Correct 19 ms 8192 KB Output is correct
26 Correct 19 ms 8104 KB Output is correct
27 Correct 18 ms 8184 KB Output is correct
28 Correct 19 ms 8192 KB Output is correct
29 Correct 19 ms 8184 KB Output is correct
30 Correct 18 ms 8192 KB Output is correct
31 Correct 19 ms 8192 KB Output is correct
32 Correct 19 ms 8192 KB Output is correct
33 Correct 19 ms 8192 KB Output is correct
34 Correct 19 ms 8184 KB Output is correct
35 Correct 19 ms 8192 KB Output is correct
36 Correct 19 ms 8192 KB Output is correct
37 Correct 19 ms 8184 KB Output is correct
38 Correct 21 ms 8192 KB Output is correct
39 Correct 21 ms 8192 KB Output is correct
40 Correct 20 ms 8192 KB Output is correct
41 Correct 19 ms 8236 KB Output is correct
42 Correct 19 ms 8192 KB Output is correct
43 Correct 19 ms 8188 KB Output is correct
44 Correct 19 ms 8192 KB Output is correct
45 Correct 18 ms 8192 KB Output is correct
46 Correct 19 ms 8184 KB Output is correct
47 Correct 18 ms 8192 KB Output is correct
48 Correct 20 ms 8192 KB Output is correct
49 Correct 18 ms 8192 KB Output is correct
50 Correct 18 ms 8192 KB Output is correct
51 Correct 18 ms 8192 KB Output is correct
52 Correct 18 ms 8192 KB Output is correct
53 Correct 19 ms 8184 KB Output is correct
54 Correct 18 ms 8192 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 19864 KB Output is correct
2 Correct 75 ms 21912 KB Output is correct
3 Correct 77 ms 21876 KB Output is correct
4 Correct 79 ms 21912 KB Output is correct
5 Correct 76 ms 21912 KB Output is correct
6 Correct 24 ms 12316 KB Output is correct
7 Correct 79 ms 21884 KB Output is correct
8 Correct 69 ms 18948 KB Output is correct
9 Correct 70 ms 20504 KB Output is correct
10 Correct 71 ms 20508 KB Output is correct
11 Correct 67 ms 18076 KB Output is correct
12 Correct 21 ms 8192 KB Output is correct
13 Correct 18 ms 8192 KB Output is correct
14 Correct 18 ms 8192 KB Output is correct
15 Correct 20 ms 8192 KB Output is correct
16 Correct 19 ms 8184 KB Output is correct
17 Correct 20 ms 8192 KB Output is correct
18 Correct 20 ms 8192 KB Output is correct
19 Correct 19 ms 8192 KB Output is correct
20 Correct 19 ms 8192 KB Output is correct
21 Correct 19 ms 8192 KB Output is correct
22 Correct 20 ms 8192 KB Output is correct
23 Correct 19 ms 8184 KB Output is correct
24 Correct 20 ms 8192 KB Output is correct
25 Correct 18 ms 8192 KB Output is correct
26 Correct 19 ms 8192 KB Output is correct
27 Correct 19 ms 8192 KB Output is correct
28 Correct 18 ms 8192 KB Output is correct
29 Correct 19 ms 8192 KB Output is correct
30 Correct 19 ms 8184 KB Output is correct
31 Correct 19 ms 8192 KB Output is correct
32 Correct 20 ms 8192 KB Output is correct
33 Correct 21 ms 8192 KB Output is correct
34 Correct 20 ms 8192 KB Output is correct
35 Correct 19 ms 8192 KB Output is correct
36 Correct 20 ms 8192 KB Output is correct
37 Correct 19 ms 8192 KB Output is correct
38 Correct 18 ms 8184 KB Output is correct
39 Correct 18 ms 8192 KB Output is correct
40 Correct 19 ms 8192 KB Output is correct
41 Correct 18 ms 8192 KB Output is correct
42 Correct 18 ms 8192 KB Output is correct
43 Correct 18 ms 8192 KB Output is correct
44 Correct 18 ms 8192 KB Output is correct
45 Correct 18 ms 8192 KB Output is correct
46 Correct 19 ms 8184 KB Output is correct
47 Correct 18 ms 8192 KB Output is correct
48 Correct 18 ms 8192 KB Output is correct
49 Correct 18 ms 8124 KB Output is correct
50 Correct 19 ms 8192 KB Output is correct
51 Correct 18 ms 8168 KB Output is correct
52 Correct 19 ms 8192 KB Output is correct
53 Correct 18 ms 8192 KB Output is correct
54 Correct 18 ms 8192 KB Output is correct