Pagini recente » Cod sursa (job #2324631) | Cod sursa (job #2489708) | Cod sursa (job #2444176) | Cod sursa (job #2313155) | Cod sursa (job #2031631)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sate.in");
ofstream out("sate.out");
const int N=30001;
vector<int>a[N];
int viz[N],d[N],n,m,x0,y0,q[N];
void citire()
{
int x,y,z,i;
in>>n>>m>>x0>>y0;
for(i=0; i<m; i++)
{
in>>x>>y>>z;
a[x].push_back(y);
a[y].push_back(x);
a[x].push_back(z);
a[y].push_back(z);
}
}
void BFS(int nod)
{
int st,dr,i,x,y,p=0,u=-1;
d[x0]=0;
q[++u]=nod;
viz[nod]=1;
while(p<=u)
{
x=q[p++];
for(size_t i=0; i<a[x].size(); i=i+2)
{
y=a[x][i];
if(!viz[y])
{
viz[y]=1;
if(x<y)
{
d[y]=d[x]+a[x][i+1];
q[++u]=y;
}
else
{
d[y]=d[x]-a[x][i+1];
q[++u]=y;
}
}
}
}
}
int main()
{
int i,b;
citire();
BFS(x0);
out<<d[y0];
return 0;
}