Submission #445575

#TimeUsernameProblemLanguageResultExecution timeMemory
445575hgmhcExamination (JOI19_examination)C++17
2 / 100
3063 ms2496 KiB
#include <bits/stdc++.h> #define REP(i,a,b) for (auto i = (a); i <= (b); ++i) #define PER(i,a,b) for (auto i = (b); i >= (a); --i) #define log2(x) (31-__builtin_clz(x)) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define SZ(x) (int)(x).size() #define mup(x,y) x = min(x,y) #define Mup(x,y) x = max(x,y) #define debug(x) cout << #x << " is " << x << el #define el '\n' using namespace std; using ll = long long; using ii = pair<int,int>; using iii = tuple<int,int,int>; void solution(); int main() {ios::sync_with_stdio(0); cin.tie(0); solution();} const int N = 100003; int n, q; ii student[N]; void input() { cin >> n >> q; REP(i,1,n) cin >> student[i].first >> student[i].second; } void solution() { input(); REP(i,1,q) { int x, y, z; cin >> x >> y >> z; int cnt = 0; REP(i,1,n) { auto [a,b] = student[i]; if (a >= x && b >= y && a+b >= z) ++cnt; } cout << cnt << el; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...