Pagini recente » Cod sursa (job #2849949) | Cod sursa (job #1751446) | Cod sursa (job #339760) | Cod sursa (job #177002) | Cod sursa (job #2295549)
#include <fstream>
#include <vector>
using namespace std;
struct muchie{
int x,c;
};
vector < muchie > v[30001];
int a,b,n,m,x,y,k1,k2,q[90000001],viz[30001],j,S,i,d;
char s[1001];
void coada(int x){
int p,u,i,l;
p=u=1;
q[p]=x;
viz[x]=1;
while(p<=u && viz[y]==0){
l=q[p];
p++;
for(i=0;i<v[l].size();i++)
if(viz[v[l][i].x]==0){
if(v[l][i].x<l)
viz[v[l][i].x]=viz[l]-v[l][i].c;
else
viz[v[l][i].x]=viz[l]+v[l][i].c;
if(v[l][i].x==y)
break;
u++;
q[u]=v[l][i].x;
}
}
}
int main()
{
ifstream cin("sate.in");
ofstream cout("sate.out");
//citire parsata
cin.getline(s,999);
//pt n
n=s[0]-'0';
i=1;
while(s[i]>='0' && s[i]<='9'){
n=n*10+(s[i]-'0');
i++;
}
i++;
//pt m
m=s[i]-'0';
i++;
while(s[i]>='0' && s[i]<='9'){
m=m*10+(s[i]-'0');
i++;
}
i++;
//pt x
x=s[i]-'0';
i++;
while(s[i]>='0' && s[i]<='9'){
x=x*10+(s[i]-'0');
i++;
}
i++;
//pt y
y=s[i]-'0';
i++;
while(s[i]>='0' && s[i]<='9'){
y=y*10+(s[i]-'0');
i++;
}
for(i=1;i<=m;i++){
cin.getline(s,999);
//pt a
a=s[0]-'0';
j=1;
while(s[j]>='0' && s[j]<='9'){
a=a*10+(s[j]-'0');
j++;
}
j++;
//pt b
b=s[j]-'0';
j++;
while(s[j]>='0' && s[j]<='9'){
b=b*10+(s[j]-'0');
j++;
}
j++;
//pt d
d=s[j]-'0';
j++;
while(s[j]>='0' && s[j]<='9'){
d=d*10+(s[j]-'0');
j++;
}
v[a].push_back({b,d});
v[b].push_back({a,d});
}
S=0;
coada(x);
viz[y]--;
cout<<viz[y];
return 0;
}