oj.uz

Submission #572586

# Submission time Handle Problem Language Result Execution time Memory
572586 2022-06-04T17:55:26 Z model_code Palindromi (COCI22_palindromi) C++17
110 / 110
 480 ms 144404 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long llint;
typedef pair <int, int> pi;

const int MAXN = 100005;

int n;
string s;
int p[MAXN];

struct olbat {
    int cnt, siz, lef, rig;
    vector <int> len, link, suf[2], child[2];
    deque <char> dq;

    olbat () {
        cnt = 2; siz = 0;
        lef = rig = 1;
        len = {-1, 0};
        child[0] = child[1] = {0, 0};
        link = suf[0] = suf[1] = {0, 0};
    }

    void add_new_node (int par, char c) {
        len.push_back(len[par] + 2);

        child[c - '0'][par] = cnt;
        child[0].push_back(0); child[1].push_back(0);

        if (par != 0) {
            link.push_back(child[c - '0'][suf[c - '0'][par]]);
        } else {
            link.push_back(1);
        }
        suf[0].push_back(0); suf[1].push_back(0);

        cnt++;
    }

    void add_rig (char c) {
        dq.push_back(c);

        int par;
        if (len[rig] < siz && dq[siz - len[rig] - 1] == c) {
            par = rig;
        } else {
            par = suf[c - '0'][rig];
        }

        if (child[c - '0'][par] == 0) {
            add_new_node(par, c);
            if (dq[siz - len[link[cnt - 1]]] == '0') {
                suf[0][cnt - 1] = link[cnt - 1];
                suf[1][cnt - 1] = suf[1][link[cnt - 1]];
            } else {
                suf[0][cnt - 1] = suf[0][link[cnt - 1]];
                suf[1][cnt - 1] = link[cnt - 1];
            }
        }

        siz++;

        rig = child[c - '0'][par];
        if (len[rig] == siz) lef = rig;
    }

    void add_lef (char c) {
        int par;
        if (len[lef] < siz && dq[len[lef]] == c) {
            par = lef;
        } else {
            par = suf[c - '0'][lef];
        }

        if (child[c - '0'][par] == 0) {
            add_new_node(par, c);
            if (len[link[cnt - 1]] - 1 >= 0 && dq[len[link[cnt - 1]] - 1] == '0' || len[link[cnt - 1]] - 1 < 0 && c == '0') {
                suf[0][cnt - 1] = link[cnt - 1];
                suf[1][cnt - 1] = suf[1][link[cnt - 1]];
            } else {
                suf[0][cnt - 1] = suf[0][link[cnt - 1]];
                suf[1][cnt - 1] = link[cnt - 1];
            }
        }

        dq.push_front(c); siz++;

        lef = child[c - '0'][par];
        if (len[lef] == siz) rig = lef;
    }

    void dfs (int node, string s) {
        cout << node << ": " << s << endl;
        string novi;
        if (node == 0) novi = "0"; else novi = "0" + s + "0";
        if (child[0][node]) dfs(child[0][node], novi);
        if (node == 0) novi = "1"; else novi = "1" + s + "1";
        if (child[1][node]) dfs(child[1][node], novi);
    }

    void ispis () {
        for (auto c : dq) cout << c; cout << endl;
    }

    void popis () {
        dfs(0, "");
        dfs(1, "");
    }
} ol[MAXN];

int nadi (int a) {
    if (a == p[a]) return a;
    return p[a] = nadi(p[a]);
}

int spoji (int a, int b) {
    a = nadi(a); b = nadi(b);
    if (ol[a].siz > ol[b].siz) {
        for (int i = 0; i < ol[b].dq.size(); i++) {
            ol[a].add_rig(ol[b].dq[i]);
        }
        p[b] = a;
    } else {
        for (int i = (int) ol[a].dq.size() - 1; i >= 0; i--) {
            ol[b].add_lef(ol[a].dq[i]);
        }
        p[a] = b;
    }
    return p[a];
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> s;
    for (int i = 1; i <= n; i++) {
        ol[i].add_rig(s[i - 1]);
        p[i] = i;
    }
    for (int i = 0; i < n-1; i++) {
        int a, b;
        cin >> a >> b;
        int node = spoji(a, b);
        cout << ol[node].cnt - 2 << endl;
    }
    /*cin >> n;
    for (int i = 1; i <= n; i++) {
        char c, d;
        cin >> c >> d;
        if (d == 'L') ol[0].add_lef(c); else ol[0].add_rig(c);
    }
    cout << ol[0].cnt - 2;*/
    return 0;
}

Compilation message

Main.cpp: In member function 'void olbat::add_lef(char)':
Main.cpp:80:45: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   80 |             if (len[link[cnt - 1]] - 1 >= 0 && dq[len[link[cnt - 1]] - 1] == '0' || len[link[cnt - 1]] - 1 < 0 && c == '0') {
Main.cpp: In member function 'void olbat::ispis()':
Main.cpp:105:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  105 |         for (auto c : dq) cout << c; cout << endl;
      |         ^~~
Main.cpp:105:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  105 |         for (auto c : dq) cout << c; cout << endl;
      |                                      ^~~~
Main.cpp: In function 'int spoji(int, int)':
Main.cpp:122:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |         for (int i = 0; i < ol[b].dq.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 102040 KB Output is correct
2 Correct 109 ms 102064 KB Output is correct
3 Correct 118 ms 102004 KB Output is correct
4 Correct 128 ms 102060 KB Output is correct
5 Correct 116 ms 102092 KB Output is correct
6 Correct 105 ms 101980 KB Output is correct
7 Correct 102 ms 102028 KB Output is correct
8 Correct 85 ms 101988 KB Output is correct
9 Correct 96 ms 101988 KB Output is correct
10 Correct 111 ms 102040 KB Output is correct
11 Correct 95 ms 102048 KB Output is correct
12 Correct 110 ms 101996 KB Output is correct
13 Correct 100 ms 102048 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 102040 KB Output is correct
2 Correct 109 ms 102064 KB Output is correct
3 Correct 118 ms 102004 KB Output is correct
4 Correct 128 ms 102060 KB Output is correct
5 Correct 116 ms 102092 KB Output is correct
6 Correct 105 ms 101980 KB Output is correct
7 Correct 102 ms 102028 KB Output is correct
8 Correct 85 ms 101988 KB Output is correct
9 Correct 96 ms 101988 KB Output is correct
10 Correct 111 ms 102040 KB Output is correct
11 Correct 95 ms 102048 KB Output is correct
12 Correct 110 ms 101996 KB Output is correct
13 Correct 100 ms 102048 KB Output is correct
14 Correct 92 ms 101992 KB Output is correct
15 Correct 126 ms 102188 KB Output is correct
16 Correct 98 ms 102144 KB Output is correct
17 Correct 118 ms 102244 KB Output is correct
18 Correct 92 ms 102268 KB Output is correct
19 Correct 143 ms 102096 KB Output is correct
20 Correct 115 ms 101996 KB Output is correct
21 Correct 116 ms 102108 KB Output is correct
22 Correct 91 ms 102056 KB Output is correct
23 Correct 126 ms 102060 KB Output is correct
24 Correct 107 ms 102076 KB Output is correct
25 Correct 88 ms 102380 KB Output is correct
26 Correct 102 ms 102324 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 103164 KB Output is correct
2 Correct 286 ms 105772 KB Output is correct
3 Correct 300 ms 103080 KB Output is correct
4 Correct 340 ms 105796 KB Output is correct
5 Correct 315 ms 103136 KB Output is correct
6 Correct 344 ms 105756 KB Output is correct
7 Correct 322 ms 103196 KB Output is correct
8 Correct 382 ms 105708 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 102040 KB Output is correct
2 Correct 109 ms 102064 KB Output is correct
3 Correct 118 ms 102004 KB Output is correct
4 Correct 128 ms 102060 KB Output is correct
5 Correct 116 ms 102092 KB Output is correct
6 Correct 105 ms 101980 KB Output is correct
7 Correct 102 ms 102028 KB Output is correct
8 Correct 85 ms 101988 KB Output is correct
9 Correct 96 ms 101988 KB Output is correct
10 Correct 111 ms 102040 KB Output is correct
11 Correct 95 ms 102048 KB Output is correct
12 Correct 110 ms 101996 KB Output is correct
13 Correct 100 ms 102048 KB Output is correct
14 Correct 92 ms 101992 KB Output is correct
15 Correct 126 ms 102188 KB Output is correct
16 Correct 98 ms 102144 KB Output is correct
17 Correct 118 ms 102244 KB Output is correct
18 Correct 92 ms 102268 KB Output is correct
19 Correct 143 ms 102096 KB Output is correct
20 Correct 115 ms 101996 KB Output is correct
21 Correct 116 ms 102108 KB Output is correct
22 Correct 91 ms 102056 KB Output is correct
23 Correct 126 ms 102060 KB Output is correct
24 Correct 107 ms 102076 KB Output is correct
25 Correct 88 ms 102380 KB Output is correct
26 Correct 102 ms 102324 KB Output is correct
27 Correct 328 ms 103164 KB Output is correct
28 Correct 286 ms 105772 KB Output is correct
29 Correct 300 ms 103080 KB Output is correct
30 Correct 340 ms 105796 KB Output is correct
31 Correct 315 ms 103136 KB Output is correct
32 Correct 344 ms 105756 KB Output is correct
33 Correct 322 ms 103196 KB Output is correct
34 Correct 382 ms 105708 KB Output is correct
35 Correct 89 ms 101964 KB Output is correct
36 Correct 480 ms 123288 KB Output is correct
37 Correct 373 ms 119392 KB Output is correct
38 Correct 413 ms 123844 KB Output is correct
39 Correct 436 ms 120468 KB Output is correct
40 Correct 357 ms 105672 KB Output is correct
41 Correct 352 ms 103072 KB Output is correct
42 Correct 306 ms 105716 KB Output is correct
43 Correct 308 ms 103156 KB Output is correct
44 Correct 294 ms 105592 KB Output is correct
45 Correct 297 ms 103244 KB Output is correct
46 Correct 349 ms 144404 KB Output is correct
47 Correct 350 ms 129680 KB Output is correct