# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
868538 | Dec0Dedd | Event Hopping (BOI22_events) | C++14 | 93 ms | 33992 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;
const int N = 1e5+10;
const int K = 20;
const int INF = 1e6+10;
int up[K][N], d[K][N], s[N], lf[N], e[N], mx[N], idx[N], n, q;
vector<pii> v;
vector<int> add[N], rm[N];
bool cmp(pii a, pii b) {
if (a.first == b.first) return s[a.second] < s[b.second];
else return a.first < b.first;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin>>n>>q;
for (int i=0; i<n; ++i) {
cin>>s[i]>>e[i];
v.push_back({e[i], i});
} sort(v.begin(), v.end(), cmp);
for (int i=0; i<n; ++i) {
# | 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... |