# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
716073 | bane | Examination (JOI19_examination) | 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>
#pragma GCC target ("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
int n,q;
int A[100001], B[100001];
int main() {
scanf("%d%d", &n, &q);
fr(i, 0, n)
scanf("%d%d", &A[i], &B[i]);
while(q--){
int x,y,z;
scanf("%d%d%d", &x, &y, &z);
int ans = 0;
fr(i, 0, n){
ans+=(A[i] >= x) & (B[i] >= y) & (A[i] + B[i] >= z);
}
printf("%d\n", ans);
}
}