# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
716074 | bane | Examination (JOI19_examination) | C++17 | 2987 ms | 6588 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
#define ar array
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define frs first
#define sc second
#define eb emplace_back
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
int dx[4] = {0,0,1,-1};
int dy[4] = {-1,1,0,0};
const int Block = 310;
int n,q;
int A[100001], B[100001];
int main() {
scanf("%d%d", &n, &q);
fr(i, 0, n)
scanf("%d%d", &A[i], &B[i]);
while(q--){
int x,y,z;
scanf("%d%d%d", &x, &y, &z);
int ans = 0;
fr(i, 0, n){
ans+=(A[i] >= x) & (B[i] >= y) & (A[i] + B[i] >= z);
}
printf("%d\n", ans);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |