제출 #1337677

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

Main

#include<bits/stdc++.h>
using namespace std;

#define int long long
signed main(){
    ios_base::sync_with_stdio(0); 
    cin.tie(0); cout.tie(0);

    int n; 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];

    auto intersect = [&](int i, int j, int z, int t){
        return max(i, z) <= min(j, t);
    };
    int q; cin >> q;
    while(q--){
        int l, r; cin >> l >> r;
        int res = 1;
        for(int i = l; i <= r; i++){
            bool ok = false;
            for(int j = l; j <= r; j++){
                if(j != i) ok |= intersect(b[i], a[i], b[j], a[j]);
            }
            res &= ok;
        }
        cout << (res ? "Yes" : "No") << "\n";
    }

}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 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