# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677933 | Romiros | Palindromes (APIO14_palindrome) | C++17 | 954 ms | 59676 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 ll long long
#define ld long double
#define vi vector<int>
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2", "popcnt")
using namespace std;
const int MAXN = 3e5 + 10;
inline vector<int> build_sa(string s){
s+='$';
int n= s.size();
vector<int>p(n),pn(n),cn(n),c(n),cnt(n);
{
vector<pii>a(n);
for(int i=0;i<n;i++) a[i]={s[i]-'a',i};
sort(all(a));
for(int i=0;i<n;i++) p[i]=a[i].second;
c[p[0]]=0;
for(int i=1;i<n;i++){
if(a[i].first ==a[i-1].first ){
c[p[i]]=c[p[i-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... |