Pagini recente » Cod sursa (job #568853) | Cod sursa (job #675966) | Cod sursa (job #2466630) | Cod sursa (job #437026) | Cod sursa (job #2663349)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sate.in");
ofstream fout("sate.out");
deque < pair < int, int > > graf[30005];
bool vizitat[30005];
int n,m,X,y;
long int s;
void citire()
{
fin>>n>>m>>X>>y;
for(int i=1; i<=m; i++)
{
int a,b,d;
fin>>a>>b>>d;
graf[a].push_back(make_pair(b,d));
graf[b].push_back(make_pair(a,-d));
}
}
void drum(int x)
{
if(x==y)
{
fout<<s;
return;
}
else
{
for(unsigned int i=0; i<graf[x].size(); i++)
{
if(vizitat[graf[x][i].first]==0)
{
vizitat[graf[x][i].first]=1;
s=graf[x][i].second+s;
drum(graf[x][i].first);
s=s-graf[x][i].second;
}
}
}
}
int main()
{
citire();
drum(X);
}