제출 #1148173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148173		abylaj	Curtains (NOI23_curtains)	C++20	0 / 100	0 ms	324 KiB

curtains

#include <bits/stdc++.h>

#define ll long long
#define all(x) x.begin(), x.end()
#define in insert
#define F first
#define S second
#define ppf pop_front
#define pb push_back
#define ppb pop_back
#define pf push_front
#define pii pair <ll, ll>
#define pll pair <ll, ll>
#define boost() ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sz(x) (int)x.size()
#define int ll
using namespace std;

const int N = 5e5+123;
const ll mod = 1e9+7;
const int mod2 = 1000001617;
const ll inf = 1e9;
//const int k = 320;
int n,m,q;
int lf[N],rg[N];
int st[N] , en[N];
int mt[N];


void solve() {
    cin >> n >> m >> q;

    for(int i=1 ; i <= m ; i++){
        cin >> lf[i] >> rg[i];
        mt[rg[i]]=1;
    }

    for(int i=1 ; i <= q ; i++){
        cin >> st[i] >> en[i];
        if(mt[en[i]] == 1)
            cout << "YES\n";
        else    
            cout << "NO\n";
    }
}
signed main() {
    boost();
    
    int tt=1;
    //cin >> tt;
    int i=1;

    while (tt--) {
        //cout << "Set " << i << ": " ;
        solve();
        //cout << ".\n";
        i++;
    }
    return 0;
}

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