Pagini recente » Cod sursa (job #299059) | Cod sursa (job #1754843) | Cod sursa (job #2676844) | Cod sursa (job #3040087) | Cod sursa (job #3264807)
#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("sate.in");
ofstream cout("sate.out");
int n, m, s, f, x, y, z;
vector<int> d;
vector<vector<pair<int, int>>> graf;
void bfs(int node)
{
queue<int> q;
q.push(node);
d[node] = 1;
while(!q.empty())
{
node = q.front();
q.pop();
for(auto &[next, price]:graf[node])
if(!d[next])
{
if(next > node)
d[next] = d[node] + price;
else
d[next] = d[node] - price;
q.push(next);
}
}
}
int main()
{
cin >> n >> m >> s >> f;
graf.assign(n+1, vector<pair<int, int>>());
d.resize(n+1);
for(int i=1; i<=m; i++)
{
cin >> x >> y >> z;
graf[x].push_back({y, z});
graf[y].push_back({x, z});
}
bfs(s);
cout << d[f] - 1;
return 0;
}