Submission #966302

#TimeUsernameProblemLanguageResultExecution timeMemory
966302Trisanu_DasExamination (JOI19_examination)C++17
2 / 100
3052 ms2736 KiB
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
int x[100001], y[100001];
 
signed main() {
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
  while(q--){
    int ans = 0;
    int a, b, c;
    cin >> a >> b >> c;
    for (int j = 0; j < n; j++) {
      if (x[j] >= a && y[j] >= b && x[j] + y[j] >= c) ans++;
    }
    cout << ans << '\n';
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...