CodeForces 483D :Interesting Array 线段树

最新推荐文章于 2024-09-12 19:02:20 发布

匿枫

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量86

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/tlyzxc/article/details/120316916

版权

传送门

题意

在这里插入图片描述

分析

一个区间&为x，说明这个区间内对应位置上的数一定和x对应为1，我们去区间修改，最后check一下就好了

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}

struct Node{
    int l,r;
    int res,add;
}tr[N * 4];
int ans[N];
int l[N],r[N],val[N];
int n,m;

void push(int u){
    tr[u].res = tr[u << 1].res & tr[u << 1 | 1].res;
}

void down(int u){
    if(tr[u].add){
        int &k = tr[u].add;
        tr[u << 1].res |= k;
        tr[u << 1].add |= k;
        tr[u << 1 | 1].res |= k;
        tr[u << 1 | 1].add |= k;
        k = 0;
    }
}

void build(int u,int l,int r){
    tr[u] = {l,r};
    if(l == r) return;
    int mid = (l + r) >> 1;
    build(u << 1,l,mid),build(u << 1 | 1,mid + 1,r);
    push(u);
}

void modify(int u,int l,int r,int x){
    if(tr[u].l >= l && tr[u].r <= r){
        tr[u].res |= x;
        tr[u].add |= x;
        return;
    }
    down(u);
    int mid = (tr[u].l + tr[u].r) >> 1;
    if(l <= mid) modify(u << 1,l,r,x);
    if(r > mid) modify(u << 1 | 1,l,r,x);
    push(u);
}   

int query(int u,int l,int r){
    if(tr[u].l >= l && tr[u].r <= r) return tr[u].res;
    down(u);
    int res = (1 << 30) - 1;
    int mid = (tr[u].l + tr[u].r) >> 1;
    if(l <= mid) res = res & query(u << 1,l,r);
    if(r > mid) res = res & query(u << 1 | 1,l,r);
    return res;
}

void run(int u){
    if(tr[u].l == tr[u].r){ 
        ans[tr[u].l] = tr[u].res;
        return;
    }
    down(u);
    run(u << 1),run(u << 1 | 1);
}

int main() {
    read(n),read(m);
    build(1,1,n);
    for(int i = 1;i <= m;i++){
        read(l[i]),read(r[i]),read(val[i]);
        if(l[i] > r[i]) swap(l[i],r[i]);
        modify(1,l[i],r[i],val[i]);
    }   
    bool flag = true;
    for(int i = 1;i <= m;i++){
        if(query(1,l[i],r[i]) != val[i]) flag = false;
    }
    if(flag){
        run(1);
        puts("YES");
        for(int i = 1;i <= n;i++) printf("%d ",ans[i]);
        puts("");
    }
    else puts("NO");
    return 0;
}