oj.uz

Submission #644370

# Submission time Handle Problem Language Result Execution time Memory
644370 2022-09-24T13:06:46 Z ymm Palindromic Partitions (CEOI17_palindromic) C++17
100 / 100
 156 ms 12852 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

#define muladd(x, y, z) (((__int128)(x) * (y) + (z)) % mod)

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	int t;
	cin >> t;
	while (t--) {
		string s;
		cin >> s;
		const ll mod = 1'333'333'333'333'333;
		ll pow29 = 1;
		int ans = 0;
		ll h1=0, h2=0;
		Loop (i,0,s.size()) {
			char c1 = s[i]-'a'+1;
			char c2 = s[s.size()-1-i]-'a'+1;
			h1 = muladd(c1, pow29, h1);
			h2 = muladd(h2, 29, c2);
			//cout << h1 << ' ' << h2 << '\n';
			pow29 = muladd(pow29, 29, 0);
			if (h1 == h2) {
				++ans;
				h1 = 0;
				h2 = 0;
				pow29 = 1;
			}
		}
		cout << ans << '\n';
	}

}

Compilation message

palindromic.cpp: In function 'int main()':
palindromic.cpp:2:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    2 | #define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
      |                                        ^
palindromic.cpp:23:3: note: in expansion of macro 'Loop'
   23 |   Loop (i,0,s.size()) {
      |   ^~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 340 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 150 ms 12852 KB Output is correct
15 Correct 84 ms 7784 KB Output is correct
16 Correct 156 ms 12032 KB Output is correct
17 Correct 74 ms 6824 KB Output is correct