Submission #00195

ソースコード

?
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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Headelr {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(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__)
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;
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>;
using imax = intmax_t;
using usize = size_t;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
for (auto &e: vec) {
is >> e;
}
return is;
}
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 T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e: vec) {
os << e << delim[&e == &vec.back()];
}
return os;
}
template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, 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;
}
// }}} End Header
constexpr int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const auto inside = [](int y, int x, int H, int W) -> bool {
return (y >= 0 && x >= 0 && y < H && x < W);
};
// Real {{{
const long double EPS = 1e-10;
const long double PI = acos(-1);
struct Real {
long double x;
Real(long double x = 0) : x(x) {}
Real(const Real& rhs) { x = rhs.x; }
Real operator+(const Real& rhs) const { return Real(x + rhs.x); }
Real& operator+=(const Real& rhs) { return x += rhs.x, *this; }
Real operator-(const Real& rhs) const { return Real(x - rhs.x); }
Real& operator-=(const Real& rhs) { return x -= rhs.x, *this; }
Real operator*(const Real& rhs) const { return Real(x * rhs.x); }
Real& operator*=(const Real& rhs) { return x *= rhs.x, *this; }
Real operator/(const Real& rhs) const { return Real(x / rhs.x); }
Real& operator/=(const Real& rhs) { return x /= rhs.x, *this; }
Real operator-() const { return Real(-x); }
Real& operator++() { return ++x, *this; }
Real& operator--() { return --x, *this; }
Real operator++(int) { Real tmp(x); return ++x, tmp; }
Real operator--(int) { Real tmp(x); return --x, tmp; }
bool operator==(const Real& rhs) const { return fabs(x - rhs.x) < EPS; }
bool operator!=(const Real& rhs) const { return !(*this == rhs); }
bool operator<(const Real& rhs) const { return (*this == rhs) ? false : x < rhs.x; }
bool operator>(const Real& rhs) const { return (*this == rhs) ? false : x > rhs.x; }
bool operator<=(const Real& rhs) const { return (*this == rhs) ? true : x < rhs.x; }
bool operator>=(const Real& rhs) const { return (*this == rhs) ? true : x > rhs.x; }
template <class T> explicit operator T() const { return static_cast<T>(x); }
friend istream& operator>>(istream& is, Real& rhs) {
is >> rhs.x;
return is;
}
friend ostream& operator<<(ostream& os, const Real& rhs) {
os << rhs.x;
return os;
}
friend Real pow(const Real& n, const Real& p) { return pow(n.x, p.x); }
friend Real pow(Real n, intmax_t p) {
Real ret = 1;
for (; p > 0; p >>= 1) {
if (p & 1) ret *= n;
n *= n;
}
return ret;
}
friend Real abs(const Real& rhs) { return abs(rhs.x); }
friend Real sin(const Real& rhs) { return sin(rhs.x); }
friend Real cos(const Real& rhs) { return cos(rhs.x); }
friend Real tan(const Real& rhs) { return tan(rhs.x); }
friend Real asin(const Real& rhs) { return asin(rhs.x); }
friend Real acos(const Real& rhs) { return acos(rhs.x); }
friend Real atan(const Real& rhs) { return atan(rhs.x); }
friend Real atan2(const Real& lhs, const Real& rhs) { return atan2(lhs.x, rhs.x); }
friend Real sqrt(const Real& rhs) { return sqrt(rhs.x); }
friend Real ceil(const Real& rhs) { return ceil(rhs.x); }
friend Real floor(const Real& rhs) { return floor(rhs.x); }
friend Real round(const Real& rhs) { return round(rhs.x); }
};
using real_t = Real;
real_t operator""_r(long double value) { return value; };
// }}}
const imax MOD = imax(1e6);
intmax_t power(intmax_t n, intmax_t p, intmax_t M) {
intmax_t ret = 1;
for (; p > 0; p >>= 1) {
if (p & 1) {
ret = (ret * n) % M;
}
n = (n * n) % M;
}
return ret;
}
imax binomial(imax n, imax r) {
imax ret = 1;
reps(i, 1, r) {
ret *= n--;
ret /= i;
}
return ret;
}
// 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;
}
};
// }}}
// topologicalSort {{{
template <class T>
vector<size_t> topologicalSort(const Graph<T> &G) {
const size_t N = G.size();
vector<size_t> ord, indeg(N);
queue<size_t> que;
ord.reserve(N);
for (size_t v = 0; v < N; ++v) {
for (const auto e: G[v]) {
indeg[e.to]++;
}
}
for (size_t v = 0; v < N; ++v) {
if (indeg[v] == 0) {
que.push(v);
}
}
while (!que.empty()) {
const size_t cur = que.front();
que.pop();
ord.push_back(cur);
for (const auto e: G[cur]) {
if (--indeg[e.to] == 0) {
que.push(e.to);
}
}
}
return ord;
}
// }}}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.setf(ios_base::fixed);
cout.precision(10);
var(usize, N);
vector<imax> win(N);
Graph<usize> G(N);
rep(i, 0, N - 1) {
var(usize, a, b);
a--, b--;
G.connect(a, b);
}
const auto tp = topologicalSort(G);
if (tp.size() != N) {
return output(0), 0;
}
const usize root = tp[0];
dump(root);
vector<imax> fact(N);
fact[0] = 1;
rep(i, 1, N) fact[i] = fact[i - 1] * i % MOD;
vector<imax> value(N, -1);
const auto res = makeFixPoint([&](auto rec, usize cur) -> imax {
auto &ret = value[cur];
if (~ret) return ret;
ret = 1;
imax child_cnt = 0;
for (const auto e: G[cur])
{
ret *= rec(e.to);
ret %= MOD;
child_cnt++;
}
ret *= fact[child_cnt];
ret %= MOD;
return ret;
})(root);
output(res);
return 0;
}

ステータス

項目 データ
問題 0010 - トーナメントの記録
ユーザー名 虚無
投稿日時 2020-08-17 11:38:15
言語 C++17
状態 Wrong Answer
得点 0
ソースコード長 9890 Byte
最大実行時間 48 ms
最大メモリ使用量 760 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in1 AC 27 ms 476 KB
1
in2 AC 18 ms 600 KB
1
in3 WA 18 ms 540 KB
1
in4 WA 21 ms 488 KB
1
in5 WA 20 ms 568 KB
1
in6 AC 19 ms 516 KB
1
in7 AC 18 ms 596 KB
1
in8 WA 30 ms 552 KB
1
in9 WA 24 ms 504 KB
1
in10 WA 18 ms 432 KB
1
in11 WA 22 ms 512 KB
1
in12 WA 18 ms 468 KB
1
in13 WA 20 ms 548 KB
1
in14 WA 48 ms 500 KB
1
in15 WA 21 ms 456 KB
1
in16 WA 23 ms 536 KB
1
in17 WA 25 ms 616 KB
1
in18 WA 14 ms 568 KB
1
in19 WA 16 ms 520 KB
1
in20 WA 14 ms 680 KB
1
in21 WA 20 ms 672 KB
1
in22 WA 29 ms 656 KB
1
in23 AC 27 ms 644 KB
1
in24 AC 23 ms 760 KB
1
in25 AC 21 ms 668 KB
1