Pagini recente » Cod sursa (job #2138091) | Cod sursa (job #2680139) | Cod sursa (job #1680874) | Istoria paginii runda/simulareinfo_oji_7_9/clasament | Cod sursa (job #1515869)
#include<fstream>
#include<vector>
#include<deque>
using namespace std;
ifstream f("sate.in");
ofstream g("sate.out");
int n,m,inc,sf,i,x,y,a[3005][3005],d[30005],dist,nod;
vector<int>v[30005];
deque<int>q;
int main()
{
f>>n>>m>>inc>>sf;
for(i=1;i<=m;i++)
{
f>>x>>y>>dist;
v[x].push_back(y);
v[y].push_back(x);
a[x][y]=a[y][x]=dist;
}
d[inc]=0;
q.push_back(inc);
while(!q.empty())
{
nod=q.front();
q.pop_front();
for(i=0;i<v[nod].size();i++)
{
q.push_back(v[nod][i]);
if(nod<v[nod][i])
d[v[nod][i]]+=a[nod][v[nod][i]];
else
d[v[nod][i]]-=a[nod][v[nod][i]];
}
if(d[sf]!=0)
{
g<<d[sf];
return 0;
}
}
return 0;
}