完全看不下题目啊!!!全被这小萝莉吸引了啊!!!!!
第i天与人建边
源点与天建边
汇点与人建边
先判断是否可行
然后输出
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <time.h>;
#define cler(arr, val) memset(arr, val, sizeof(arr))
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define IN freopen ("in.txt" , "r" , stdin);
#define OUT freopen ("out.txt" , "w" , stdout);
typedef long long LL;
const int MAXN = 10500;
const int MAXM = 124224;
//const int INF = 0x3f3f3f3f;
const int INF = 123123123;
const int mod = 1000000007;
struct Edge
{
int to,next,cap,flow;
}edge[MAXM];
int tol,head[MAXN];
int gap[MAXN],dep[MAXN],cur[MAXN];
void init()
{
tol=0;
cler(head,-1);
}
void addedge(int u,int v,int w,int rw=0)
{
edge[tol].to=v,edge[tol].cap=w,edge[tol].flow=0,edge[tol].next=head[u];
head[u]=tol++;
edge[tol].to=u,edge[tol].cap=rw,edge[tol].flow=0,edge[tol].next=head[v];
head[v]=tol++;
}
int Q[MAXN];
void BFS(int star,int end)
{
cler(dep,-1);
cler(gap,0);
gap[0]=-1;
int front= 0, rear = 0;
dep[end]=0;
Q[rear++] = end;
while(front!= rear)
{
int u=Q[front++];
for(int i = head[u];i!=-1;i=edge[i].next)
{
int v=edge[i].to;
if(dep[v]!= -1) continue;
Q[rear++]= v;
dep[v]=dep[u]+1;
gap[dep[v]]++;
}
}
}
int S[MAXN];
int sap(int star,int end,int N)
{
BFS(star,end);
memcpy(cur,head,sizeof(head));
int top=0, u=star,ans=0;
while(dep[star]<N)
{
if(u==end)
{
int Min=INF;
int inser;
for(int i=0;i<top;i++)
if(Min>edge[S[i]].cap-edge[S[i]].flow)
{
Min=edge[S[i]].cap-edge[S[i]].flow;
inser=i;
}
for(int i=0;i<top;i++)
{
edge[S[i]].flow+=Min;
edge[S[i]^1].flow-=Min;
}
ans+=Min;
top=inser;
u=edge[S[top]^1].to;
continue;
}
bool flag = false;
int v;
for(int i=cur[u];i!=-1;i=edge[i].next)
{
v=edge[i].to;
if(edge[i].cap-edge[i].flow&&dep[v]+1==dep[u])
{
flag = true;
cur[u]=i;
break;
}
}
if(flag)
{
S[top++] = cur[u];
u=v;
continue;
}
int Min=N;
for(int i= head[u];i!=-1;i=edge[i].next)
if(edge[i].cap-edge[i].flow&&dep[edge[i].to]<Min)
{
Min=dep[edge[i].to];
cur[u]=i;
}
gap[dep[u]]--;
if(!gap[dep[u]]) return ans;
dep[u]=Min+1;
gap[dep[u]]++;
if(u!=star) u=edge[S[--top]^1].to;
}
return ans;
}
int low[MAXM],G[MAXM],t[MAXM];
int u,v,d[MAXM],c[MAXM],r,l;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif
int n , m;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i=0;i<m;i++)
{
scanf("%d",&G[i]);
}
cler(low,0);
init();
int top=0,star=n+m,end=n+m+1,sum=0;
for(int i=0;i<n;i++)
{
scanf("%d%d",&t[i],&d[i]);
for(int j=0;j<t[i];j++)
{
scanf("%d%d%d",&u,&l,&r);
addedge(i,u+n,r-l);
low[u+n]+=l;
low[i]-=l;
c[top++]=l;
}
}
for(int i=0;i<n;i++)
addedge(star,i,d[i]);//一天的容量
for(int i=0;i<m;i++)//每人到汇点
{
addedge(i+n,end,INF-G[i]);
low[end]+=G[i];
low[i+n]-=G[i];
}
addedge(end,star,INF);//连接汇点和源点
int Star=star+2,End=end+2;
for(int i=0;i<n+m+2;i++)
{
if(low[i]>0)
addedge(Star,i,low[i]),sum+=low[i];
else
addedge(i,End,-low[i]);
}
if(sap(Star,End,n+m+2+2)==sum)
{
int num=0;
printf("%d\n",sap(star,end,n+m+2));
for(int i=0;i<n;i++)
{
for(int j=0;j<t[i];j++)
{
printf("%d\n",c[num]+edge[2*num].flow);
num++;
}
}
puts("");
}
else printf("-1\n\n");
}
return 0;
}