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;
const int N = 3e5+10;
int x[N], y[N], a[N], b[N], c[N];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> x[i] >> y[i];
}
for (int i = 1; i <= m; ++i) {
cin >> a[i] >> b[i] >> c[i];
if(a[i] + b[i] >= c[i]) {
int ans = 0;
for(int j = 1; j <= n; ++j) {
if(x[j] >= a[i] && y[j] >= b[i]) {
++ans;
}
}
cout << ans << '\n';
continue;
}
int all = 0, sumA = 0, sumB = 0;
for(int j = 1; j <= n; ++j) {
if(x[j] + y[j] >= c[i]) {
++all;
}
if(x[j] < a[i] && x[j] + y[j] >= c[i]) {
++sumA;
}
if(y[j] < b[i] && x[j] + y[j] >= c[i]) {
++sumB;
}
}
cout << all - sumA - sumB << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |