제출 #1211984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1211984		stefanneagu	Gift Exchange (JOI24_ho_t4)	C++20	50 / 100	2592 ms	3308 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int nmax = 5e5 + 1;

struct str {
    int a, b;

    const bool operator < (str ult) const {
        return b < ult.b;
    }
};

bool qry(vector<str> v) {
    sort(v.begin() + 1, v.end());
    int n = v.size() - 1;
    int mx = 0;
    vector<int> cic;
    for (int i = 1; i <= n; i++) {
        int l = i, r = n, ans = i;
        while (l <= r) {
            int mid = (l + r) / 2;
            if (v[mid].b <= v[i].a) {
                ans = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        mx = max(mx, ans);
        if (mx == i) {
            cic.push_back(i);
        }
    }
    int ult = 0;
    for (auto it : cic) {
        if (it == ult + 1) {
            return 0;
        }
        ult = it;
    }
    return 1;
}

str v[nmax];

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> v[i].a;
    }
    for (int i = 1; i <= n; i++) {
        cin >> v[i].b;
    }
    int q;
    cin >> q;
    while (q--) {
        int l, r;
        cin >> l >> r;
        vector<str> vt = {{0, 0}};
        for (int i = l; i <= r; i++) {
            vt.push_back(v[i]);
        }
        cout << (qry(vt) ? "Yes\n" : "No\n");
    }
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 31 / 31
• Subtask 5: 0 / 8
• Subtask 6: 0 / 12
• Subtask 7: 0 / 18
• Subtask 8: 0 / 12