제출 #585635

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
585635	2022-06-29 06:56:18	amunduzbaev	Palindromic Partitions (CEOI17_palindromic)	C++17	100 / 100	140 ms	11708 KiB

palindromic

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
typedef int64_t ll;
const int N = 1e4 + 5;
const int P = 167;
const int mod = 1e9 + 7;
void solve(){
  string s; cin >> s;
  int n = s.size();
  s = "#" + s;
  int h[n + 1] {}, pw[n + 1];
  pw[0] = 1;
  for(int i=1;i<=n;i++){
    h[i] = (h[i - 1] * 1ll * P + s[i] - 'a') % mod;
    pw[i] = pw[i - 1] * 1ll * P % mod;
  }
  
  auto check = [&](int l, int r){ l--;
    return (h[r] - h[l] * 1ll * pw[r - l] % mod + mod) % mod == 
    (h[n - l] - h[n - r] * 1ll * pw[r - l] % mod + mod) % mod;
  };
  
  int res = 0, last = 1;
  for(int i=1;i<=n/2;i++){
    if(check(last, i)){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 40 / 40