제출 #348404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348404		elizarv	회문 (APIO14_palindrome)	C++14	47 / 100	69 ms	63304 KiB

palindrome

#include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T a,Args... args) {cout<<a<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;

const int alfa = 26;
const char L = 'a';

struct node {
  int next[alfa], link, len;
  ll cnt;
  node(int x, int l = 0, ll c = 1): len(x), link(l), cnt(c){
    memset(next, 0, sizeof next);
  }
  int& operator[](int i) { return next[i]; }
};

struct palindromic_tree {
  vector<node> tree;
  string s;
  int n;
  int last;
  palindromic_tree(string t = ""){
    n = 0;
    tree.pb(node(-1));
    tree.pb(node(0));
    for(auto &c: t)add_char(c);
  }

  int getlink(int p){
    while(s[n - tree[p].len - 1] != s[n])p = tree[p].link;
    return p;
  }

  void add_char(char ch){
    s.pb(ch);
    int p = getlink(last), c = ch - L;
    if(!tree[p][c]){
      int link = getlink(tree[p].link);
      link = max(1, tree[link][c]);
      tree[p][c] = SZ(tree);
      tree.pb(node(tree[p].len+2,link, 0));
    }
    last = tree[p][c];
    tree[last].cnt++;
    n++;
  }

  int getans(){
    int ans = 0;
    for(int i = tree.size()-1; i; i--){
      int aux = tree[i].len * tree[i].cnt;
      ans = max(ans, aux);
      int par = tree[i].link;
      tree[par].cnt += tree[i].cnt;
    }
    return ans;
  }
};


int main() {
  ios::sync_with_stdio(0); cin.tie(0);

  string s;
  cin >> s;
  palindromic_tree pt(s);

  cout << pt.getans() << endl;


  

}

컴파일 시 표준 에러 (stderr) 메시지

palindrome.cpp: In constructor 'node::node(int, int, ll)':
palindrome.cpp:19:25: warning: 'node::len' will be initialized after [-Wreorder]
   19 |   int next[alfa], link, len;
      |                         ^~~
palindrome.cpp:19:19: warning:   'int node::link' [-Wreorder]
   19 |   int next[alfa], link, len;
      |                   ^~~~
palindrome.cpp:21:3: warning:   when initialized here [-Wreorder]
   21 |   node(int x, int l = 0, ll c = 1): len(x), link(l), cnt(c){
      |   ^~~~

• Subtask 1: 8 / 8
• Subtask 2: 15 / 15
• Subtask 3: 24 / 24
• Subtask 4: 0 / 26
• Subtask 5: 0 / 27