Pagini recente » Cod sursa (job #240740) | Cod sursa (job #1791333) | Cod sursa (job #1640691) | Cod sursa (job #2347728) | Cod sursa (job #356919)
Cod sursa(job #356919)
#include <cstdio>
#include <vector>
using namespace std;
#define DIM 30002
void read();
void bfs();
vector <int>G[DIM];
vector <long>Cost[DIM];
int i, x, y, X, Y, d[DIM],p, u, viz[DIM], c[DIM], N, M;
long z;
int main()
{
freopen ("sate.in","r",stdin);
freopen ("sate.out","w",stdout);
read();
bfs();
return 0;
}
void read()
{
scanf ("%d%d%d%d\n",&N,&M,&X,&Y);
for (i=1; i<=M; i++)
{
scanf ("%d%d%d\n",&x,&y,&z);
G[x].push_back(y);
G[y].push_back(x);
Cost[x].push_back(z);
Cost[y].push_back(z);
}
}
void bfs()
{
viz[X]=1;
p=u=0;
c[p]=X;
while ( p<=u && !viz[Y])
{
x=c[p++];
for (i=0; i<G[x].size(); i++)
{
if (!viz[G[x][i]])
{
if (G[x][i] < x)
d[G[x][i]]+=(d[x]-Cost[x][i]);
else d[G[x][i]]+=d[x]+Cost[x][i];
viz[G[x][i]]=1;
c[++u]=G[x][i];
}
}
}
printf ("%d\n",d[Y]);
}