# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
750524 | vjudge1 | Art Collections (BOI22_art) | 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 sz=0;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
//cout.tie(0);
int n,m;
cin>>n>>m;
vector<int>allind;
vector<pair<int,int>>all(n);
for(int i=0;i<n;i++){
cin>>all[i].first>>all[i].second;
allind.push_back(all[i].first);
allind.push_back(all[i].second);
}
sort(allind.begin(),allind.end());
allind.resize(unique(allind.begin(),allind.end())-allind.begin());
sz=(int)allind.size();
vector<vector<pair<int,pair<int,int>>>>quer(sz+10);
vector<vector<int>>addy(sz+1);
for(int i=0;i<n;i++){
int p=lower_bound(allind.begin(),allind.end(),all[i].second)-allind.begin();
int pp=lower_bound(allind.begin(),allind.end(),all[i].first)-allind.begin();
addy[p].push_back(pp);
}
vector<int>res(m+10);
for(int i=0;i<m;i++){
int l,r;