제출 #715177

#제출 시각아이디문제언어결과실행 시간메모리
715177murad_2005Examination (JOI19_examination)C++14
2 / 100
3070 ms1100 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...