Pagini recente » Cod sursa (job #1136486) | Cod sursa (job #269875) | Cod sursa (job #1971941) | Cod sursa (job #3192123) | Cod sursa (job #2583434)
//#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("sate.in");
ofstream cout("sate.out");
vector<pair<int,int> > v[30005];
queue<pair<int,int> > q;
int d[30005];
int main()
{
int n,m,x,y,a,b,di;
cin>>n>>m>>x>>y;
for(int i=1;i<=m;i++){
cin>>a>>b>>di;
v[a].push_back(make_pair(b,di));
v[b].push_back(make_pair(a,-di));
}
for(int i=1;i<=n;i++){
d[i]=30000000;
}
d[x]=0;
q.push(make_pair(x,0));
while(q.empty()==false){
pair<int,int> a=q.front();
q.pop();
for(auto u:v[a.first]){
if(d[u.first]==30000000){
d[u.first]=a.second+u.second;
q.push(make_pair(u.first,a.second+u.second));
}
}
}
cout<<d[y];
return 0;
}