482 B. Interesting Array

	构造,ST表.

#include <cstdio>
#include <cstring>


const int MAXN = 100005;
const int MAX_LOG = 17;

struct query
{
    int l, r, v;
};

int n, m;
query q[MAXN];
int a[30][MAXN];
int pre_log[MAXN];
int st[MAXN][MAX_LOG];

void init()
{
    pre_log[1] = 0;
    for (int i = 2; i <= n; i ++) {
        pre_log[i] = pre_log[(i >> 1)] + 1;
    }
    for (int i = n; i >= 1; i --) {
        for (int j = 0; i + (1 << (j + 1)) - 1 <= n; j ++) {
            st[i][j + 1] = (st[i][j] & st[i + (1 << j)][j]);
        }
    }
}

int Query(int l, int r)
{
    int t = pre_log[r - l + 1];
    return (st[l][t] & st[r - (1 << t) + 1][t]);
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; ++ i) {
        scanf("%d%d%d", &q[i].l, &q[i].r, &q[i].v);
        for (int j = 0; j < 30; ++ j) {
            if ((q[i].v >> j) & 1) {
                a[j][q[i].l] += 1;
                a[j][q[i].r + 1] -= 1;
            }
        }
    }
    for (int j = 0; j < 30; ++ j) {
        for (int i = 1; i <= n; ++ i) {
            a[j][i] = a[j][i - 1] + a[j][i];
        }
    }
    for (int i = 1; i <= n; ++ i) {
        for (int j = 0; j < 30; ++ j) {
            if (a[j][i])    st[i][0] |= (1 << j);
        }
    }
    init();
    for (int i = 0; i < m; ++ i) {
        int val = Query(q[i].l, q[i].r);
        if (val != q[i].v) {
            puts("NO");
            return 0;
        }
    }
    puts("YES");
    for (int i = 1; i <= n; ++ i) {
        printf("%d ", st[i][0]);
    }
    puts("");
    return 0;
}