-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathmasina1.cpp
103 lines (98 loc) · 2.08 KB
/
masina1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
# include <cstdio>
# include <vector>
# include <algorithm>
# include <queue>
# define NR 205
# define inf 9999999
using namespace std;
struct elem
{
int y, cost;
}E;
vector <elem> v[NR];
queue <int> q;
struct elem2
{
int i, t;
}E2;
queue <elem2> q2;
int i,j,n,m,x,y,S,timp,X,Y,I,T,VV,urm,cost;
int distX[NR], distY[NR], a[NR][NR], sol[NR];
void BFS (int k, int dist[])
{
int i,urm,cost;
for (i=1; i<=n; ++i)
dist[i]=inf;
dist[k]=0; q.push(k);
while (! q.empty())
{
k=q.front(); q.pop();
for (i=0; i<v[k].size(); ++i)
{
urm=v[k][i].y; cost=v[k][i].cost;
if (dist[k]+cost<dist[urm])
{
dist[urm]=dist[k]+cost;
q.push(urm);
}
}
}
}
void solve (int k)
{
int i,urm,tact,cost;
E2.i=k; E2.t=0; a[S][0]=1;
q2.push(E2);
while (! q2.empty())
{
E2=q2.front(); q2.pop();
k=E2.i; tact=E2.t;
if (tact>T) I=k, T=tact;
for (i=0; i<v[k].size(); ++i)
{
urm=v[k][i].y; cost=v[k][i].cost;
if (! a[urm][tact+cost] && tact+cost+max(distX[urm], distY[urm])<=timp)
{
a[urm][tact+cost]=1;
E2.i=urm; E2.t=tact+cost;
q2.push(E2);
}
}
}
}
int main ()
{
freopen ("masina1.in", "r", stdin);
freopen ("masina1.out", "w", stdout);
scanf ("%d%d", &n, &m);
scanf ("%d%d", &S, &timp);
scanf ("%d%d", &X, &Y);
for (i=1; i<=m; ++i)
{
scanf ("%d%d%d", &x, &y, &E.cost);
E.y=y; v[x].push_back(E);
E.y=x; v[y].push_back(E);
}
BFS (X, distX);
BFS (Y, distY);
solve (S);
//afisam
printf ("%d\n", T);
while (1)
{
sol[++VV]=I;
if (T==0) break;
for (i=0; i<v[I].size(); ++i)
{
urm=v[I][i].y; cost=v[I][i].cost;
if (a[urm][T-cost])
{
I=urm; T=T-cost;
break;
}
}
}
for (i=VV; i>=1; --i)
printf ("%d ", sol[i]);
return 0;
}