oj.uz

답안 #967807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967807 2024-04-22T20:46:21 Z TB_ Curtains (NOI23_curtains) C++17
0 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF ((ll)(1e9+7))
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

struct Node{
    int l, r, val = INF;
    Node *lnode, *rnode;
    Node(int l, int r): l(l), r(r) {
        if(r-l > 1){
            int mid = (r+l) / 2;
            lnode = new Node(l, mid);
            rnode = new Node(mid, r);
        }
    }

    void update(int lo, int hi, int x){
        if(r <= lo || hi <= l) return;
        if(r <= hi && lo <= l){
            val = min(val, x);
            return;
        } 
        lnode->update(lo, hi, x);
        rnode->update(lo, hi, x);
    }

    int query(int lo, int hi){
        if(r <= lo || hi <= l) return -1;
        if(r <= hi && lo <= l) return val;
        return max(lnode->query(lo, hi), rnode->query(lo, hi));
    }
};

bool customSort(tuple<ll, ll, ll> &a, tuple<ll, ll, ll> &b){
    if(get<0>(a) == get<0>(b)) return get<1>(a) > get<1>(b); 
    return get<0>(a) < get<0>(b); 
}

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, m, q;
    cin >> n >> m >> q;

    Node st(0, n+1);
    int a, b;
    vpl sections;
    fo(i, m){
        cin >> a >> b;
        sections.pb({a, b});
    }
    sort(rall(sections));
    vector<tuple<ll, ll, ll>> que;
    fo(i, q){
        cin >> a >> b;
        que.pb({a, b, i});
    }
    sort(all(que), customSort);

    vl ans(q, 0);
    fo(i, m){
        tie(a, b) = sections[i];
        st.update(a, b+1, b);

        if(i == n-1 || sections[i+1].F != a){
            while(que.size() && get<0>(que[que.size()-1])>a) que.pop_back();
            while(que.size() && get<0>(que[que.size()-1])==a){
                ans[get<2>(que[que.size()-1])] = (st.query(get<0>(que[que.size()-1]), get<1>(que[que.size()-1])+1)<=get<1>(que[que.size()-1]));
                que.pop_back();
            }
        }
    }
    fo(i, q) cout << (ans[i]?"YES":"NO") << "\n";

    return 0;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -