题目概述
有
n
天
解题报告
把题目里的限制一顿乱加刷有源汇上下界最大流即可。
我一直WA,之后看liu_runda大佬说ZOJ这道题可能出问题了,于是我找了网上一个题解的代码交了一发,然后……WA了,于是在这里我就口头AC好了……
示例程序
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=365+1000,maxm=365+365*100+1000+maxn,MAXINT=((1<<30)-1)*2+1;
int n,m,S,T,SS,TT,num[maxn+5],ful,dis[maxn+5],que[maxn+5];
int E,lnk[maxn+5],cur[maxn+5],low[maxm+5];
bool vis[maxn+5],pd[maxm+5];
struct Edge
{
int cap,flow,nxt,son;Edge() {}
Edge(int a,int b,int c,int d) {cap=a;flow=b;nxt=c;son=d;}
};
Edge e[2*maxm+5];
void Add(int x,int y,int L,int R,bool fl=false)
{
low[E/2]=L;pd[E/2]=fl;
e[E]=Edge(R-L,0,lnk[x],y);lnk[x]=E++;
e[E]=Edge(0,0,lnk[y],x);lnk[y]=E++;
num[x]-=L;num[y]+=L;
}
bool Bfs(int st,int gl)
{
memset(vis,0,sizeof(vis));
int Head=0,Tail=0;que[++Tail]=st;vis[st]=true;dis[st]=0;
while (Head!=Tail)
{
int x=que[++Head];
for (int j=lnk[x];~j;j=e[j].nxt)
if (e[j].cap>e[j].flow&&!vis[e[j].son])
{
que[++Tail]=e[j].son;vis[e[j].son]=true;
dis[e[j].son]=dis[x]+1;
}
}
return vis[gl];
}
int Dfs(int x,int gl,int MIN=MAXINT)
{
if (!MIN||x==gl) return MIN;
int flow=0,f;
for (int &j=cur[x];~j;j=e[j].nxt)
if (dis[x]+1==dis[e[j].son]&&(f=Dfs(e[j].son,gl,min(MIN,e[j].cap-e[j].flow))))
{
e[j].flow+=f;e[j^1].flow-=f;
flow+=f;MIN-=f;if (!MIN) break;
}
return flow;
}
int Dinic(int st,int gl)
{
int MAX=0;
while (Bfs(st,gl))
{
memcpy(cur,lnk,sizeof(lnk));
MAX+=Dfs(st,gl);
}
return MAX;
}
int main()
{
freopen("program.in","r",stdin);
freopen("program.out","w",stdout);
for (bool fst=true;~scanf("%d%d",&n,&m);fst=false)
{
S=0;T=n+m+1;SS=T+1;TT=SS+1;ful=0;
E=0;memset(lnk,255,sizeof(lnk));memset(num,0,sizeof(num));
for (int i=1,x;i<=m;i++) scanf("%d",&x),Add(i+n,T,x,MAXINT);
for (int i=1,C,D,x,L,R;i<=n;i++)
{
scanf("%d%d",&C,&D);Add(S,i,0,D);
while (C--) scanf("%d%d%d",&x,&L,&R),Add(i,x+1+n,L,R,true);
}
for (int i=S;i<=T;i++)
if (num[i]>0) Add(SS,i,0,num[i]),ful+=num[i]; else
if (num[i]<0) Add(i,TT,0,-num[i]);
Add(T,S,0,MAXINT);
if (!fst) putchar('\n');
if (Dinic(SS,TT)==ful)
{
int lst=e[E-2].flow;
for (int j=lnk[SS];~j;j=e[j].nxt)
e[j].flow=e[j].cap,e[j^1].flow=e[j^1].cap;
for (int j=lnk[TT];~j;j=e[j].nxt)
e[j].flow=e[j].cap,e[j^1].flow=e[j^1].cap;
e[E-1].flow=e[E-1].cap;e[E-2].flow=e[E-2].cap;
printf("%d\n",lst+Dinic(S,T));
for (int j=0;j<E;j+=2) if (pd[j/2])
printf("%d\n",e[j].flow+low[j/2]);
} else printf("-1\n");
}
return 0;
}