Pagini recente » Cod sursa (job #1260577) | Cod sursa (job #2058434) | Cod sursa (job #888878) | Cod sursa (job #2676560) | Cod sursa (job #1072773)
#include<cstdio>
#include<vector>
#include<deque>
#include<cstring>
using namespace std;
typedef pair<int,int> PII;
const int INF = (1<<30);
const int NMAX = 1001;
const int MMAX = 100001;
int N,M,sol;
int C[NMAX][NMAX];
int F[NMAX][NMAX];
int T[NMAX];
int S[MMAX];
bool viz[NMAX];
vector<PII> E[NMAX];
vector<int> V[NMAX];
deque<int> Q;
int BFS(int S,int D)
{
int x,y;
vector<int>::iterator it;
Q.resize(0);
memset(viz,0,sizeof(viz));
Q.push_back(S);
viz[S]=1;
for(; !Q.empty();)
{
x=Q.front();
Q.pop_front();
for(it=V[x].begin(); it!=V[x].end(); it++)
{
if(C[x][*it]==F[x][*it] || C[*it][x]==F[*it][x] || viz[*it]) continue;
y=*it;
Q.push_back(y);
viz[y]=viz[x];
T[y]=x;
if(viz[D]) return viz[D];
}
}
return viz[D];
}
int main()
{
int i,a,b,c,x,v;
vector<int>::iterator it;
vector<PII>::iterator jt;
freopen("critice.in","r",stdin);
freopen("critice.out","w",stdout);
scanf("%d%d",&N,&M);
for(i=1; i<=M; i++)
{
scanf("%d%d%d",&a,&b,&c);
V[a].push_back(b);
V[b].push_back(a);
E[a].push_back(make_pair(b,i));
E[b].push_back(make_pair(a,i));
C[a][b]=C[b][a]=c;
}
for(; BFS(1,N);)
for(it=V[N].begin(); it!=V[N].end(); it++)
{
if(C[N][*it]==F[N][*it] || C[*it][N]==F[*it][N] || !viz[*it]) continue;
x=*it;
T[N]=x;
v=INF;
for(x=N; x!=1; x=T[x])
v=min(v,C[T[x]][x]-F[T[x]][x]);
for(x=N; x!=1; x=T[x])
{
F[T[x]][x]+=v;
F[x][T[x]]-=v;
}
}
for(i=1;i<=N;i++)
for(jt=E[i].begin(); jt!=E[i].end(); jt++)
{
a=i;
b=jt->first;
if(C[a][b]!=F[a][b]) continue;
if(BFS(1,a) && BFS(N,b)) S[++sol]=jt->second;
}
printf("%d\n",sol);
for(i=1; i<=sol; i++)
printf("%d\n",S[i]);
return 0;
}