Submission #1089043

#TimeUsernameProblemLanguageResultExecution timeMemory
1089043LilPlutonExamination (JOI19_examination)C++14
2 / 100
3081 ms3520 KiB
#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define ll long long
const int inf = 1e9 + 7;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
const int sz = 2e5 + 5;


signed main(){
    int n, q;
    cin >> n >> q;
    vector<pair<int,int>>v(n);
    for(pair<int,int>& p : v){
        cin >> p.first >> p.second;
    }    
    while(q--){
        int a, b, c, cnt = 0;
        cin >> a >> b >> c;
        for(int i = 0; i < n; ++i){
            if(v[i].first >= a && v[i].second >= b && v[i].first + v[i].second >= c){
                cnt++;
            }
        }
        cout << cnt << endl;
    }
    
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...