题意: 给N个任务,M台机器。每个任务有最早才能开始做的时间S,deadline E,和持续工作的时间P。每个任务可以分段进行,但是在同一时刻,一台机器最多只能执行一个任务. 问存不存在可行的工作时间。
建图 :源点sp:0、每一天作为一个节点(t < 500):1 ~ 500、任务:500 + 1 ~ 500 + n、汇点tp:500 + n + 1
源点->任务(sp, i, pi) 每一天->汇点(j, tp, m) i在j进行(i, j, 1)
最大流 == 任务需要天数 ?
链接 :hdu 3572
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define INF 0x3f3f3f3f
#define ll long long
#define MAXN 5005
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 500005;
int n, m;//点数、边数
int sp, tp;//原点、汇点
struct node {
int v, next;
ll cap;
}mp[maxn];
int pre[MAXN], dis[MAXN], cur[MAXN];//cur为当前弧优化,dis存储分层图中每个点的层数(即到原点的最短距离),pre建邻接表
int cnt = 0;
void init() { //不要忘记初始化
cnt = 0;
memset(pre, -1, sizeof(pre));
}
void add(int u, int v, int w) { //加边
mp[cnt].v = v;
mp[cnt].cap = w;
mp[cnt].next = pre[u];
pre[u] = cnt++;
mp[cnt].v = u;
mp[cnt].cap = 0;
mp[cnt].next = pre[v];
pre[v] = cnt++;
}
bool bfs() { //建分层图
memset(dis, -1, sizeof(dis));
queue<int>q;
while(!q.empty())
q.pop();
q.push(sp);
dis[sp] = 0;
int u, v;
while(!q.empty()) {
u = q.front();
q.pop();
for(int i = pre[u]; i != -1; i = mp[i].next) {
v = mp[i].v;
if(dis[v] == -1 && mp[i].cap>0) {
dis[v] = dis[u] + 1;
q.push(v);
if(v == tp)
break;
}
}
}
return dis[tp] != -1;
}
ll dfs(int u,ll cap) {//寻找增广路
if(u == tp || cap == 0)
return cap;
ll res = 0, f;
for(int &i = cur[u]; i != -1; i = mp[i].next) {//
int v = mp[i].v;
if(dis[v] == dis[u] + 1 && (f = dfs(v, min(cap - res, mp[i].cap))) > 0) {
mp[i].cap -= f;
mp[i ^ 1].cap += f;
res += f;
if(res == cap)
return cap;
}
}
if(!res)
dis[u] = -1;
return res;
}
ll dinic() {
ll ans = 0;
while(bfs()) {
for(int i = sp; i <= tp; i++)
cur[i] = pre[i];
ans += dfs(sp, inf);
}
return ans;
}
int main()
{
int t, kcase = 0;
cin >> t;
while(t--) {
init();
int N, M;
scanf("%d %d", &N, &M);
int p, s, e;
long long sum = 0;
int T = 1005;
for(int i = 1; i <= N; i++) {
scanf("%d %d %d", &p, &s, &e);
add(0, i, p);
for(int j = s + N; j <= e + N; j++) {
add(i, j, 1);
}
sum += p;
}
for(int i = 1; i <= 500; i++) {
add(i + N, T, M);
}
n = M, m = N;
sp = 0, tp = T;
ll ans = dinic();
printf("Case %d: ", ++kcase);
if(ans >= sum) {
puts("Yes\n");
}
else {
puts("No\n");
}
}
return 0;
}