Pagini recente » Cod sursa (job #281325) | Cod sursa (job #1112829) | Cod sursa (job #2240969) | Cod sursa (job #2293945) | Cod sursa (job #1584928)
#include <bits/stdc++.h>
#include <cstring>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define INF 0x3f3f3f3f
#define NMAX 1000005
using namespace std;
ifstream in("sate.in");
ofstream out("sate.out");
int n,m,a,b,cst[NMAX],x=0,y=0,c=0;
queue<int> Q;
vector<pair<int,int> > v[NMAX];
vector<pair<int,int> >::iterator it;
void bfs()
{
int x=0,K=0,cost=0;
Q.push(a);
cst[a]=1;
if(a==b) return;
while(!Q.empty())
{
x=Q.front();
for(it=v[x].begin();it!=v[x].end();it++)
{
K=(*it).f;
cost=(*it).s;
if(!cst[K])
{
cst[K]=cst[x]+cost;
if(K==b)
return;
Q.push(K);
}
}
Q.pop();
}
}
int main()
{
ios_base::sync_with_stdio(false);
in>>n>>m>>a>>b;
for(int i=1;i<=m;i++)
{
in>>x>>y>>c;
v[x].push_back(make_pair(y,c));
v[y].push_back(make_pair(x,-c));
}
bfs();
out<<cst[b]-1;
return 0;
}