Submission #76318

ソースコード

?
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
#pragma region
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) \
Type __VA_ARGS__; \
input(__VA_ARGS__)
#define let const auto
constexpr size_t operator""_zu(unsigned long long value) {
return value;
};
constexpr intmax_t operator""_jd(unsigned long long value) {
return value;
};
constexpr uintmax_t operator""_ju(unsigned long long value) {
return value;
};
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream& is, Container& vs) {
for (auto& v: vs) is >> v;
return is;
}
template <class T, class U>
inline istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream& os, const Container& vs) {
static constexpr const char* delim[] = {" ", ""};
for (auto it = begin(vs); it != end(vs); ++it) {
os << delim[it == begin(vs)] << *it;
}
return os;
}
inline void output() {
cout << "\n";
}
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) cout << " ";
output(forward<Tail>(tail)...);
}
template <class Iterator>
inline void join(const Iterator& Begin, const Iterator& End, const string& delim = "\n",
const string& last = "\n") {
for (auto it = Begin; it != End; ++it) {
cout << ((it == Begin) ? "" : delim) << *it;
}
cout << last;
}
template <class T>
inline vector<T> makeVector(const T& init_value, size_t sz) {
return vector<T>(sz, init_value);
}
template <class T, class... Args>
inline auto makeVector(const T& init_value, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(init_value, args...))>(
sz, makeVector<T>(init_value, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func> {forward<Func>(f)};
}
template <class Container>
struct reverse_t {
Container& c;
reverse_t(Container& c) : c(c) {}
auto begin() {
return c.rbegin();
}
auto end() {
return c.rend();
}
};
template <class Container>
auto reversed(Container& c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T& a, const T& b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T& a, const T& b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T& a, const T& b) noexcept {
return a < b ? b - a : a - b;
}
template <class T>
inline T sigma(const T& l, const T& r) noexcept {
return (l + r) * (r - l + 1) / 2;
}
template <class T>
inline T div_floor(T a, T b) noexcept {
if (b < 0) a = -a, b = -b;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
inline T div_ceil(T a, T b) noexcept {
if (b < 0) a = -a, b = -b;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
void operator|=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs | rhs;
}
void operator&=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs & rhs;
}
void operator^=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs ^ rhs;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header
// Edge {{{
template <class Weight>
struct Edge {
size_t from, to;
Weight weight;
Edge() {}
Edge(size_t from, size_t to, Weight weight = 1) :
from(from), to(to), weight(weight)
{}
bool operator<(const Edge &rhs) const {
return weight < rhs.weight;
}
bool operator>(const Edge &rhs) const {
return weight > rhs.weight;
}
operator size_t() const {
return to;
}
};
// }}}
// Graph {{{
template <class Weight>
class Graph : public vector<vector<Edge<Weight>>> {
using graph = vector<vector<Edge<Weight>>>;
public:
Graph() {}
Graph(const size_t V) : graph(V) {}
void connect(size_t from, size_t to, Weight weight = 1) {
(*this)[from].emplace_back(from, to, weight);
}
friend ostream& operator<<(ostream &strm, const Graph &G) {
for (size_t v = 0; v < G.size(); ++v) {
strm << '[' << setw(2) << v << ']';
for (const auto &e: G[v]) {
strm << ' ' << setw(2) << e.to;
}
strm << '\n';
}
return strm;
}
};
// }}}
int main() {
ioinit();
var(size_t, N, M);
assert(2 <= N && N <= 100'000);
assert(1 <= M && M <= min<size_t>(N * (N - 1) / 2, 100'000));
Graph<pair<intmax_t, intmax_t>> G(N);
rep(_, 0, M) {
var(size_t, u, v);
var(intmax_t, h, w);
assert(1 <= u && u < v && v <= N);
assert(1 <= h && h <= intmax_t(1e9));
assert(0 <= w && w <= intmax_t(1e9));
u--, v--;
G.connect(u, v, make_pair(h, w));
G.connect(v, u, make_pair(h, w));
}
vector<intmax_t> min_time(N, LINF);
min_time[0] = 0;
MinHeap<tuple<intmax_t, size_t>> que;
que.emplace(0, 0);
while (!que.empty()) {
const auto [t, v] = que.top();
que.pop();
if (min_time[v] < t) continue;
for (const auto e: G[v]) {
const auto [h, w] = e.weight;
if (chmin(min_time[e.to], max(min_time[v], w) + h)) {
que.emplace(min_time[e.to], e.to);
}
}
}
intmax_t mx = -LINF;
size_t res = 1;
repr(v, N - 1, 0) if (min_time[v] != LINF) {
if (chmax(mx, min_time[v])) {
res = v + 1;
}
}
output(res);
return 0;
}

ステータス

項目 データ
問題 1659 - Yet Unavailable Roads
ユーザー名 もけ
投稿日時 2023-09-22 01:28:30
言語 C++17
状態 Accepted
得点 1
ソースコード長 7531 Byte
最大実行時間 85 ms
最大メモリ使用量 13072 KB

セット

セット 得点 Cases
1 ALL 1 / 1 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
corner_input00.txt AC 67 ms 12488 KB
1
corner_input01.txt AC 68 ms 12916 KB
1
corner_input02.txt AC 58 ms 10956 KB
1
random_input01.txt AC 21 ms 496 KB
1
random_input02.txt AC 24 ms 536 KB
1
random_input03.txt AC 21 ms 572 KB
1
random_input04.txt AC 20 ms 544 KB
1
random_input05.txt AC 18 ms 580 KB
1
random_input06.txt AC 23 ms 768 KB
1
random_input07.txt AC 24 ms 604 KB
1
random_input08.txt AC 21 ms 616 KB
1
random_input09.txt AC 26 ms 1484 KB
1
random_input10.txt AC 23 ms 1064 KB
1
random_input11.txt AC 25 ms 1232 KB
1
random_input12.txt AC 18 ms 1356 KB
1
random_input13.txt AC 17 ms 1184 KB
1
random_input14.txt AC 26 ms 1512 KB
1
random_input15.txt AC 24 ms 1432 KB
1
random_input16.txt AC 22 ms 1056 KB
1
random_input17.txt AC 50 ms 8196 KB
1
random_input18.txt AC 59 ms 9504 KB
1
random_input19.txt AC 45 ms 7108 KB
1
random_input20.txt AC 31 ms 3496 KB
1
random_input21.txt AC 63 ms 11252 KB
1
random_input22.txt AC 69 ms 11788 KB
1
random_input23.txt AC 31 ms 3824 KB
1
random_input24.txt AC 28 ms 3784 KB
1
random_input25.txt AC 81 ms 12928 KB
1
random_input26.txt AC 85 ms 13072 KB
1
random_input27.txt AC 83 ms 11080 KB
1
random_input28.txt AC 69 ms 11224 KB
1
sample_input01.txt AC 17 ms 688 KB
1
sample_input02.txt AC 23 ms 644 KB
1
sample_input03.txt AC 21 ms 732 KB
1
sample_input04.txt AC 21 ms 552 KB
1
sample_input05.txt AC 20 ms 632 KB
1