제출 #104702

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
104702	2019-04-09 01:00:35	Shtef	Palinilap (COI16_palinilap)	C++14	17 / 100	1077 ms	1536 KiB

palinilap

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 <iostream>
using namespace std;
typedef long long ll;
string s;
int n, cnt1[100005], cnt2[100005];
ll brojpalin(){
  ll ret = 0;
  int l = 0, r = -1;
  for(int i = 0 ; i < n ; ++i){
    int k = (i > r ? 1 : min(cnt1[l + r - i], r - i + 1));
    while(i - k >= 0 && i + k < n && s[i - k] == s[i + k]){
      k++;
    }
    cnt1[i] = k--;
    if(i + k > r){
      l = i - k;
      r = i + k;
    }
    ret += k + 1;
  }
  l = 0;
  r = -1;
  for(int i = 0 ; i < n ; ++i){
    int k = (i > r ? 0 : min(cnt2[l + r - i + 1], r - i + 1));
    while(i - k - 1 >= 0 && i + k < n && s[i - k - 1] == s[i + k]){
      k++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 0 / 37
• Subtask 3: 0 / 46