# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567735 | tqbfjotld | Copy and Paste 3 (JOI22_copypaste3) | C++14 | 3074 ms | 49540 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
char arr[2505];
int A,B,C;
int mem[2505][2505];
int cntocc(int a, int b, int st, int en){
int cur = b;
int ans = 1;
while (cur+(b-a)<=en){
bool can = true;
for (int x = 0; x<b-a; x++){
if (arr[cur+x]!=arr[a+x]){
can = false;
break;
}
}
if (can){
ans++;
cur += b-a;
}
else{
cur++;
}
}
return ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |