# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464883 | blue | Ancient Books (IOI17_books) | C++17 | 224 ms | 30660 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 "books.h"
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxN = 1'000'000;
const int ind_R = 1'000'005;
const int ind_L = -1;
const long long INF = 1'000'000'000'000'000'000LL;
int N;
vector<int> P;
int S;
int cycle_ind = -1;
vector<int> cycle(maxN, -1);
vector<int> L(maxN, ind_R);
vector<int> R(maxN, ind_L);
long long essential_cost = 0;
void extend(int& l, int& r) //[l, r] is extended fully except for the cycles of l and r
{
int l_new = min(L[cycle[l]], L[cycle[r]]);
int r_new = max(R[cycle[l]], R[cycle[r]]);
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... |