제출 #1127927

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

Main

#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;

int n, q, a[nx], b[nx], l, r, mx, x[nx], y[nx], qs[2*nx];
vector<int> mp, v;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i];
    for (int i=1; i<=n; i++) cin>>b[i];
    cin>>q;
    while (q--)
    {
        cin>>l>>r;
        mp.clear();
        for (int i=l; i<=r; i++) mp.push_back(a[i]), mp.push_back(b[i]);
        sort(mp.begin(), mp.end());
        for (int i=l; i<=r; i++) x[i]=upper_bound(mp.begin(), mp.end(), a[i])-mp.begin(), y[i]=upper_bound(mp.begin(), mp.end(), b[i])-mp.begin();
        for (int i=1; i<=2*n; i++) qs[i]=0;
        for (int i=l; i<=r; i++) qs[y[i]]++, qs[x[i]+1]--;
        for (int i=1; i<=2*n; i++) qs[i]+=qs[i-1];
        int f=0;
        for (int i=l; i<=r; i++)
        {
            if (x[i]==y[i]+1&&qs[x[i]]==1)
            {
                f=1;
                cout<<"No\n";
                break;
            }
        }
        if (!f) cout<<"Yes\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