# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711284 | kostia244 | Copy and Paste 3 (JOI22_copypaste3) | C++17 | 503 ms | 102572 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>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
const int N = 2525;
int n;
ll a, b, c;
ll dp[N][N], jump[N][N], best[N];
string s;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> s >> a >> b >> c;
vector<int> sa(n);
iota(all(sa), 0);
memset(jump, -1, sizeof jump);
auto dfs = [&](auto self, vector<int> &p, int dep) -> void {
if(p.size() < 2)
return;
vector<int> ch[26];
int j = 0;
for(auto i : p) {
if(i + dep < s.size())
ch[s[i + dep] - 'a'].push_back(i);
if(dep) {
while(p[j] + dep - 1 < i)
j++;
jump[dep][i] = j ? p[j - 1] : -1;
}
}
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... |