제출 #1273177

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1273177		hiepsimauhong	Curtains (NOI23_curtains)	C++20	100 / 100	686 ms	63536 KiB

curtains

#include <bits/stdc++.h>

using namespace std;

#define int long long
using ll = long long;

#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)
#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)
#define FOA(I, A) for(auto &I : A)

#define print(A,L,R) FOR(OK, L, R){if(A[OK]<=-oo / 10||A[OK]>=oo)cout<<"- ";else cout<<A[OK]<<' ';}cout<<'\n';
#define prints(A) FOA(OK, A){cout<<OK<<' ';}cout << '\n';
#define printz(A,L,R) FOR(OK, 0, L){FOR(KO, 0, R){if(A[OK][KO]>-oo&&A[OK][KO]<oo)cout<<A[OK][KO]<<' ';else cout << "- ";} cout << '\n';}cout << '\n';

#define fs first
#define sd second
#define ii pair<int,int>
#define iii pair<int, ii>
#define all(A) A.begin(), A.end()
#define quickly ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define div alksdjf

const int N = 5e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e9;

int n, m, q;
bool ans[N];
vector<int> curtain[N];
vector<ii> query[N];

struct Segment_tree{
        int sg[N << 2];

        void build(int id, int l, int r){
                if(l == r){
                        sg[id] = oo;
                        return;
                }
                int mid = (l + r) >> 1;
                build(id << 1, l, mid);
                build(id << 1 | 1, mid + 1, r);

                sg[id] = oo;
        }

        void update(int id, int l, int r, int u, int v){
                if(l > v || r < u){
                        return;
                }
                if(u <= l && r <= v){
                        sg[id] = min(sg[id], v);
                        return;
                }

                int mid = (l + r) >> 1;
                update(id << 1, l, mid, u, v);
                update(id << 1 | 1, mid + 1, r, u, v);

                sg[id] = min(sg[id], max(sg[id << 1], sg[id << 1 | 1]));
        }

        bool get(int id, int l, int r, int u, int v){
                if(l > v || r < u){
                        return 1;
                }
                if(u <= l && r <= v){
                        return (sg[id] <= v);
                }

                int mid = (l + r) >> 1;

                return (get(id << 1, l, mid, u, v) & get(id << 1 | 1, mid + 1, r, u, v));
        }
} sg;

signed main(){ quickly
        cin >> m >> n >> q;

        FOR(i, 1, n){
                int l, r;
                cin >> l >> r;
                curtain[l].push_back(r);
        }

        FOR(i, 1, q){
                int l, r;
                cin >> l >> r;
                query[l].push_back({r, i});
        }

        sg.build(1, 1, m);

        FOD(l, m, 1){
                FOA(r, curtain[l]){
                        sg.update(1, 1, m, l, r);
                }

                FOA(v, query[l]){
                        int r = v.fs, in = v.sd;
                        ans[in] = sg.get(1, 1, m, l, r);
                }
        }

        FOR(i, 1, q){
                cout << (ans[i] ? "YES\n" : "NO\n");
        }
}

• Subtask 1: 3 / 3
• Subtask 2: 6 / 6
• Subtask 3: 15 / 15
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36
• Subtask 6: 20 / 20