AtCoder Beginner Contest 216 G - 01Sequence(差分约束)

传送门

题意：

构造一个$01$序列，满足$m$个条件，区间$[l_i,r_i]$的$1$的个数至少为$x_i$ ,且构造出来的$1$的个数最少。

题解：

设$s_i$为前缀$1$的个数，那么条件可以变为$s[r_i]-s[l_i]\ge x_i$ 。

有$m$个这样的不等式，最后求$s_n$的最小值，那么就是普通的差分约束，跑一遍$dj$即可。

在建边上有一些要注意的点，$i$ 和 $i+1$ 之间的建边要考虑。

代码：

#pragma GCC diagnostic error "-std=c++11"
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<unordered_map>
#include<map>
#include<stack>
#include<set>
#include<ctime>
#define iss ios::sync_with_stdio(false)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
const int mod=1e9+7;
const int MAXN=2e5+5;
const int inf=0x3f3f3f3f;
int head[MAXN];
int vis[MAXN];
ll dis[MAXN];
int cnt;
struct edge {
    int to;
    int cost;
    int next;
} e[MAXN * 4];
struct node {
    int pos;
    ll val;
    friend bool operator<(node a, node b)
    {
        return a.val > b.val;
    }
};
void add(int u, int v, int w)
{
    e[cnt].to = v;
    e[cnt].cost = w;
    e[cnt].next = head[u];
    head[u] = cnt++;
}
void solve(int s)
{
    memset(vis, 0, sizeof vis);
    memset(dis, 0x3f3f3f, sizeof dis);
    priority_queue<node> q;
    q.push(node { s, 0 });
    dis[s] = 0;
    while (!q.empty()) {
        node now = q.top();
        q.pop();
        if (vis[now.pos])
            continue;
        vis[now.pos] = 1;
        for (int i = head[now.pos]; i != -1; i = e[i].next) {
            int v = e[i].to;
            if (dis[v] > now.val + e[i].cost) {
                dis[v] = now.val + e[i].cost;
                q.push(node { v, dis[v] });
            }
        }
    }
}
int main()
{
    memset(head, -1, sizeof head);
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m;i++){
        int l, r, x;
        scanf("%d%d%d", &l, &r, &x);
        x = (r - l + 1) - x;
        add(l - 1, r, x);
    }
    for (int i = 1; i <= n;i++){
        add(i - 1, i, 1);
        add(i, i - 1, 0);
    }
    solve(0);
    for (int i = 1; i <= n;i++){
        //cout << dis[i] << " " << dis[i - 1] << endl;
        printf("%d ", (dis[i] - dis[i - 1])^1);
    }
}