제출 #1323329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1323329		zyntherix	Gift Exchange (JOI24_ho_t4)	C++20	4 / 100	2595 ms	3656 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define vi vector<int>
#define vs vector<string>
#define vb vector<bool>
#define vpi vector<pi>
#define pb push_back
#define all(a) (a).begin(), (a).end()
const int mod = 1e9 + 7;

void solve()
{
    int n;
    cin >> n;
    vi a(n), b(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < n; i++)
        cin >> b[i];
    int q;
    cin >> q;
    while (q--)
    {
        int l, r;
        cin >> l >> r;
        l--;
        r--;
        vi p;
        for (int i = l; i <= r; i++)
            p.pb(i);
        vi p2 = p;
        next_permutation(all(p));
        bool nf = true;
        while (p != p2)
        {
            bool nf2 = false;
            ;
            for (int i = l; i <= r; i++)
            {
                if (p[i - l] == i)
                {
                    next_permutation(all(p));
                    nf2 = true;
                    break;
                }
            }
            if (nf2)
                continue;
            for (int i = l; i <= r; i++)
            {
                if (a[p[i - l]] < b[i])
                {
                    next_permutation(all(p));
                    nf2 = true;
                    break;
                }
            }
            if (nf2)
                continue;
            cout << "Yes\n";
            nf = false;
            break;
        }
        if (nf)
            cout << "No\n";
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}

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