oj.uz

Submission #63157

# Submission time Handle Problem Language Result Execution time Memory
63157 2018-08-01T01:29:20 Z khsoo01 Palindromic Partitions (CEOI17_palindromic) C++11
100 / 100
 213 ms 41780 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1000005, M1 = 1e9+7, M2 = 69746969;

ll n, p1[N] = {1}, p2[N] = {1};
char a[N];

struct Hash {
	ll v1, v2, l;
	Hash () {cl();}
	void cl () {v1 = 0; v2 = 0; l = 0;}
};

Hash operator + (char B, Hash A) {
	Hash ret;
	ret.v1 = (A.v1 + B * p1[A.l]) % M1;
	ret.v2 = (A.v2 + B * p2[A.l]) % M2;
	ret.l = A.l + 1;
	return ret;
}

Hash operator + (Hash A, char B) {
	Hash ret;
	ret.v1 = (A.v1 * 26 + B) % M1;
	ret.v2 = (A.v2 * 26 + B) % M2;
	ret.l = A.l + 1;
	return ret;
}

bool operator == (Hash A, Hash B) {
	return (A.l == B.l && A.v1 == B.v1 && A.v2 == B.v2);
}

void solve () {
	scanf("%s",a+1);
	n = strlen(a+1);
	for(ll i=1;i<=n;i++) {
		p1[i] = p1[i-1] * 26 % M1;
		p2[i] = p2[i-1] * 26 % M2;
		a[i] -= 'a';
	}
	Hash A, B;
	ll ans = 0;
	for(ll i=1;i<=n/2;i++) {
		A = A + a[i];
		B = a[n-i+1] + B;
		if(A == B) {A.cl(); B.cl(); ans += 2;}
	}
	if(n%2 || A.l) ans++;
	printf("%lld\n",ans);
}

int main()
{
	int tc;
	scanf("%d",&tc);
	while(tc--) solve();
}

Compilation message

palindromic.cpp: In function 'void solve()':
palindromic.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",a+1);
  ~~~~~^~~~~~~~~~
palindromic.cpp: In function 'int main()':
palindromic.cpp:57:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&tc);
  ~~~~~^~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 664 KB Output is correct
8 Correct 3 ms 664 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 6 ms 952 KB Output is correct
11 Correct 5 ms 952 KB Output is correct
12 Correct 6 ms 1140 KB Output is correct
13 Correct 6 ms 1140 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 664 KB Output is correct
8 Correct 3 ms 664 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 6 ms 952 KB Output is correct
11 Correct 5 ms 952 KB Output is correct
12 Correct 6 ms 1140 KB Output is correct
13 Correct 6 ms 1140 KB Output is correct
14 Correct 213 ms 27448 KB Output is correct
15 Correct 116 ms 32632 KB Output is correct
16 Correct 200 ms 41780 KB Output is correct
17 Correct 118 ms 41780 KB Output is correct