# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146457 | Alexa2001 | Necklace (Subtask 4) (BOI19_necklace4) | C++17 | 269 ms | 612 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;
const int Nmax = 3005;
string A, B, Brev;
int startA, startB, best = 0;
int z1[Nmax], z2[Nmax];
int pi[Nmax];
void kmp(string &A, string &B, int mat[])
{
int i, k;
pi[1] = 0;
for(i=2; i<=A.size(); ++i)
{
k = pi[i-1];
while(k && A[k] != A[i-1]) k = pi[k];
if(A[k] == A[i-1]) ++k;
pi[i] = k;
}
k = 0;
for(i=1; i<=B.size(); ++i)
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |