Pagini recente » Cod sursa (job #117741) | Cod sursa (job #118028) | antrenament_oji2020 | Cod sursa (job #117975) | Cod sursa (job #818329)
Cod sursa(job #818329)
#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream in("sate.in");
ofstream out("sate.out");
struct segment{
int fin,dist;
};
int X,Y,n,m,rez;
vector <segment> v[30001];
queue <segment> q;
segment makestruct(int x,int y)
{
segment a;
a.fin=x;a.dist=y;
return a;
}
void bfs()
{
int x,y;
while(!q.empty())
{
segment curent= q.front();
q.pop();
if(curent.fin==Y)
{
rez=curent.dist;
return;
}
for(int i=0;i<v[curent.fin].size();i++)
{
x=curent.fin;
y=v[curent.fin][i].fin;
if(x<y)
q.push(makestruct(y,curent.dist+v[curent.fin][i].dist));
else q.push(makestruct(y,curent.dist-v[curent.fin][i].dist));
}
}
}
int main()
{
int i,x,y,dist;
in>>n>>m>>X>>Y;
for(i=1;i<=m;i++)
{
in>>x>>y>>dist;
v[x].push_back(makestruct(y,dist));
v[y].push_back(makestruct(x,dist));
}
for(i=0;i<v[X].size();i++)
q.push(makestruct(v[X][i].fin,v[X][i].dist));
bfs();
out<<rez;
}