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>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
using namespace std;
#define fir first
#define sec second
#define ll long long
#define pii pair<int, int>
const int mxN=3030;
typedef struct pro{
ll a, b, c;
}pro;
int N, Q;
pro T[mxN];
pii A[mxN];
int main()
{
gibon
cin >> N >> Q;
for(int i=0;i<N;i++) cin >> A[i].fir >> A[i].sec;
for(int i=0;i<Q;i++) cin >> T[i].a >> T[i].b >> T[i].c;
for(int i=0;i<Q;i++)
{
int ans=0;
for(int j=0;j<N;j++)
{
if(A[j].fir>=T[i].a && A[j].sec>=T[i].b && A[j].fir+A[j].sec>=T[i].c) ans++;
}
cout << ans << '\n';
}
}
# | 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... |