ccpc2019 哈尔滨 8/12

A

裸的差分约束，注意用前缀和作为点的时候给前缀和一点限制，以及就是，这题卡常x
不过赛后补题我的一发过了x，队友的比赛时T飞了…

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <queue>
 
using namespace std;
 
// a -> b (c)表示b - a <= c
 
int const N = 3005;
 
struct edge {
   
	int w, y, next;
	int is;
} e[N * 10];
int dis[N], last[N], ne;
queue<int> q;
int cnt[N];
bool inq[N];
int n, m1, m2;
 
inline void addedge(int x, int y, int w, int is) {
   
	//cerr << ">> " << x << ' ' << y << ' ' << w << ' ' << is << '\n';
	e[++ne] = {
    w, y, last[x], is };
	last[x] = ne;
}
 
inline void add_edge_w(int delta) {
   
	for (int i = 1; i <= ne; ++i) {
   
		if (e[i].is == 1)
			e[i].w += delta;
		if (e[i].is == 2)
			e[i].w -= delta;
	}
}
 
bool chk(int delta) {
   
	add_edge_w(delta);
	fill(dis, dis + n + 1, 0);
	fill(inq, inq + n + 1, 1);
	fill(cnt, cnt + n + 1, 0);
	while (!q.empty())
		q.pop();
	for (int i = 0; i <= n; ++i) 
		q.push(i);
	while (!q.empty()) {
   
		int now = q.front();
		q.pop();
		inq[now] = 0;
		for (int i = last[now]; i; i = e[i].next) 
			if (dis[e[i].y] > dis[now] + e[i].w) {
   
				dis[e[i].y] = dis[now] + e[i].w;
				cnt[e[i].y] = cnt[now] + 1;
				if (cnt[e[i].y] > n + 1) {
   
					add_edge_w(-delta);
					return 0;
				}
				if (inq[e[i].y] == 0) {
   
					inq[e[i].y] = 1;
					q.push(e[i].y);
				}
			}
	}
	add_edge_w(-delta);
	return 1;
}
 
int main() {
   
	int T;
	scanf("%d", &T);
	while (T--) {
   
		scanf("%d%d%d", &n, &m1, &m2);
		fill(last, last + n + 1, 0);
		ne = 0;
 
		for (int i = 1; i <= m1; ++i) {
   
			//s[r] - s[l - 1] >= K
			//s[l - 1] - s[r] <= -K
			int l, r, K;
			scanf("%d%d%d", &l, &r, &K);
			addedge(r, l - 1, -K, 0);
		}
 
		for (int i = 1; i <= m2; ++i) {
   
			//s[r] - s[l - 1] <= s[n] - K
			int l, r, K;
			scanf("%d%d%d", &l, &r, &K);
			addedge(l - 1, r, -K, 1);
		}
		for (int i = 1; i <= n; ++i) {
   
			//s[i] <= s[i - 1] + 1
			//s[i] >= s[i - 1]
			//s[i] - s[i - 1] <= 1
			//s[i - 1] - s[i] <= 0
			addedge(i - 1, i, 1, 0);
			addedge(i, i - 1, 0, 0);
		}
		//s[n] - s[0] >= sn
		//s[n] - s[0] <= sn
		//s[0] - s[n] <= -sn
		addedge(0, n, 0, 1);
		addedge(n, 0, 0, 2);
		
		int l = 0, r = n, ans = -1;
		while (l <= r) {
   
			int mid = (l + r) >> 1;
			if (chk(mid)) {
   
				ans = mid;
				r = mid - 1;
			} else
				l = mid + 1;
		}
		printf("%d\n", ans);
	}
}

B

发现只需要限制端点就可以限制一个选择的区间。
也就是说，题目中的条件可以转化为，如果选择了$A_1,A_2$