#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N = 2e5 + 5;
bool cmp(pair<int, int> a, pair<int, int> b){
if(a == b) return 0;
if(a.ff + a.ss > b.ff + b.ss) return 0;
if(a.ff + a.ss < b.ff + b.ss) return 1;
if(a.ff > b.ff) return 0;
return 1;
}
int BIT[N], ans[N], cutoffs[N][3];
vector<pair<int, int> > a;
void add(int idx, int val){
for( ; idx < N; idx |= (idx + 1)) BIT[idx] += val;
}
int qry(int idx){
int ans = 0;
for(; idx >= 0; idx = (idx & (idx + 1)) - 1) ans += BIT[idx]
return ans;
}
int sum(int l, int r){
if(l > r) return 0;
return qry(r) - qry(l - 1);
}
signed main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n, q; cin >> n >> q;
for(int i = 0; i < n; i++){
int s, t; cin >> s >> t;
a.pb({s, t});
}
sort(a.begin(), a.end());
vector<pair<pair<int, int>, int> > c_sort1;
for(int i = 0; i < q; i++) cin >> cutoffs[i][0] >> cutoffs[i][1] >> cutoffs[i][2];
for(int i = 0; i < q; i++)
if(cutoffs[i][0] + cutoffs[i][1] >= cutoffs[i][2])
c_sort1.pb({{cutoffs[i][0], cutoffs[i][1]}, i});
sort(c_sort1.begin(), c_sort1.end());
int idx = n - 1;
memset(BIT, 0, sizeof(BIT));
while(!c_sort1.empty()){
auto x = c_sort1.back(); c_sort1.pop_back();
while(idx >= 0 and a[idx].ff >= x.ff.ff){
upd(a[idx].ss, 1); idx--;
}
ans[x.ss] = sum(x.ff.ss, N - 1);
}
vector<pair<int, int> > c_sort2;
for(int i = 0; i < q; i++)
if(cutoffs[i][0] + cutoffs[i][1] < cutoffs[i][2])
c_sort2.pb({cutoffs[i][2], i});
sort(c_sort2.begin(), c_sort2.end());
sort(a.begin(), a.end(), cmp);
memset(bit, 0, sizeof(bit));
idx = n - 1;
for(int i = (int)c_sort2.size() - 1; i >= 0; i--){
while(idx >= 0 and a[idx].ff + a[idx].ss >= c_sort2[i].ff){
upd(a[idx].ff, 1);
idx--;
}
ans[c_sort2[i].ss] += n - idx - 1;
ans[c_sort2[i].ss] -= sum(0, cutoffs[c_sort2[i].ss][0] - 1);
}
memset(BIT, 0, sizeof(BIT));
idx = n - 1;
for(int i = (int)c_sort2.size() - 1; i >= 0; i--){
while(idx >= 0 and a[idx].ff + a[idx].ss >= c_sort2[i].ff){
upd(a[idx].ss, 1);
idx--;
}
ans[c_sort2[i].ss] -= sum(0, cutoffs[c_sort2[i].ss][1] - 1);
}
for(int i = 0; i < q; i++) cout << ans[i] << '\n';
}
Compilation message
examination.cpp: In function 'long long int qry(long long int)':
examination.cpp:26:62: error: expected ';' before 'return'
26 | for(; idx >= 0; idx = (idx & (idx + 1)) - 1) ans += BIT[idx]
| ^
| ;
27 | return ans;
| ~~~~~~
examination.cpp:28:1: warning: no return statement in function returning non-void [-Wreturn-type]
28 | }
| ^
examination.cpp: In function 'int main()':
examination.cpp:54:4: error: 'upd' was not declared in this scope
54 | upd(a[idx].ss, 1); idx--;
| ^~~
examination.cpp:64:9: error: 'bit' was not declared in this scope
64 | memset(bit, 0, sizeof(bit));
| ^~~
examination.cpp:68:4: error: 'upd' was not declared in this scope
68 | upd(a[idx].ff, 1);
| ^~~
examination.cpp:78:4: error: 'upd' was not declared in this scope
78 | upd(a[idx].ss, 1);
| ^~~
