# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118475 | VinhLuu | Palindromes (APIO14_palindrome) | C++17 | 880 ms | 48296 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 int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()
using namespace std;
typedef pair<ll, ll> pii;
const int N = 3e5 + 5;
const int M = 1e6 + 5;
const ll oo = 1e16;
int n, a[N];
int pos[N], sa[N], gap, tmp[N], lcp[N], LG[N], dp[22][N];
ll ans = 0;
bool cmp(int x,int y){
if(pos[x] != pos[y]) return pos[x] < pos[y];
x += gap;
y += gap;
return (x <= n && y <= n ? pos[x] < pos[y] : x > y);
}
void SA(){
gap = 1;
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... |