# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
949775 | Dec0Dedd | Event Hopping (BOI22_events) | C++14 | 487 ms | 53904 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 long long ll;
typedef pair<int, int> pii;
const int N = 2e5+100;
const int INF = 1e9+10;
const int K = 20;
struct segtree {
vector<pii> t;
void init(int sz) {
t.resize(4*sz+10);
for (auto &u : t) u={INF, -INF};
}
void upd(int v, int l, int r, int p, pii x) {
if (l == r) {
t[v]=min(t[v], x);
return;
} int m=(l+r)/2;
if (p <= m) upd(2*v, l, m, p, x);
else upd(2*v+1, m+1, r, p, x);
t[v]=min(t[2*v], t[2*v+1]);
}
pii que(int v, int l, int r, int ql, int qr) {
# | 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... |