oj.uz

Submission #493247

# Submission time Handle Problem Language Result Execution time Memory
493247 2021-12-10T13:40:45 Z MladenP Palindromes (APIO14_palindrome) C++17
100 / 100
 75 ms 63236 KB 
#include <bits/stdc++.h>
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
using namespace std;

struct PalTree {
    #define P_SIGMA 26
    #define FIRST_NODE 1
    #define SECOND_NODE 2
    struct Node {
        int len, cnt, dub, slink;
        int to[P_SIGMA];
        Node() { len = cnt = dub = slink = 0; for(int i = 0; i < P_SIGMA; i++) to[i] = 0; }
        Node(int _len, int _cnt, int _dub, int _slink) {
            len = _len; cnt = _cnt; dub = _dub; slink = _slink;
            for(int i = 0; i < P_SIGMA; i++) to[i] = 0;
        }
    };
    string s;
    vector<Node> pt;
    int suff;
    int toidx(char c) { return c-'a'; }
    void addLetter(char c) {
        s += c; int len = s.size();
        while(c != s[len-2-pt[suff].len]) {
            suff = pt[suff].slink;
        }
        int nd = pt[suff].to[toidx(c)];
        if(nd == 0) {
            nd = pt.size();
            pt[suff].to[toidx(c)] = nd;
            pt.push_back(Node(pt[suff].len+2, 0, 0, 0));
            if(suff == FIRST_NODE) {
                pt[nd].slink = SECOND_NODE;
            } else {
                int u = pt[suff].slink;
                while(c != s[len-2-pt[u].len]) {
                    u = pt[u].slink;
                }
                pt[nd].slink = pt[u].to[toidx(c)];
            }
            pt[nd].dub = pt[pt[nd].slink].dub+1;
        }
        pt[nd].cnt++;
        suff = nd;
    }
    void init() {
        pt.clear();
        s = "";
        suff = 2;
        pt.push_back(Node(0, 0, 0, 0));
        pt.push_back(Node(-1, 0, 0, FIRST_NODE)); ///first node
        pt.push_back(Node(0, 0, 0, FIRST_NODE)); ///second node
    }
    Node &operator[](int idx) {
        if(idx >= pt.size()) {
            cerr << "Index out of bounds" <<endl;
            return pt[0];
        }
        return pt[idx];
    }
};
PalTree pt;
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    string s; cin >> s;
    pt.init();
    for(auto x : s) {
        pt.addLetter(x);
    }
    long long rez = 0;
    for(int i = pt.pt.size()-1; i > 2; i--) {
        rez = max(rez, (long long) pt[i].len*pt[i].cnt);
        pt[pt[i].slink].cnt += pt[i].cnt;
    }
    cout << rez << endl;
    return 0;
}

Compilation message

palindrome.cpp: In member function 'PalTree::Node& PalTree::operator[](int)':
palindrome.cpp:55:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<PalTree::Node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         if(idx >= pt.size()) {
      |            ~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 0 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 0 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 0 ms 312 KB Output is correct
29 Correct 0 ms 336 KB Output is correct
30 Correct 0 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 1 ms 336 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 444 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 464 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2320 KB Output is correct
2 Correct 2 ms 2412 KB Output is correct
3 Correct 3 ms 2320 KB Output is correct
4 Correct 2 ms 2320 KB Output is correct
5 Correct 2 ms 2320 KB Output is correct
6 Correct 2 ms 2308 KB Output is correct
7 Correct 2 ms 2320 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 1396 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16176 KB Output is correct
2 Correct 15 ms 16084 KB Output is correct
3 Correct 19 ms 16076 KB Output is correct
4 Correct 15 ms 16160 KB Output is correct
5 Correct 16 ms 16172 KB Output is correct
6 Correct 14 ms 16188 KB Output is correct
7 Correct 14 ms 16116 KB Output is correct
8 Correct 6 ms 904 KB Output is correct
9 Correct 9 ms 4660 KB Output is correct
10 Correct 13 ms 16116 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 63236 KB Output is correct
2 Correct 70 ms 63180 KB Output is correct
3 Correct 63 ms 63112 KB Output is correct
4 Correct 61 ms 63196 KB Output is correct
5 Correct 63 ms 63212 KB Output is correct
6 Correct 75 ms 63212 KB Output is correct
7 Correct 44 ms 32052 KB Output is correct
8 Correct 8 ms 1752 KB Output is correct
9 Correct 9 ms 1752 KB Output is correct
10 Correct 36 ms 32068 KB Output is correct
11 Correct 56 ms 63192 KB Output is correct
12 Correct 17 ms 5156 KB Output is correct