oj.uz

답안 #45691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
45691 2018-04-16T03:23:27 Z sorry_Benq Palindromic Partitions (CEOI17_palindromic) C++17
60 / 100
 10000 ms 13800 KB 
#include <bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define mp          make_pair
#define pii         pair<int,int>
#define vi          vector<int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (int)x.size()
#define hell        1000000007
#define endl        '\n'
using namespace std;
const int MAXN=1000005;
string s;
struct PalindromicTree{
    int N,cur;
    vector<map<int,int>> next;
    vector<int> link,start,len,diff,slink;
    PalindromicTree(): N(0),cur(0){
        node();
        len[0]=-1;
        node();
    }
    int node(){
        next.emplace_back();
        link.emplace_back(0);
        start.emplace_back(0);
        len.emplace_back(0);
        diff.emplace_back(0);
        slink.emplace_back(0);
        return N++;
    }
    void add_letter(int idx){
		//cout << s[idx] << endl;
        while(true){
            if(idx-len[cur]-1>=0 && s[idx-len[cur]-1]==s[idx])
                break;
            cur=link[cur];
        }
        if(next[cur].find(s[idx])!=next[cur].end()){
            cur=next[cur][s[idx]];
            return;
        }
        node();
        next[cur][s[idx]]=N-1;
        len[N-1]=len[cur]+2;
        start[N-1]=idx-len[N-1]+1;
        if(len[N-1]==1){
            link[N-1]=diff[N-1]=slink[N-1]=1;
            cur=N-1;
            return;
        }
        while(true){
            cur=link[cur];
            if(idx-len[cur]-1>=0 && s[idx-len[cur]-1]==s[idx])
                break;
        }
        link[N-1]=next[cur][s[idx]];
        diff[N-1]=len[N-1]-len[link[N-1]];
        if(diff[N-1]==diff[link[N-1]])
        	slink[N-1]=slink[link[N-1]];
        else
        	slink[N-1]=link[N-1];
        cur=N-1;
    }
};
ll dp[MAXN],sans[MAXN];
int main()
{
	int T; cin >> T;
	for (int testcase = 0; testcase < T; testcase++){
		string str;
		cin>>str;
		//cout << str << endl;
		PalindromicTree pt;
		int i,cur;
		s.clear();
		for(i=0;i<sz(str)/2;i++){
			s.pb(str[i]);
			s.pb(str[sz(str)-i-1]);
		}
		if (sz(str) % 2){
			s.pb(str[sz(str)/2]);
		}
		//cout << s.size() << endl;
		dp[0]=0;
		int res = 1;
		for(i=1;i<=sz(s);i++){
			dp[i] = -hell;
			pt.add_letter(i-1);
			//cout << i << ' ' << dp[i] << ' ' << pt.cur << endl;
			int cnt = 0;
			for(cur=pt.cur;cur>1;cur=pt.link[cur]){
				if (pt.len[cur] % 2 == 0){
					dp[i] = max(dp[i], dp[i - pt.len[cur]] + 2);
				}
			}
			int cur = dp[i];
			if (i != sz(s)) cur++;
			if (cur > res) res = cur;
		}
		cout << res << endl;
	}
}

Compilation message

palindromic.cpp: In function 'int main()':
palindromic.cpp:93:8: warning: unused variable 'cnt' [-Wunused-variable]
    int cnt = 0;
        ^~~

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 714 ms 2140 KB Output is correct
11 Correct 65 ms 2140 KB Output is correct
12 Correct 35 ms 2140 KB Output is correct
13 Correct 17 ms 2140 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 714 ms 2140 KB Output is correct
11 Correct 65 ms 2140 KB Output is correct
12 Correct 35 ms 2140 KB Output is correct
13 Correct 17 ms 2140 KB Output is correct
14 Execution timed out 10102 ms 13800 KB Time limit exceeded
15 Halted 0 ms 0 KB -