oj.uz

답안 #111471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111471 2019-05-15T12:46:40 Z dndhk Palindromic Partitions (CEOI17_palindromic) C++14
60 / 100
 10000 ms 49256 KB 
#include <bits/stdc++.h>

#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL


using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll P1 = 41;
const ll P2 = 1000000009;

int T;
string str;

long long str1;
set<ll> st;

ll pw(ll x, ll y){
	if(y==0)	return 1;
	if(y==1)	return x;
	ll m = pw(x, y/2);
	if(y%2){
		return (m*m%P2) * x % P2;
	}else{
		return m*m % P2;
	}
}

int calc(int x, int y){
	if(x>y)	return 0;
	if(x==y)	return 1;
	ll num = 0;
	int l = 1;
	while(1){
		if(x+l-1 > y-l+1)	return 1;
		num = ((num * P1) + (str[x+l-1] - 'a' + 1)) % P2;
		if(st.find((str1 + num * pw(P1, x))%P2)!=st.end()){
			str1 = (str1 + num *  pw(P1, x))%P2;
			return 2+calc(x+l, y-l);
		}
		l++;
	}
}

int main(){
	cin>>T;
	while(T--){
		cin>>str;
		str1 = 0;
		ll num = 0;
		ll m = 1;
		st.clear();
		for(int i=str.size()-1; i>=0; i--){
			num = (num + (str[i]-'a'+1) * m) % P2;
			m = (m * P1) % P2;
			st.insert(num);
		}
		cout<<calc(0, str.size()-1)<<endl;
	}
	return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 46 ms 768 KB Output is correct
11 Correct 23 ms 768 KB Output is correct
12 Correct 35 ms 768 KB Output is correct
13 Correct 40 ms 768 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 46 ms 768 KB Output is correct
11 Correct 23 ms 768 KB Output is correct
12 Correct 35 ms 768 KB Output is correct
13 Correct 40 ms 768 KB Output is correct
14 Execution timed out 10076 ms 49256 KB Time limit exceeded
15 Halted 0 ms 0 KB -