제출 #1263138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1263138		norman165	Gift Exchange (JOI24_ho_t4)	C++20	10 / 100	2591 ms	6588 KiB

Main

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define yes() cout << "YES\n"
#define no() cout << "NO\n"

using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

const int inf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 1e6;
const int mod1 = 998244353;
const int mod2 = 1e18 + 1;
const int mod3 = 1e9 + 9;
const int mod4 = 333333333;
const int mod5 = 200000;
const int mod6 = 10007;
const int k = 3000;
const int w = 1e5;
const ld EPS = 1e-8;

int LOG = 30;

void solve() {
    int n;
    cin >> n;

    vector<int> a(n), b(n);
    for (int& i : a) cin >> i;
    for (int& i : b) cin >> i;

    int q;
    cin >> q;

    vector<pair<int, int>> good;
    for (int i = 0; i < n; i++) good.push_back({b[i], a[i]});

    while (q--) {
        int l, r;
        cin >> l >> r;

        int ans = 1;
        l--, r--;
        vector<pair<int, int>> good1;
        for (int i = l; i <= r; i++) good1.push_back(good[i]);
        sort(all(good1), [](pair<int, int> a, pair<int, int> b) {
            return a.second < b.second || (a.second == b.second && a.first > b.first);
        });

        vector<int> mn(r - l + 1);
        mn.back() = good1.back().first;
        for (int i = r - l - 1; i >= 0; i--) mn[i] = min(mn[i + 1], good1[i].first);
        for (int i = 0; i < r - l; i++) {
            auto [l1, r1] = good1[i];
            int l2 = mn[i + 1];
            if (l2 > r1) ans = 0;
        }

        if (ans) cout << "Yes\n";
        else cout << "No\n";
    }
}

signed main() {
    // cout.precision(16);

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;

    while (t--) {
        solve();
    }
}

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