# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986816 | alextodoran | Port Facility (JOI17_port_facility) | C++17 | 5696 ms | 771316 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.
/**
_ _ __ _ _ _ _ _ _
|a ||t ||o d | |o |
| __ _| | _ | __| _ |
| __ |/_ | __ /__\ / _\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 1000000;
const int MOD = (int) 1e9 + 7;
int N;
int L[N_MAX + 2], R[N_MAX + 2];
struct SegInfo {
vector <int> byL, byR;
};
SegInfo seg_tree[N_MAX * 8 + 2];
void add_L (int node, int l, int r, int i) {
seg_tree[node].byL.push_back(i);
if (l == r) {
return;
}
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... |