# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567777 | tqbfjotld | Copy and Paste 3 (JOI22_copypaste3) | C++14 | 3107 ms | 594072 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*1505];
int id[2505][2505];
int ct = 1;
struct node{
int nid, len;
vector<int> vals;
node*ch[26];
vector<int> decomp[15];
node(int _len){
nid = ct++;
len = _len;
for (int x = 0; x<26; x++){
ch[x] = 0;
}
}
void construct(){
//printf("call construct len %lld\n",len);
for (int x = 0; x<vals.size(); x++){
decomp[0].push_back(lower_bound(vals.begin(),vals.end(),vals[x]+len)-vals.begin());
}
decomp[0].push_back(vals.size());
for (int x = 1; x<15; x++){
for (int y = 0; y<=vals.size(); y++){
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... |