oj.uz

답안 #339430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
339430 2020-12-25T08:24:51 Z nandonathaniel Palindromic Partitions (CEOI17_palindromic) C++14
35 / 100
 22 ms 1388 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN=305,MOD=1e9+7;
 
int pref[MAXN],pkt[MAXN];
int dp[MAXN][MAXN];
string s;
 
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){
	if(L>R)return 0;
	int &ret=dp[L][R];
	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,R-i));
		}
	}
	return ret;
}
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t,n;
	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) << '\n';
	}
	return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Runtime error 22 ms 1388 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Runtime error 22 ms 1388 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Halted 0 ms 0 KB -