【BZOJ5288】【HNOI2018】游戏

Description

click me

---

Solution

参考yyb的乱搞方法
233
然后就水过去了。。

正解以后再填坑吧。。。

---

Code

/************************************************
 * Au: Hany01
 * Date: Apr 18th, 2018
 * Prob: [BZOJ5288][HNOI2018] 游戏
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1000001;

int main()
{
#ifdef hany01
    File("bzoj5288");
#endif

    static int n, m, p, tmp, si, ti, key[maxn], L[maxn], R[maxn], las;

    n = read(), m = read(), p = read();
    For(i, 1, m) tmp = read(), key[tmp] = read();

    Fordown(i, n, 1)
    {
        register int l = i, r = i, las = 1;
        for ( ; las + l != r; )
        {
            las = r - l;
            while (l > 1 && (!key[l - 1] || key[l - 1] >= l && key[l - 1] <= r)) -- l;
            while (r < n && (!key[r] || key[r] >= l && key[r] <= r)) chkmin(l, L[++ r]), r = R[r];
        }
        L[i] = l, R[i] = r;
    }

    while (p --) si = read(), ti = read(), puts(L[si] <= ti && R[si] >= ti ? "YES" : "NO");

    return 0;
}
//青山相待，白云相爱，梦不到紫罗袍共黄金带。
//    -- 宋方壶《山坡羊·道情》