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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <queue>
using namespace std;
typedef long long int64;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e4 + 110;
class lfs {
public:
lfs(int N) {
memset(head, -1, sizeof head);
memset(l, 0, sizeof l);
memset(r, 0, sizeof r);
ecnt = 0;
n = N;
}
void adde(int from, int to, int L, int R) {
u[ecnt] = from;
l[ecnt] = L;
r[ecnt] = R;
e[ecnt].to = to;
e[ecnt].w = R;
e[ecnt].next = head[from];
head[from] = ecnt++;
}
struct Edge {
int to, next, w;
} e[MAXN * 2];
int head[MAXN];
int ecnt;
int n;
int u[MAXN], l[MAXN], r[MAXN];
};
class dijkstra : public lfs {
public:
dijkstra(int n) : lfs(n) {}
int64 dis1[MAXN], dis2[MAXN];
void solve(int s, int64* dis) {
priority_queue<pair<int64, int>, vector<pair<int64, int>>,
greater<pair<int64, int>>>
que;
dis[s] = 0;
que.push(pair<int64, int>(0, s));
while (!que.empty()) {
pair<int64, int> p = que.top();
que.pop();
int v = p.second;
if (dis[v] < p.first) continue;
for (int i = head[v]; ~i; i = e[i].next) {
Edge now = e[i];
if (now.w + dis[v] < dis[now.to]) {
dis[now.to] = now.w + dis[v];
que.push(pair<int64, int>(dis[now.to], now.to));
}
}
}
}
bool check(int s1, int s2, int f, bool can_draw, int m, int k) {
bool updated;
do {
updated = false;
memset(dis1, INF, sizeof dis1);
memset(dis2, INF, sizeof dis2);
solve(s1, dis1);
solve(s2, dis2);
if (dis1[f] < dis2[f] + can_draw) {
cout << (can_draw ? "DRAW" : "WIN") << endl;
for (int i = m; i < m + k; i++) {
cout << e[i].w << ' ';
}
cout << endl;
return true;
}
for (int i = m; i < m + k; i++) {
if (dis1[u[i]] < dis2[u[i]] + can_draw) {
if (e[i].w > l[i]) {
e[i].w = l[i];
updated = true;
break;
}
}
}
} while (updated);
return false;
}
};
#include <cctype>
#include <cstdio>
template <typename T = int>
inline T read() {
T X = 0, w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '-';
ch = getchar();
}
while (isdigit(ch)) {
X = (X << 3) + (X << 1) + (ch ^ 48);
ch = getchar();
}
return w ? -X : X;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
int s1, s2, f;
cin >> s1 >> s2 >> f;
dijkstra* graph = new dijkstra(n);
for (int i = 1; i <= m; i++) {
int u = read();
int v = read();
int w = read();
graph->adde(u, v, w, w);
}
for (int i = 1; i <= k; i++) {
int u = read();
int v = read();
graph->l[i] = read();
graph->r[i] = read();
graph->adde(u, v, graph->l[i], graph->r[i]);
}
if (!graph->check(s1, s2, f, false, m, k)) {
if (!graph->check(s1, s2, f, true, m, k)) {
cout << "LOSE" << endl;
}
}
}
|
