# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
572586 | model_code | Palindromi (COCI22_palindromi) | C++17 | 480 ms | 144404 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |