Pagini recente » Cod sursa (job #303666) | Cod sursa (job #2749599) | Cod sursa (job #388007) | Cod sursa (job #1076745) | Cod sursa (job #2475039)
#include <fstream>
#include <vector>
using namespace std;
int n, m, x, y, i, j, a, b, d, l[30001];
bool exp[30001];
vector < pair <int, int> > adj[30001];
int q[30001];
ifstream fin ("sate.in");
ofstream fout ("sate.out");
void BFS (int s)
{
int x=0, st=1, dr=0;
l[s]=0;
exp[s]=1;
q[++dr]=s;
while (st<=dr && l[y]==0) {
x=q[st];
st++;
for (int i=0;i<adj[x].size();i++) {
if (!exp[adj[x][i].first]) {
exp[adj[x][i].first]=1;
l[adj[x][i].first]=l[x]+adj[x][i].second;
q[++dr]=adj[x][i].first;
}
}
}
}
int main () {
fin>>n>>m>>x>>y;
for (i=1;i<=m;i++) {
fin>>a>>b>>d;
adj[a].push_back({b, d});
adj[b].push_back({a, -d});
}
BFS(x);
fout<<l[y];
return 0;
}