Interesting Array 【CodeForces - 482B】【线段树+位运算】

版权声明：https://blog.csdn.net/qq_41730082 https://blog.csdn.net/qq_41730082/article/details/88143163

题目链接

---

  一开始没有考虑到满足前面条件但是到后面的更新就会影响前面条件的情况，所以WA在了第35组，然后一想，我们不妨全部都先或上再去比较每个的答案就可以了。就是先满足上所有的条件，再回去比较每个情况是否满足。具体看代码了。

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, M;
ll tree[maxN<<2] = {0}, lazy[maxN<<2] = {0};
struct Question
{
    int l, r;   ll val;
    Question(int a=0, int b=0, ll c=0):l(a), r(b), val(c) {}
}qes[maxN];
inline void pushdown(int rt)
{
    if(lazy[rt])
    {
        tree[lsn] |= lazy[rt];
        tree[rsn] |= lazy[rt];
        lazy[lsn] |= lazy[rt];
        lazy[rsn] |= lazy[rt];
        lazy[rt] = 0;
    }
}
inline void pushup(int rt) { tree[rt] = tree[lsn] & tree[rsn]; }
void update(int rt, int l, int r, int ql, int qr, ll val)
{
    if(ql <= l && qr >= r)
    {
        tree[rt] |= val;
        lazy[rt] |= val;
        return;
    }
    pushdown(rt);
    int mid = HalF;
    if(qr <= mid) update(QL, val);
    else if(ql > mid) update(QR, val);
    else { update(QL, val); update(QR, val); }
    pushup(rt);
}
ll query(int rt, int l, int r, int ql, int qr)
{
    if(ql <= l && qr >= r) return tree[rt];
    pushdown(rt);
    int mid = HalF;
    if(qr <= mid) return query(QL);
    else if(ql > mid) return query(QR);
    else return ( query(QL) & query(QR) );
}
bool check(ll val, ll need) //目前值，需求变换值
{
    for(int i=30; i>=0; i--)
    {
        if( ((val >> i) & 1) > ((need >> i) & 1) ) return false;
    }
    return true;
}
int main()
{
    scanf("%d%d", &N, &M);
    for(int i=1; i<=M; i++)
    {
        scanf("%d%d%lld", &qes[i].l, &qes[i].r, &qes[i].val);
        update(1, 1, N, qes[i].l, qes[i].r, qes[i].val);
    }
    for(int i=1; i<=M; i++)
    {
        ll tmp = query(1, 1, N, qes[i].l, qes[i].r);
        if(!check(tmp, qes[i].val)) { printf("NO\n"); return 0; }
    }
    printf("YES\n");
    for(int i=1; i<=N; i++) printf("%lld%c", query(1, 1, N, i, i), i == N ? '\n' : ' ');
    return 0;
}