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 ll long long
#define pii pair<int, int>
#define piii pair<int, pii>
#define pllll pair<ll, ll>
#define plli pair<ll, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define pb push_back
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define size(v) v.size()
#define INF 1e9
#define f first
#define s second
#define ln "\n"
using namespace std;
void solve(){
int n, q;
cin >> n >> q;
vector<pii>p(n + 1);
for(int i = 1; i <= n; ++i){
cin >> p[i].f >> p[i].s;
}
while(q--){
int x, y, z;
cin >> x >> y >> z;
int cnt = 0;
for(int i = 1; i <= n; i++){
if(p[i].f >= x && p[i].s >= y && p[i].f + p[i].s >= z){
cnt++;
}
}
cout << cnt << "\n";
}
}
int main(){
int t;
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... |