Submission #369628

#TimeUsernameProblemLanguageResultExecution timeMemory
369628azberjibiouExamination (JOI19_examination)C++17
2 / 100
50 ms620 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...