debug了很久,下面代码被标记的行都是用来debug的,最烦人的就是debug,细心,还是要细心,真正现场赛的时候没那么多时间给你去debug,尤其是代码很长,敲错了就等于白敲!!几百行啊有木有!!不过平时刷题都是裸刷不看模版的,到时边照着模版边敲应该不会失误!
建图方法,先用spfa求出所有点到s的最短路,然后从t逆向出发,相当于t变成s,s变成t,把最短路可以经过的路径建成一个网络!正向流量为1,逆向流量为0,证明最大无相同边的路径数就是最大流,比较明显,如果你能找到n条从s到t无相同边的路显然最大流就会大于等于路的数量n,如果最大流为n,由于每条边的正向容量是1,逆向容量是0,所以至少有n条无相同边的路使最大流为n,路的数量大于等于最大流n,所以,最大流==路径数!
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define format "%I64d\n"
#else
#define i64 long long
#define format "%lld\n"
#endif
#define CC(m,what) memset(m,what,sizeof(m))
#define FOR(i,a,b) for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a) for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a) for( int i = (a)-1 ; i >= 0 ; i --)
#define SS(a) scanf("%d",&a)
#define LL(a) ((a)<<1)
#define RR(a) (((a)<<1)+1)
#define SZ(a) ((int)a.size())
#define PP(n,m,a) puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb push_back
#define CL(Q) while(!Q.empty())Q.pop()
#define MM(name,what) memset(name,what,sizeof(name))
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
const int inf = 0x3f3f3f3f;
const double oo = 10e9;
const double eps = 10e-8;
const double PI = acos(-1.0);
const int maxn=111;
int n,s,t;
int a[maxn][maxn];
vector<int>g[maxn];
vector<int>d[maxn];
queue<int>q;
bool vis[maxn];
int c[maxn][maxn];
int f[maxn][maxn];
int way[maxn];
int cen[maxn];
void init()
{
FF ( i , maxn )
{
d[i].clear();
g[i].clear();
}
MM(f,0);
MM(c,0);
return ;
}
bool spfa()
{
CL (q );
MM(vis, false);
FF(i,maxn)
{
way[i]=inf;
}
vis[s]=true;
way[s]=0;
q.push(s);
int now,to,cost;
while(!q.empty())
{
now=q.front();
// cout<<now<<endl;
q.pop();
FF(i,g[now].size())
{
to=g[now][i];
cost=way[now] + a[now][to];
if(cost < way[to])
{
way[to] = cost;
if(!vis[to])
{
vis[to]=true;
q.push(to);
}
}
}
vis[now]=false;
}
// cout<<"spfa"<<endl;
return way[t]==inf;
}
void build()
{
FOR(i,1,n) FOR(j,1,n)
{
if(i!=j && a[i][j] != -1)
{
g[i].pb(j);
}
}
// cout<<"build!"<<endl;
return ;
}
void construct_bfs()
{
MM(vis,false);
CL(q);
q.push(t);
vis[t]=true;
int now,to;
while(!q.empty())
{
now=q.front();
q.pop();
FOR(i,1,n)
{
if(a[i][now]==-1 || i==now)
{
continue;
}
if(way[now] == way[i] + a[i][now])
{
d[now].pb(i);
c[now][i]=1;
d[i].pb(now);
if(!vis[i])
{
vis[i]=true;
q.push(i);
}
}
}
}
// cout<<"construct!"<<endl;
return ;
}
bool bfs()
{
MM(cen,-1);
CL(q);
cen[t]=0;
q.push(t);
int now,to;
while(!q.empty())
{
now=q.front();
q.pop();
FF( i , d[now].size())
{
to=d[now][i];
if(c[now][to] > f[now][to] && cen[to]==-1)
{
cen[to]=cen[now]+1;
q.push(to);
}
}
}
// cout<<"bfs"<<cen[s]<<endl;
return cen[s] != -1;
}
int dfs(int flow=inf,int now=t)
{
// cout<<"dfs "<<flow<<" "<<now<<endl;
if(now==s)
{
return flow;
}
int temp,sum=0;
int to;
FF(i,d[now].size())
{
to=d[now][i];
if( cen[to] == cen[now] + 1 && flow > sum && c[now][to] > f[now][to])
{
temp = dfs ( min ( flow - sum , c[now][to] - f[now][to] ) , to );
sum += temp;
f[now][to] += temp;
f[to][now] -= temp;
}
}
if(!sum) cen[now] = -1;
return sum;
}
int dinic()
{
int ans=0;
while( bfs() )
{
ans+=dfs();
// cout<<ans<<endl;
}
return ans;
}
int main()
{
while(cin>>n)
{
init();
FOR(i, 1, n) FOR(j,1,n)
{
SS(a [i][j]);
}
build();
SS(s);
SS(t);
s++;
t++;
if(s!=t)
{
if(spfa())
{
printf("0\n");
continue;
}
construct_bfs();
printf("%d\n",dinic());
}
else
{
printf("inf\n");
}
}
return 0;
}