# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1111629 | simona1230 | Palindromes (APIO14_palindrome) | C++17 | 87 ms | 109028 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;
struct letter
{
long long l[27],suf,len,cnt;
vector<long long> v;
};
string s;
letter l[300001];
long long last,num;
// curr e vyrhyt S kojto prodyljavame s tek bukva x xSx
void add(long long p)
{
long long i=s[p]-'a';
long long curr=last,len=0;
while(1)
{
len=l[curr].len;
if(p-len-1>=0&&s[p-len-1]==s[p])
break;
curr=l[curr].suf;
}
if(l[curr].l[i])
{
last=l[curr].l[i];
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... |