# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
603114 | peuch | Event Hopping (BOI22_events) | C++17 | 0 ms | 0 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;
int n, q;
struct interval{
int l, r, id;
void scan(int _id){
scanf("%d %d", &l, &r);
id = _id;
}
bool operator < (interval x){
if(r == x.r) return l < x.l;
return r < x.r;
}
}v[MAXN];
struct query{
int ini, fim;
void scan(int _id){
scanf("%d %d", &l, &r);
id = _id;
}
bool operator < (interval x){
if(r == x.r) return l < x.l;
return r < x.r;
}
}v[MAXN];
int main(){
scanf("%d %d", &n, &q);
for(int i = 1; i <= n; i++)
v[i].scan(i);
for(int i = 1; i <= q; i++)
sort(v + 1, v + 1 + n);
for(int i = 1; i <= )
}