Submission #1256134

#	Time	Username	Problem	Language	Result	Execution time	Memory
1256134		CrabCNH	Curtains (NOI23_curtains)	C++20	100 / 100	792 ms	105192 KiB

curtains

#include <bits/stdc++.h>

#define task     "BriantheCrab"

#define int    long long
#define pii    pair <int, int>
#define fi     first
#define se     second
#define szf    sizeof
#define sz(s)  (int)((s).size())
#define all(v) (v).begin(), (v).end()

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using namespace std;

template <class T> void minimize (T &t, T f) {if (t > f) t = f;}
template <class T> void maximize (T &t, T f) {if (t < f) t = f;}

const int maxN = 5e5 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;

// khong tu code thi khong kha len duoc dau
// biet sol roi thi tu lam not di

struct ST {
    vector <int> st, lazy;
    
    inline void init (int _n) {
        st.resize (_n * 6, 0);
        lazy.resize (_n * 6, 0);
    }
    
    inline void push (int id) {
        int &t = lazy[id];
        if (t != 0) {
            maximize (st[id * 2], t);
            maximize (lazy[id * 2], t);
            maximize (st[id * 2 + 1], t);
            maximize (lazy[id * 2 + 1], t);
        }
        t = 0;
        return;
    }
    
    void upd (int id, int l, int r, int u, int v, int val) {
        if (v < l || u > r) {
            return;
        }
        if (u <= l && r <= v) {
            maximize (st[id], val);
            maximize (lazy[id], val);
            return;
        }
        int mid = (l + r) >> 1;
        push (id);
        upd (id * 2, l, mid, u, v, val);
        upd (id * 2 + 1, mid + 1, r, u, v, val);
        st[id] = min (st[id * 2], st[id * 2 + 1]);
        return;
    }
    
    int get (int id, int l, int r, int u, int v) {
        if (v < l || u > r) {
            return inf;
        }
        if (u <= l && r <= v) {
            return st[id];
        }
        int mid = (l + r) >> 1;
        push (id);
        int tL = get (id * 2 , l, mid, u, v);
        int tR = get (id * 2 + 1, mid + 1, r, u, v);
        return min (tL, tR);
    }
};

vector <int> pos[maxN];
vector <pii> off[maxN];
int res[maxN];
ST T;

void solve () {
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i ++) {
        int l, r;
        cin >> l >> r;
        pos[r].push_back (l);
    }
    for (int i = 1; i <= q; i ++) {
        int l, r;
        cin >> l >> r;
        off[r].push_back ({l, i});
    }
    T.init (n + 2);
    for (int r = 1; r <= n; r ++) {
        for (auto l : pos[r]) {
            T.upd (1, 1, n, l, r, l);
        }
        for (auto [l, id] : off[r]) {
            //cout << T.get (1, 1, n, l, r) << '\n';
            res[id] = (T.get (1, 1, n, l, r) >= l);
        }
    }
    for (int i = 1; i <= q; i ++) {
        cout << (res[i] ? "YES\n" : "NO\n");
    }
    return;
}

signed main () {
    cin.tie (nullptr) -> sync_with_stdio (false);
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    int t = 1;
    //cin >> t;
    while (t --) {
        solve ();
    } 
    return 0;
}
// thfv

Compilation message (stderr)

curtains.cpp: In function 'int main()':
curtains.cpp:118:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
curtains.cpp:119:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  119 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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