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>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
void solve(){
int n, q;
cin >> n >> q;
long long int maths[n], ip[n], both[n];
for(int i = 0; i < n; ++i){
cin >> maths[i] >> ip[i];
both[i] = maths[i] + ip[i];
}
while(q--){
long long int a, b, c, ans = 0;
cin >> a >> b >> c;
for(int i = 0; i < n; ++i)
if(maths[i] >= a && ip[i] >= b && both[i] >= c)
++ans;
cout << ans << '\n';
}
}
int main(){
fast;
int t = 1;
// cin >> t;
while(t--)
solve();
return 0;
}
# | 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... |