oj.uz

Submission #313720

# Submission time Handle Problem Language Result Execution time Memory
313720 2020-10-16T20:03:43 Z bigg Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 523 ms 42732 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
typedef long long ll;
ll hash1[MAXN], hash2[MAXN];
ll pp1[MAXN], pp2[MAXN];
ll p1 = 37, p2 = 101;
pair<ll, ll>  subhash(int i, int j){
	return make_pair(hash1[i] - (j ? hash1[j - 1] * pp1[i - j + 1] : 0),
					 hash2[i] - (j ? hash2[j - 1] * pp2[i - j + 1] : 0));
}
string s;
int n;
void resetandin(){
	cin >> s;
	n = s.length();
	hash1[0] = hash2[0] = s[0];
	for(int i = 1; i < n; i ++){
		hash1[i] = hash1[i-1] * p1 + s[i];
		hash2[i] = hash2[i-1] * p2 + s[i];
	}
}


int main(){
	pp1[0] = pp2[0] = 1;
	for(int i = 1; i < MAXN; i++){
		pp1[i] = pp1[i-1] * p1;
		pp2[i] = pp2[i-1] * p2;
	}
	int t;
	cin >> t;
	while(t--){
		resetandin();
		int ans = 0;
		int esq = 0, dir = n - 1; 
		for(int i = 0; i < n/2; i++){
			// esq.push_back(s[i]);
			// dir = (s[s.length()-i-1]) + dir;
		//	printf("%d %d %d %d\n",i, esq, dir, n-i-1 );
		//	printf("%lld %lld\n", subhash(i, esq).first, subhash(dir, n - i - 1).second);
			if(subhash(i, esq) == subhash(dir, n - i - 1)){
				esq = i+1;
				dir = n - i - 2;
				ans+=2;
			}
		}
		if(s.length()%2 ||esq < n/2)ans++;
		cout << ans << endl;
	}
}

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16000 KB Output is correct
2 Correct 9 ms 16000 KB Output is correct
3 Correct 9 ms 16000 KB Output is correct
4 Correct 9 ms 16000 KB Output is correct
5 Correct 9 ms 16000 KB Output is correct
6 Correct 9 ms 16000 KB Output is correct
7 Correct 9 ms 16000 KB Output is correct
8 Correct 9 ms 16000 KB Output is correct
9 Correct 9 ms 16000 KB Output is correct
10 Correct 17 ms 16256 KB Output is correct
11 Correct 13 ms 16256 KB Output is correct
12 Correct 14 ms 16256 KB Output is correct
13 Correct 14 ms 16256 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16000 KB Output is correct
2 Correct 9 ms 16000 KB Output is correct
3 Correct 9 ms 16000 KB Output is correct
4 Correct 9 ms 16000 KB Output is correct
5 Correct 9 ms 16000 KB Output is correct
6 Correct 9 ms 16000 KB Output is correct
7 Correct 9 ms 16000 KB Output is correct
8 Correct 9 ms 16000 KB Output is correct
9 Correct 9 ms 16000 KB Output is correct
10 Correct 17 ms 16256 KB Output is correct
11 Correct 13 ms 16256 KB Output is correct
12 Correct 14 ms 16256 KB Output is correct
13 Correct 14 ms 16256 KB Output is correct
14 Correct 523 ms 42732 KB Output is correct
15 Correct 286 ms 37992 KB Output is correct
16 Correct 490 ms 42088 KB Output is correct
17 Correct 282 ms 30412 KB Output is correct