# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44415 | choikiwon | Port Facility (JOI17_port_facility) | C++17 | 4129 ms | 784892 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;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
const int MN = 1000010;
int N, M;
pii P[MN], arr[MN << 1];
vector<int> A, B;
struct BIT {
vector<pii> tree;
void init() {
tree = vector<pii>(4 * M);
build(0, M - 1, 1);
}
void build(int l, int r, int n) {
if(l == r) {
tree[n] = arr[l];
return;
}
int m = (l + r)>>1;
build(l, m, 2*n);
build(m + 1, r, 2*n + 1);
tree[n] = max(tree[2*n], tree[2*n + 1]);
}
void upd(int idx, pii val, int l, int r, int n) {
if(idx < l || r < idx) 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... |