Pagini recente » Cod sursa (job #1131240) | Cod sursa (job #1283800) | Cod sursa (job #672218) | Cod sursa (job #1528469) | Cod sursa (job #1076971)
#include <cstdio>
#include <vector>
#define NMAX 30002
using namespace std;
int n, m;
int x, y;
int dist[NMAX];
int q[NMAX];
vector<int> v[NMAX];
vector<int> c[NMAX];
char viz[NMAX];
void read() {
scanf("%d%d%d%d", &n, &m, &x, &y);
int a, b, cost;
if (x > y) swap(x, y);
for (int i = 1; i <= m; i++) {
scanf("%d%d%d",&a, &b, &cost);
v[a].push_back(b);
c[a].push_back(cost);
v[b].push_back(a);
c[b].push_back(cost);
}
}
void bfs() {
q[0] = x;
viz[x] = 1;
int sat, lim, vecin;
int st = 0;
int dr = 0;
while (st <= dr && !viz[y]) {
sat = q[st];
lim = v[sat].size();
for (int i = 0; i < lim; i++) {
vecin = v[sat][i];
if (!viz[vecin]) {
viz[vecin] = 1;
q[++dr] = vecin;
if (vecin > sat) {
dist[vecin] = dist[sat] + c[sat][i];
} else {
dist[vecin] = dist[sat] - c[sat][i];
}
}
}
st++;
}
}
int main() {
freopen("sate.in","r", stdin);
freopen("sate.out", "w", stdout);
read();
bfs();
printf("%d", dist[y]);
return 0;
}