# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444031 | Killer2501 | Palindromes (APIO14_palindrome) | C++14 | 80 ms | 71244 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>
#define fi first
#define se second
#define pb push_back
using namespace std;
using ll = int;
using pll = pair<ll, ll>;
const int N = 3e5+5;
const int mod = 1e9+7;
int n, m, k, now, suff;
long long ans;
string s;
struct node
{
ll num, len, slink, nxt[26];
vector<ll> e;
}tree[N];
void init()
{
now = suff = 2;
tree[1].len = -1;
tree[1].slink = 1;
tree[1].e.pb(2);
tree[2].len = 0;
tree[2].slink = 1;
}
void add(int pos)
{
int c = s[pos] - 'a';
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |