# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578577 | InternetPerson10 | Copy and Paste 3 (JOI22_copypaste3) | C++17 | 3077 ms | 536472 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>
typedef long long ll;
using namespace std;
ll ans[2501][2501];
ll num_ma[2501][2501];
int n;
string s;
ll a, b, c;
unordered_map<string, int> ma, revma;
vector<vector<int>> apps;
vector<vector<int>> ne;
vector<vector<vector<int>>> lift;
vector<int> siz;
ll f(int x, int y) {
if(ans[x][y] != -1) return ans[x][y];
if(y - x == 1) {
return ans[x][y] = a;
}
ll best = f(x, y-1) + a;
for(int i = x + (y - x + 1) / 2; i < y; i++) {
if(a * (y - i) < c) break;
int str_idx = num_ma[i][y];
int l = 0, r = apps[str_idx].size();
while(l != r - 1) {
int mid = (l + r) / 2;
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... |