oj.uz

답안 #152081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152081 2019-09-06T10:21:22 Z cheetose 세 명의 친구들 (BOI14_friends) C++11
100 / 100
 157 ms 39436 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000021;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

char s[2000005];
ll H[2000005],p[2000005];
set<string> S;
ll Hash(int l,int r)
{
	if(l>r)return 0;
	int L=r-l+1;
	ll res=H[r]-(H[l-1]*p[L])%MOD;
	if(res<0)res+=MOD;
	return res;
}
void add(int l,int r)
{
	string ss;
	fup(i,l,r,1)ss+=s[i];
	S.insert(ss);
}
int main() {
	int n;
	scanf("%d%s",&n,s+1);
	if(n%2==0)return !printf("NOT POSSIBLE");
	p[0]=1;
	fup(i,1,2000002,1)p[i]=(p[i-1]*37)%MOD;
	fup(i,1,n,1)H[i]=(H[i-1]*37+s[i]-'A'+1)%MOD;
	fup(i,1,n/2+1,1)
	{
		int t1=i-1,t2=(n+1)/2-i;
		if(Hash(1,i-1)==Hash(n/2+2,n/2+i) && Hash(i+1,(n+1)/2)==Hash(n/2+i+1,n))
		{
			add(n/2+2,n);
			break;
		}
	}
	fup(i,n/2+1,n,1)
	{
		int t1=i-n/2-1;
		if(Hash(1,t1)==Hash((n+1)/2,i-1) && Hash(t1+1,n/2)==Hash(i+1,n))
		{
			add(1,n/2);
			break;
		}
	}
	if(S.empty())return !printf("NOT POSSIBLE");
	if(S.size()>1)return !printf("NOT UNIQUE");
	return !printf("%s",(*S.begin()).c_str());
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:89:7: warning: unused variable 't1' [-Wunused-variable]
   int t1=i-1,t2=(n+1)/2-i;
       ^~
friends.cpp:89:14: warning: unused variable 't2' [-Wunused-variable]
   int t1=i-1,t2=(n+1)/2-i;
              ^~
friends.cpp:82:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%s",&n,s+1);
  ~~~~~^~~~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 37780 KB Output is correct
2 Correct 91 ms 37648 KB Output is correct
3 Correct 86 ms 37652 KB Output is correct
4 Correct 92 ms 37652 KB Output is correct
5 Correct 92 ms 37752 KB Output is correct
6 Correct 10 ms 4216 KB Output is correct
7 Correct 83 ms 39436 KB Output is correct
8 Correct 91 ms 36284 KB Output is correct
9 Correct 94 ms 35520 KB Output is correct
10 Correct 84 ms 35520 KB Output is correct
11 Correct 73 ms 32388 KB Output is correct
12 Correct 26 ms 16068 KB Output is correct
13 Correct 26 ms 15992 KB Output is correct
14 Correct 25 ms 15992 KB Output is correct
15 Correct 26 ms 15992 KB Output is correct
16 Correct 25 ms 15992 KB Output is correct
17 Correct 24 ms 15992 KB Output is correct
18 Correct 28 ms 15992 KB Output is correct
19 Correct 30 ms 15992 KB Output is correct
20 Correct 29 ms 15992 KB Output is correct
21 Correct 29 ms 15972 KB Output is correct
22 Correct 26 ms 15964 KB Output is correct
23 Correct 32 ms 16120 KB Output is correct
24 Correct 29 ms 15976 KB Output is correct
25 Correct 28 ms 15992 KB Output is correct
26 Correct 29 ms 15992 KB Output is correct
27 Correct 29 ms 15992 KB Output is correct
28 Correct 29 ms 15924 KB Output is correct
29 Correct 28 ms 15992 KB Output is correct
30 Correct 29 ms 16016 KB Output is correct
31 Correct 26 ms 16020 KB Output is correct
32 Correct 25 ms 15992 KB Output is correct
33 Correct 26 ms 15992 KB Output is correct
34 Correct 28 ms 15956 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 26 ms 15992 KB Output is correct
39 Correct 28 ms 15992 KB Output is correct
40 Correct 26 ms 15992 KB Output is correct
41 Correct 26 ms 15992 KB Output is correct
42 Correct 25 ms 16124 KB Output is correct
43 Correct 25 ms 15992 KB Output is correct
44 Correct 25 ms 15992 KB Output is correct
45 Correct 26 ms 15992 KB Output is correct
46 Correct 25 ms 15992 KB Output is correct
47 Correct 25 ms 15996 KB Output is correct
48 Correct 25 ms 15992 KB Output is correct
49 Correct 25 ms 15992 KB Output is correct
50 Correct 26 ms 15992 KB Output is correct
51 Correct 25 ms 15992 KB Output is correct
52 Correct 25 ms 15992 KB Output is correct
53 Correct 26 ms 15992 KB Output is correct
54 Correct 25 ms 15992 KB Output is correct