# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713527 | HamletPetrosyan | Event Hopping (BOI22_events) | C++17 | 268 ms | 23036 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;
#define len(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define fr first
#define sc second
const int INF = 1e9;
const int N = 1e5 + 5, lN = 18;
int n, q;
pii a[N];
int par[N][lN];
vector<int> temp, ind;
map<int, int> mp;
pii t[4 * N];
void build(int v, int tl, int tr){
if(tl == tr){
t[v] = {INF, -1};
return;
}
int tm = (tl + tr) / 2;
build(2 * v + 0, tl, tm + 0);
build(2 * v + 1, tm + 1, tr);
t[v] = {INF, -1};
# | 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... |