Submission #901485

#	Time	Username	Problem	Language	Result	Execution time	Memory
901485		406	Examination (JOI19_examination)	C++17	100 / 100	1376 ms	7872 KiB

examination

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)

using namespace std;
using ar = array<int, 2>;

const int N = 1e5 + 5;
const long long INF = 1ll << 60;
ar A[N];
int t[3][N], n, q;

signed main() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); 
        cin >> n >> q;
        FOR(i, 0, n)
                cin >> A[i][0] >> A[i][1];
        auto cmp = [&](const auto a, const auto b) {
                return a[0] + a[1] < b[0] + b[1];
        };
        sort(A, A + n, cmp);

        FOR(i, 0, n) {
                t[0][i] = A[i][0]; 
                t[1][i] = A[i][1]; 
                t[2][i] = A[i][0] + A[i][1];
        }

        while (q--) {
                int a, b, c;
                cin >> a >> b >> c;
                c = max(c, a + b);
                int it = lower_bound(t[2], t[2] + n, c) - t[2];
                int ans = 0;
                for (; it < n; ++it) 
                        ans += t[0][it] >= a && t[1][it] >= b;
                cout << ans << '\n';
        }
        return 0;
}

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