# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653883 | couplefire | Event Hopping (BOI22_events) | C++17 | 380 ms | 36192 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;
const int N = 1<<17;
const int INF = 0x3f3f3f3f;
int n, q;
pair<int, int> segs[N];
map<int, int> mp;
vector<int> stuff;
vector<pair<int, int>> bruh[N<<1];
int tree[N<<2];
int to[N][20];
void upd(int pos, int val, int tl = 0, int tr = (N<<1)-1, int v = 1) {
if (tr < pos || tl > pos) {
return;
}
if (tl == tr) {
tree[v] = min(tree[v], val);
return;
}
int tm = (tl+tr)>>1;
upd(pos, val, tl, tm, v<<1);
upd(pos, val, tm+1, tr, v<<1|1);
tree[v] = min(tree[v<<1], tree[v<<1|1]);
}
int query(int l, int r, int tl = 0, int tr = (N<<1)-1, int v = 1) {
if (tr < l || tl > 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |