Submission #1279529

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279529		ghammazhassan	Curtains (NOI23_curtains)	C++20	0 / 100	1 ms	576 KiB

curtains

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=998244353;
const int inf = 1e14;
const int LOG=20;
const int N=3e5+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve()
{   
    cin >> n >> m >> q;
    vector<pair<int,int>>a(m);
    vector<set<int>>a1(n+1),a2(n+1);
    for (int i=0;i<m;i++){
        cin >> x >> y;
        a[i]={x,y};
        a1[x].insert(y);
    }
    sort(a.begin(),a.end());
    for (int i=0;i<m;i++){
        // cout << a[i].fi << " " << a[i].se << endl;
    }
    for (int i=1;i<=n;i++){
        a1[i].insert(0);
    }
    for (int i=0;i<q;i++){
        cin >> x >> y;
        int mx=*a1[x].rbegin();
        if (a1[x].lower_bound(1)==a1[x].end() or *a1[x].lower_bound(1)>y){
            cout << "NO" << endl;
            continue;
        }
        bool f=0;
        for (int j=x;j<=min(mx+1,n);j++){
            if (a1[j].lower_bound(y)!=a1[j].end() and *a1[j].lower_bound(y)==y){
                f=1;
                break;
            }
            mx=max(mx,*a1[j].upper_bound(y));
        }
        cout << (f ? "YES" : "NO") << endl;
    }
}
signed main()    
{

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
} 

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