제출 #1132470

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

Main

#include <bits/stdc++.h>

#define F first
#define S second

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;

template<class T> bool ckmin(T& a, T b) { return b < a ? a = b, true : false; }
template<class T> bool ckmax(T& a, T b) { return a < b ? a = b, true : false; }

int main() {
    ios::sync_with_stdio(0); cin.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];
    
    vector<int> sol(n + 1);
    
    int q; cin >> q;
    while (q--) {
        int l, r; cin >> l >> r;
        vector<pair<int, int>> v;
        set<pair<int, int>> s;
        for (int i = l; i <= r; ++i) v.push_back({a[i], i});
        for (int i = l; i <= r; ++i) s.insert({b[i], i});
        sort(v.begin(), v.end());
        
        vector<int> cnt(n + 1, 0);
        for (int i = l; i <= r; ++i) {
            int plus = 0, minus = 0, aux = 0;
            for (int j = l; j <= r; ++j) {
                if (i == j) continue;
                if (a[j] >= b[i]) ++plus;
                if (b[j] >= b[i]) ++minus;
                if (a[i] >= b[j]) aux = 1;
            }
            cnt[i] = plus - max(0, minus - aux);
        }
        bool ok = 1;
        for (int i = l; i <= r; ++i) ok &= cnt[i] > 0;
        cout << (ok ? "Yes" : "No") << "\n";
    }
}
/**
3
5 8 10
4 7 6
1
2 4
**/

• 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