Pagini recente » Cod sursa (job #1850555) | Cod sursa (job #3131863) | Cod sursa (job #1015323) | Borderou de evaluare (job #1900539) | Cod sursa (job #2423138)
#include <bits/stdc++.h>
using namespace std;
ifstream in("sate.in");
ofstream out("sate.out");
const int MAX=30006;
int n,m,x,y,st[MAX],dr[MAX],c[MAX];
int d[MAX];
int main()
{
in>>n>>m>>x>>y;
for(int i=1;i<=m;i++)
{
in>>st[i]>>dr[i]>>c[i];
}
d[x]=1;
while(!d[y])
{
for(int i=1;i<=m;i++)
{
if(!d[st[i]] && d[dr[i]]) d[st[i]]=d[dr[i]]-c[i];
else if(d[st[i]] && !d[dr[i]]) d[dr[i]]=d[st[i]]+c[i];
}
}
out<<d[y]-1;
return 0;
}