AcWing 802. 区间和 debug
原题链接
简单
作者:
12358
,
2021-05-17 19:27:40
,
所有人可见
,
阅读 196
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int N =3e5+10;
int n,m,a[N],s[N];
typedef pair<int,int> PII;
vector<int> alls;
vector<PII> add,query;
int find(int x)
{
int l=0,r=alls.size()-1;
while(l<r)
{
int mid=l+r>>1;
if(alls[mid]>=x) r=mid;
else l=mid+1;
}
return r+1;
}
int main()
{
cin>>n>>m;
for(int i=0;i<n;i++)
{
int x,c; cin>>x>>c;
add.push_back({x,c});
alls.push_back(x);
}
for(int i=0;i<m;i++)
{
int l,r;
cin>>l>>r;
// cout<<l<<"$"<<r<<endl;
query.push_back({l,r});
alls.push_back(l);
alls.push_back(r);
// cout<<query[i].first<<"&"<<endl;
}
sort(alls.begin(),alls.end());
alls.erase(unique(alls.begin(),alls.end()),alls.end());
//cout<<"size:"<<alls.size()<<endl;
for(auto item:add)
{
int x = find(item.first);
a[x]+=item.second;
//cout<<item.first<<"*"<<item.second<<endl;
}
for(int i=1;i<=alls.size();i++) s[i]=s[i-1]+a[i];
for(auto it:query)
{
int a=find(it.first),b=find(it.second);
// cout<<a<<"%"<<b<<endl;
cout<<s[b]-s[a-1]<<endl;
}
return 0;
}