답안 #339710

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
339710	2020-12-26T04:08:11 Z	nandonathaniel	Palindromic Partitions (CEOI17_palindromic)	C++14	60 / 100	10000 ms	13320 KB

palindromic

#include<bits/stdc++.h>
using namespace std;
const int MAXN=1000005,MOD=1e9+7;
 
int pref[MAXN],pkt[MAXN];
int dp[MAXN],N;
 
int get(int L,int R){
	if(L>R)return 0;
	return (pref[R]-((1LL*pref[L-1]*pkt[R-L+1])%MOD)+MOD)%MOD;
}

int DP(int L){
	int R=N+1-L;
	if(L>R)return 0;
	int &ret=dp[L];
	if(ret!=-1)return ret;
	ret=1;
	for(int i=(R-L+1)/2;i>=1;i--){
		if(get(L,L+i-1)==get(R-i+1,R)){
			ret=max(ret,2+DP(L+i));
		}
	}
	return ret;
}
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t;
	string s;
	cin >> t;
	while(t--){
		cin >> s;
		N=(int)s.length();
		pkt[0]=1;
		for(int i=0;i<N;i++){
			pref[i+1]=(26LL*pref[i]+s[i]-'a')%MOD;
			pkt[i+1]=(26LL*pkt[i])%MOD;
		}
		memset(dp,-1,sizeof(dp));
		cout << DP(1) << '\n';
	}
	return 0;
}

Subtask #1

15.0 / 15.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	4204 KB	Output is correct
2	Correct	4 ms	4204 KB	Output is correct
3	Correct	3 ms	4204 KB	Output is correct
4	Correct	4 ms	4204 KB	Output is correct
5	Correct	4 ms	4204 KB	Output is correct
6	Correct	5 ms	4204 KB	Output is correct
7	Correct	4 ms	4204 KB	Output is correct
8	Correct	4 ms	4204 KB	Output is correct
9	Correct	5 ms	4224 KB	Output is correct
10	Correct	806 ms	4716 KB	Output is correct
11	Correct	119 ms	4460 KB	Output is correct
12	Correct	25 ms	4588 KB	Output is correct
13	Correct	571 ms	4588 KB	Output is correct

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	4204 KB	Output is correct
2	Correct	4 ms	4204 KB	Output is correct
3	Correct	3 ms	4204 KB	Output is correct
4	Correct	4 ms	4204 KB	Output is correct
5	Correct	4 ms	4204 KB	Output is correct
6	Correct	5 ms	4204 KB	Output is correct
7	Correct	4 ms	4204 KB	Output is correct
8	Correct	4 ms	4204 KB	Output is correct
9	Correct	5 ms	4224 KB	Output is correct
10	Correct	806 ms	4716 KB	Output is correct
11	Correct	119 ms	4460 KB	Output is correct
12	Correct	25 ms	4588 KB	Output is correct
13	Correct	571 ms	4588 KB	Output is correct
14	Execution timed out	10026 ms	13320 KB	Time limit exceeded
15	Halted	0 ms	0 KB	-