Pagini recente » Cod sursa (job #1433886) | Cod sursa (job #2463532) | Cod sursa (job #2706081) | Cod sursa (job #2835685) | Cod sursa (job #2555965)
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
ifstream fin("marbles.in");
ofstream fout("marbles.out");
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;
const int DMAX = 70;
vector <int> vec[DMAX];
int n,q;
int ans;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t,i,j;
int x,y,pos,st,dr;
fin>>n>>q;
for(i=1;i<=n;i++){
fin>>x>>y;
vec[y].pb(x);
}
for(i=1;i<=64;i++)
sort(vec[i].begin(),vec[i].end());
while(q--){
fin>>t>>x>>y;
if(!t){
for(i=1;i<=64;i++){
pos=lower_bound(vec[i].begin(),vec[i].end(),x)-vec[i].begin();
if(pos < vec[i].size() && vec[i][pos] == x){
vec[i][pos]+=y;
break;
}
}
}
else{
ans=0;
for(i=1;i<=64;i++){
st=lower_bound(vec[i].begin(),vec[i].end(),x)-vec[i].begin();
dr=upper_bound(vec[i].begin(),vec[i].end(),y)-vec[i].begin();
ans=max(ans,dr-st);
}
fout<<ans<<'\n';
}
}
return 0;
}