Pagini recente » Cod sursa (job #3121098) | Cod sursa (job #2519618) | Cod sursa (job #2243516) | Cod sursa (job #3242600) | Cod sursa (job #1726556)
#include<iostream>
#include<vector>
#include<fstream>
#define NM 30003
using namespace std;
vector<pair<int,int> > v[NM];
int d[NM];
void dfs(int nod)
{
for(int i=0;i<v[nod].size();i++)
{
int k,di;
k=v[nod][i].first;
di=v[nod][i].second;
if(d[k]==0)
{
d[k]=d[nod]+di;
dfs(k);
}
}
}
int i,n,m,a,b,dist,x,y;
int main()
{
ifstream cin("sate.in");
ofstream cout("sate.out");
cin>>n>>m>>x>>y;
for(i=1;i<=m;i++)
{
cin>>a>>b>>dist;
if(a>b)
{
v[a].push_back(make_pair(b,-dist));
v[b].push_back(make_pair(a,dist));
}
else
{
v[b].push_back(make_pair(a,-dist));
v[a].push_back(make_pair(b,dist));
}
}
dfs(1);
cout<<d[y]-d[x-1];
return 0;
}