oj.uz

Submission #80524

# Submission time Handle Problem Language Result Execution time Memory
80524 2018-10-21T07:41:16 Z quoriess Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 1583 ms 29548 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<int,int> pii;
#define dbg(x) cout<<#x<<" has a value of: "<<x<<"\n";
#define usize(x) (int)(x.size())
#define plist(x) for(int i=0;i<usize(x);i++)cout<<"eleman "<<i<<" = "<<x[i]<<"\n";
#define foreach(x) for(auto item:x)
#define fill(s,x) for(int i=0;i<x;i++)cin>>s[i];
std::ostream& operator<<(std::ostream& os, pair<int,int> p) {
    os << p.first << ", " << p.second;
    return os;
}
const lli HASH_MOD=1e9+7;
const lli HASH_BASE=37;
lli extended(lli a,lli b,lli* x, lli* y){
	if(a==0){
		*x=0;
		*y=1;
		return b;
	}
	lli x1,y1;
	lli gcdv=extended(b%a,a,&x1,&y1);
	*x=y1-(b/a)*x1;
	*y=x1;
	return gcdv;
}
lli inverse(lli a){
	lli x,y;
	extended(a,HASH_MOD,&x,&y);
	return (x+HASH_MOD)%HASH_MOD;
}
lli fastPow(lli a,lli b){
	if(b==0)return 1;
	lli snc=fastPow(a,b/2)*fastPow(a,b/2);
	snc=(snc+HASH_MOD)%HASH_MOD;
	if(b&1)snc*=a;
	return (snc+HASH_MOD)%HASH_MOD;
}
/*
4 bonobo deleted racecar racecars

 * */
int main(){
	int t;
	cin>>t;
	while(t--){
		string s;
		cin>>s;
		int n=s.size();
		vector<lli> pre(n+1);
		for(int i=0;i<n;i++){
			pre[i+1]=(pre[i]*HASH_BASE+s[i]-'a'+1+HASH_MOD)%HASH_MOD;
		}
		lli cvb=0;
		lli cst=0,cend=n;
		int i=1;
		for(;;){
			if(cst+i>=cend-i+1)break;
			//dbg(i);
			//dbg(cst);
			//dbg(cend);
			lli on=((pre[cst+i]-pre[cst]*fastPow(HASH_BASE,i))%HASH_MOD+HASH_MOD)%HASH_MOD;
			lli son=(((pre[cend]-pre[cend-i]*fastPow(HASH_BASE,i))%HASH_MOD)+HASH_MOD)%HASH_MOD;
			//dbg(on);
			//dbg(son);
			if(on==son){
				cvb+=2;
				cst+=i;
				cend-=i;
				i=1;
				//cout<<"*****************\n";
			}
			else i++;
		}
		if(cst<cend)cvb++;
		cout<<cvb<<"\n";
	}
	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 480 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 2 ms 480 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 3 ms 592 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 2 ms 480 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 3 ms 592 KB Output is correct
10 Correct 13 ms 728 KB Output is correct
11 Correct 11 ms 852 KB Output is correct
12 Correct 13 ms 936 KB Output is correct
13 Correct 7 ms 1032 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 2 ms 480 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 3 ms 592 KB Output is correct
10 Correct 13 ms 728 KB Output is correct
11 Correct 11 ms 852 KB Output is correct
12 Correct 13 ms 936 KB Output is correct
13 Correct 7 ms 1032 KB Output is correct
14 Correct 1447 ms 22328 KB Output is correct
15 Correct 1263 ms 27612 KB Output is correct
16 Correct 1583 ms 29548 KB Output is correct
17 Correct 310 ms 29548 KB Output is correct