没有什么好说的
#include <cstdio>#include <cstring>#include <queue>#include <algorithm>#define MAXN1005#define MAXM100500#define INF0x7fffffffusing namespace std;struct Edge {int v, val, next;}edge[MAXM];struct Point {int actual, start, final;}p[MAXN];int e_cnt, head[MAXN], pre[MAXN], dis[MAXN], gap[MAXN], cur[MAXN];void insert_arc(int u, int v, int w){edge[e_cnt].v = v;edge[e_cnt].val = w;edge[e_cnt].next = head[u];head[u] = e_cnt ++;swap(u, v);edge[e_cnt].v = v;edge[e_cnt].val = 0;edge[e_cnt].next = head[u];head[u] = e_cnt ++;}void bfs(int des){int u, v;queue<int> q;memset(gap, 0, sizeof(gap));memset(dis, -1, sizeof(dis));gap[0] = 1;dis[des] = 0;q.push(des);while( !q.empty() ){u = q.front(); q.pop();for(int i = head[u]; i != -1; i = edge[i].next){v = edge[i].v;if( edge[i].val || dis[v] != -1 )continue;dis[v] = dis[u]+1; gap[dis[v]] ++; q.push(v);}}}int i_sap(int src, int des, int VN){int u(src), v, min_dis, max_flow(0), path_flow(INF);bfs(des); pre[u] = u;for(int i = 0; i <= VN; i ++) cur[i] = head[i];while( dis[src] < VN ){loop:for(int &i = cur[u]; i != -1; i = edge[i].next){v = edge[i].v;if( !edge[i].val || dis[u] != dis[v]+1 )continue;path_flow = min(path_flow, edge[i].val);pre[v] = u; u = v;if( v == des ){for(u = pre[u]; v != src; v = u, u = pre[u]){edge[cur[u]].val -= path_flow; edge[cur[u]^1].val += path_flow;}max_flow += path_flow; path_flow = INF;}goto loop;}min_dis = VN;for(int i = head[u]; i != -1; i = edge[i].next){v = edge[i].v;if( edge[i].val && min_dis > dis[v] ){min_dis = dis[v];cur[u] = i;}}gap[dis[u]] --;if( !gap[dis[u]] )break;dis[u] = min_dis+1;gap[dis[u]] ++;u = pre[u];}return max_flow;}int main(int argc, char const *argv[]){//freopen("test.in", "r", stdin);int cnt(1), cas, task, machine, src, des, max_day, ans;scanf("%d", &cas);while( cas-- ){max_day = 0; e_cnt = 0; ans = 0;memset(head, -1, sizeof(head));scanf("%d %d", &task, &machine);for(int i = 1; i <= task; i ++){scanf("%d %d %d", &p[i].actual, &p[i].start, &p[i].final);ans += p[i].actual;max_day = max(max_day, p[i].final);}src = max_day+task+1;des = 0;for(int i = 1; i <= task; i ++)insert_arc(src, i, p[i].actual);for(int i = 1; i <= task; i ++)for(int j = p[i].start; j <= p[i].final; j ++)insert_arc(i, j+task, 1);for(int i = 1; i <= max_day; i ++)insert_arc(i+task, des, machine);if( ans == i_sap(src, des, src+1) )printf("Case %d: Yes\n", cnt ++);elseprintf("Case %d: No\n", cnt ++);printf("\n");}return 0;}
