Pagini recente » Cod sursa (job #2846290) | Cod sursa (job #2853104) | Cod sursa (job #935473) | Cod sursa (job #3200462) | Cod sursa (job #483298)
Cod sursa(job #483298)
#include<fstream>
#include<vector>
#include<queue>
#define M 30005
#define pb push_back
#define mp make_pair
using namespace std;
ifstream f("sate.in");
ofstream g("sate.out");
typedef vector< pair<long, long> > VI;
VI a[M];
VI::iterator it;
queue<long> q;
long n,m,X,Y,d[M];
void cit()
{
long i,x,y,z;
f>>n>>m>>X>>Y;
for(i=1;i<=m;++i)
{
f>>x>>y>>z;
a[x].pb(mp(y,z));
a[y].pb(mp(x,z));
}
f.close();
}
void drum()
{
long x,y,z,i;
for(x=1;x<=n;++x)
d[x]=-1;
d[X]=0;
q.push(X);
while(!q.empty())
{
x=q.front();
q.pop();
if(x==Y) break;
for(it=a[x].begin(); it!=a[x].end(); ++it)
{
y=(*it).first;
z=(*it).second;
if(d[y]==-1) {if(y>x) d[y]=d[x]+z;
else d[y]=d[x]-z;
q.push(y);}
}
}
}
int main()
{
cit();
drum();
g<<d[Y]<<"\n";
g.close();
return 0;
}