Pagini recente » Clasament iconcurs18 | Cod sursa (job #1618277) | Cod sursa (job #899883) | Cod sursa (job #619831) | Cod sursa (job #2381630)
#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,z,o1,o2;
struct ion{
int nd,dist;
};long long rs[30005];
vector<ion> v[30005];bool viz[30005];
queue<int> q;
void bfs(int nod){
q.push(nod);
viz[nod]=1;
while(!q.empty()){
int nod=q.front();
q.pop();
for(int i=0;i<v[nod].size();i++)
if(!viz[v[nod][i].nd]){
q.push(v[nod][i].nd);
rs[v[nod][i].nd]+=rs[nod]+v[nod][i].dist;
viz[v[nod][i].nd]=1;
if(v[nod][i].nd==o2)return;
}
}
}
int main(){
ifstream cin("sate.in");
ofstream cout("sate.out");
cin>>n>>m>>o1>>o2;
for(int i=1;i<=m;i++){
cin>>x>>y>>z;
ion nod;nod.nd=x;nod.dist=-z;
v[y].push_back(nod);
nod.nd=y;nod.dist=z;
v[x].push_back(nod);
}
bfs(o1);
cout<<rs[o2];
return 0;
}