제출 #788811

#제출 시각아이디문제언어결과실행 시간메모리
788811tch1cherinExamination (JOI19_examination)C++14
100 / 100
2589 ms1748 KiB
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 1e5 + 5;
int S[MAX_N], T[MAX_N];

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, Q;
  cin >> N >> Q;
  for (int i = 0; i < N; i++) {
    cin >> S[i] >> T[i];
  }
  for (int i = 0; i < Q; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    int ans = 0;
    for (int j = 0; j < N; j++) {
      ans += S[j] >= x && T[j] >= y && S[j] + T[j] >= z;  
    }
    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...