Submission #470973

#	Time	Username	Problem	Language	Result	Execution time	Memory
470973		spike1236	Examination (JOI19_examination)	C++14	2 / 100	3070 ms	1724 KiB

examination

#include <iostream>
#pragma GCC optimize("-Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;

const int MAXN = 1e5 + 10;
int a[MAXN], b[MAXN];

int main() {
    int n, q;
    cin >> n >> q;
    for(int i = 0; i < n; ++i) cin >> a[i] >> b[i];
    int x, y, z, ans = 0;
    for(int i = 0; i < q; ++i) {
        cin >> x >> y >> z;
        ans = 0;
        for(int j = 0; j < n; ++j)
            if(a[j] >= x && b[j] >= y && a[j] + b[j] >= z) ++ans;
        cout << ans << '\n';
    }
    return 0;
}

• Subtask 1: 2 / 2
• Subtask 2: 0 / 20
• Subtask 3: 0 / 21
• Subtask 4: 0 / 57