제출 #1200414

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1200414		algoproclub	Gift Exchange (JOI24_ho_t4)	C++20	0 / 100	27 ms	2120 KiB

Main

// UUID: aaada45b-c35a-476d-8438-872210eef1a6
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 500'001;

int a[MAXN], b[MAXN], pref1[MAXN], pref2[MAXN];

void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    for (int i = 2; i <= n; i++) {
        pref1[i] = pref1[i-1];
        if (a[i] < b[i-1]) pref1[i]++;
        pref2[i] = pref2[i-1];
        if (b[i] > a[i-1]) pref2[i]++;
    }
    int q; cin >> q;
    while (q--) {
        int l, r; cin >> l >> r;
        cout << (((pref1[r] == pref1[l] && a[l] >= b[r]) || (pref2[l] == pref2[r] && a[r] >= b[l])) && l != r ? "Yes\n" : "No\n");
    }
}

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

• Subtask 1: 0 / 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