Submission #1139882

#	Time	Username	Problem	Language	Result	Execution time	Memory
1139882		VMaksimoski008	Gift Exchange (JOI24_ho_t4)	C++20	50 / 100	2593 ms	28416 KiB

Main

#include <bits/stdc++.h>
#define ar array
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const ll inf = 1e18;
const int maxn = 1e5 + 5;

signed main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int n, q; cin >> n;
    vector<int> a(n+1), b(n+1);
    for(int i=1; i<=n; i++) cin >> a[i];
    for(int i=1; i<=n; i++) cin >> b[i];

    vector<int> L(n+1), R(n+1, n+1);
    map<int, vector<ar<int, 2> > > mp;
    for(int i=1; i<=n; i++) {
        mp[b[i]].push_back({ i, 1 });
        mp[a[i]].push_back({ i, -1 });
    }

    set<int> st;
    for(auto [p, vec] : mp) {
        for(auto [id, t] : vec) {
            if(t == -1) continue;
            auto it = st.lower_bound(id);
            if(it != st.end()) {
                R[id] = min(R[id], *it);
                L[*it] = max(L[*it], id);
            }

            if(!st.empty() && *st.begin() < id) {
                it = --st.lower_bound(id);
                R[*it] = min(R[*it], id);
                L[id] = max(L[id], *it);
            }

            st.insert(id);
        }

        for(auto [id, t] : vec)
            if(t == -1) st.erase(id);
    }

    cin >> q;
    while(q--) {
        int l, r, ok=1; cin >> l >> r;
        for(int i=l; i<=r; i++)
            if(L[i] < l && R[i] > r) ok = 0;
        cout << (ok ? "Yes" : "No") << '\n';
    }
}

• 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