[BZOJ1797]
- 对于任意一条满流边(x,y),(x,y)能够出现在某个最小割集中,当且仅当c[x]!=c[y];
- 对于任意一条满流边(x,y),(x,y)必定出现在最小割集中,当且仅当c[x]==c[s]且c[y]==c[t]。
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int inf=1e9;
const int N=1e6;
struct node{int n,y,v,x;}e[N];
int lin[N],dfn[N],low[N],inv[N],c[N],d[N],cnt,tot,len=1,S,T,n,m,x,y,v;
inline int read(){
int num=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))num=num*10+ch-'0',ch=getchar();
return num;
}
void LK(int x,int y,int v)
{e[++len].y=y,e[len].v=v,e[len].x=x,e[len].n=lin[x],lin[x]=len;}
void add(int x,int y,int v)
{LK(x,y,v),LK(y,x,0);}
stack<int> s;
bool bfs(){
queue<int> q;
memset(d,0,sizeof(d));
q.push(S),d[S]=1;
while(q.size()){
int x=q.front();q.pop();
for(int i=lin[x];i;i=e[i].n){
int y=e[i].y;
if(!e[i].v||d[y])continue;
d[y]=d[x]+1;
q.push(y);
}
}return d[T]>0;
}
int dfs(int x,int minf){
if(x==T)return minf;
int flow=0,sum=0;
for(int i=lin[x];i;i=e[i].n){
int y=e[i].y;
if(!e[i].v||d[y]!=d[x]+1)continue;
flow=dfs(y,min(e[i].v,minf));
if(!flow)d[y]=0;
sum+=flow,minf-=flow,e[i].v-=flow,e[i^1].v+=flow;
if(!minf)return sum;
}return sum;
}
void tarjan(int x){
dfn[x]=low[x]=++tot,s.push(x),inv[x]=1;
for(int i=lin[x];i;i=e[i].n){
int y=e[i].y;
if(!e[i].v)continue;
if(!dfn[y]){
tarjan(y);
low[x]=min(low[x],low[y]);
}else if(inv[y]) low[x]=min(low[x],dfn[y]);
}
if(dfn[x]==low[x]){
int now=0;cnt++;
while(now!=x){
now=s.top();s.pop();
inv[now]=0;
c[now]=cnt;
}
}
}
int main()
{
n=read(),m=read(),S=read(),T=read();
rep(i,1,m){
x=read(),y=read(),v=read();
add(x,y,v);
}
while(bfs())dfs(S,inf);
rep(i,1,n)if(!dfn[i])tarjan(i);
for(int i=2;i<=len;i+=2){
if(e[i].v)puts("0 0");
else{
if(c[e[i].x]!=c[e[i].y])cout<<"1 ";
else cout<<"0 ";
if(c[e[i].x]==c[S]&&c[e[i].y]==c[T])cout<<"1\n";
else cout<<"0\n";
}
}return 0;
}