Pagini recente » Cod sursa (job #3185162) | Cod sursa (job #846555) | Cod sursa (job #1650965) | Cod sursa (job #1774610) | Cod sursa (job #1694065)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sate.in");
ofstream g("sate.out");
int n,m,x,y,x1,y1,d,used[30001];
vector < pair<int,int> > graf[30001];
int dfs(int k)
{
used[k]=1;
int len=graf[k].size();
for(int it=0;it<len;it++)
{
if(!used[graf[k][it].first])
{
if(graf[k][it].first==y)
{
for(int i=1;i<=n;i++)
used[i]=1;
return graf[k][it].second;
}
else
return (graf[k][it].second)+dfs(graf[k][it].first);
}
}
}
int main()
{
f>>n>>m>>x>>y;
for(int i=1;i<=m;i++)
{
f>>x1>>y1>>d;
graf[x1].push_back(make_pair(y1,d));
graf[y1].push_back(make_pair(x1,-d));
}
g<<dfs(x);
return 0;
}