# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075399 | vjudge1 | Copy and Paste 3 (JOI22_copypaste3) | C++17 | 227 ms | 67664 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;
#define int long long
#define isz(a) (int)(a).size()
const int NM = 2500, inf = 1e18;
int N, A, B, C;
string S;
int z[NM+5], nxt[NM+5][NM+5], dp[NM+5][NM+5];
void build_z(){
z[0] = -1;
int l = 0, r = -1;
for (int i = 1; i < isz(S); i++){
if (i <= r) z[i] = min(r-i, z[i-l]);
else z[i] = -1;
while (i+z[i]+1 < isz(S) && S[i+z[i]+1] == S[z[i]+1]) z[i]++;
if (i+z[i] > r){
l = i;
r = i+z[i];
}
}
}
void solve(){
for (int i = 0; i < N; i++)
for (int j = 1; j <= N-i; j++)
nxt[i][j] = +inf;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |