Pagini recente » Cod sursa (job #1830158) | Cod sursa (job #761538) | Cod sursa (job #90641) | Cod sursa (job #2205809) | Cod sursa (job #1058513)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
int viz[30001], d[30001], y;
vector<pair<int, int> >g[30001];
void DF(int nod)
{
int i;
for(i=0; i<g[nod].size(); i++)
{
if(viz[g[nod][i].first]==0)
{
viz[g[nod][i].first]=1;
if(g[nod][i].first<nod)
d[g[nod][i].first]=d[nod]-g[nod][i].second;
if(g[nod][i].first>nod)
d[g[nod][i].first]=d[nod]+g[nod][i].second;
if(g[nod][i].first!=y)
DF(g[nod][i].first);
}
}
}
int main()
{
ifstream f("sate.in");
ofstream h("sate.out");
int n, m, x, i, a, b, c;
f>>n>>m>>x>>y;
for(i=0; i<m; i++)
{
f>>a>>b>>c;
g[a].push_back(make_pair(b, c));
g[b].push_back(make_pair(a, c));
}
d[x]=0;
viz[x]=1;
DF(x);
h<<d[y];
}