# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850077 | MinaRagy06 | Event Hopping (BOI22_events) | C++17 | 335 ms | 75252 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>
#define md ((l + r) >> 1)
using namespace std;
typedef int64_t ll;
const int N = 200'005;
array<int, 2> a[N];
int bl[18][N], bl2[18][N];
vector<array<int, 2>> st[2 * N], en[2 * N];
struct node {
pair<int, int> mn;
node() {mn = {1e9, -1};}
node(pair<int, int> _mn) {mn = _mn;}
friend node operator+(const node &l, const node &r) {
return min(l.mn, r.mn);
}
} seg[1 << 19];
void upd(int i, int l, int r, int x, pair<int, int> v) {
if (x == l && r == x) {
seg[i].mn = min(seg[i].mn, v);
return;
}
if (r < x || x < l) {
return;
}
upd(i << 1, l, md, x, v);
upd(i << 1 | 1, md + 1, r, x, v);
seg[i] = seg[i << 1] + seg[i << 1 | 1];
}
node get(int i, int l, int r, int s, int e) {
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... |