# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1094660 | not_amir | Event Hopping (BOI22_events) | C++14 | 1550 ms | 21244 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;
constexpr int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, q;
cin >> n >> q;
vector<pair<pii, int>> events(n);
vector<int> start(n), end(n);
map<int, int> mp;
for(int i = 0; i < n; i++) {
cin >> start[i] >> end[i];
events[i].first = {end[i], start[i]};
mp[start[i]] = mp[end[i]] = 1;
events[i].second = i;
}
int t = 0;
for(auto& [x, cmp] : mp)
cmp = t++;
sort(events.begin(), events.end());
int N = 1 << 32 - __builtin_clz(t - 1);
vector<pii> st(2 * N, {INF, -1});
vector<int> parent(n), jump(n), depth(n);
for(int i = 0; i < n; i++) {
int e = events[i].first.first, s = events[i].first.second;
pii ans = {INF, -1};
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... |