SGU 212

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 2111;
const int M = 711111;
struct Edge
{
int v,next;
int c;
} edge[M];
int E,head
,cur
,dis
,gap
,pre
;
int l
;
bool vis
;
int in
;
void add_edge(int s,int t,int c,int cc=0)
{
edge[E].v=t;
edge[E].c=c;
edge[E].next=head[s];
head[s]=E++;
edge[E].v=s;
edge[E].c=cc;
edge[E].next=head[t];
head[t]=E++;
}
inline int minx(int a,int b)
{
return (a==-1||b<a)?b:a;
}
int q
;
void gready(int s,int dest)
{
int first=0,rear=1;
q[0]=s;
int i,j,u,v;
int t;
in[s]=0x7f7f7f7f;
vis[s]=true;
while(first<rear)//广搜 正向推流
{
u=q[first++];
for(i=head[u]; ~i; i=edge[i].next)
{
if(in[u]==0) break;
v=edge[i].v;
if(l[v]==l[u]+1)
{
t=min(in[u],edge[i].c);
in[u]-=t;
in[v]+=t;
edge[i].c-=t;
edge[i^1].c+=t;
}
if(!vis[v])
{
vis[v]=true;
q[rear++]=v;
}
}
}
/*
反向拉流
for(i=rear-1;i>=0;--i)
{
u=q[i];
for(j=head[u];~j;j=edge[j].next)
{
v=edge[j].v;
if(l[u]==l[v]+1&&v!=dest)
{
t=min(edge[j^1].c,in[v]);
in[u]+=t;
in[v]-=t;
edge[j].c+=t;
edge[j^1].c-=t;
}
}
}
*/
}
int sap(int s,int t,int n)
{
memset(gap,0,sizeof(gap));
memset(dis,0,sizeof(dis));
int i;
for(i=0; i<=n; i++) cur[i]=head[i];
int u=pre[s]=s,maxflow=0,v;
ll aug=-1;
gap[0]=n;
while(dis[s]<n)
{
loop:
for(i=cur[u]; ~i; i=edge[i].next)
{
v=edge[i].v;
if(edge[i].c>0&&dis[u]==dis[v]+1)
{
aug=minx(aug,edge[i].c);
cur[u]=i;
pre[v]=u;
u=v;
if(u==t)
{
for(u=pre[u]; v!=s; v=u,u=pre[u])
{
edge[cur[u]].c-=aug;
edge[cur[u]^1].c+=aug;
}
maxflow+=aug;
aug=-1;
}
goto loop;
}
}
int mindis=n;
for(i=head[u]; ~i; i=edge[i].next)
{
v=edge[i].v;
if(edge[i].c>0&&dis[v]<mindis)
{
mindis=dis[v];
cur[u]=i;
}
}
if((--gap[dis[u]])==0) break;
gap[dis[u]=mindis+1]++;
u=pre[u];
}
return maxflow;
}
int main()
{
E=0;
int a,b,c;
int i,n,m,L;
memset(head,-1,sizeof(head));
scanf("%d%d%d",&n,&m,&L);
int s,t;
for(i=1; i<=n; ++i)
{
scanf("%d",l+i);
if(l[i]==1)
s=i;
if(l[i]==L)
t=i;
}
for(i=0; i<m; ++i)
{
scanf("%d%d%d",&a,&b,&c);
add_edge(a,b,c);
}
gready(s,t);
int flow=sap(s,t,n);
for(i=1; i<E; i+=2)
{
printf("%d\n",edge[i].c);
}
return 0;
}