結果
問題 | No.2301 Namorientation |
ユーザー | sten_san |
提出日時 | 2023-05-12 21:57:31 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 415 ms / 3,000 ms |
コード長 | 3,531 bytes |
コンパイル時間 | 2,472 ms |
コンパイル使用メモリ | 223,360 KB |
実行使用メモリ | 59,392 KB |
最終ジャッジ日時 | 2024-05-06 11:49:45 |
合計ジャッジ時間 | 14,480 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 177 ms
27,904 KB |
testcase_13 | AC | 164 ms
25,728 KB |
testcase_14 | AC | 389 ms
44,416 KB |
testcase_15 | AC | 207 ms
30,720 KB |
testcase_16 | AC | 311 ms
38,528 KB |
testcase_17 | AC | 192 ms
28,928 KB |
testcase_18 | AC | 308 ms
39,296 KB |
testcase_19 | AC | 150 ms
24,320 KB |
testcase_20 | AC | 310 ms
38,912 KB |
testcase_21 | AC | 212 ms
30,336 KB |
testcase_22 | AC | 196 ms
59,392 KB |
testcase_23 | AC | 201 ms
58,368 KB |
testcase_24 | AC | 160 ms
49,408 KB |
testcase_25 | AC | 154 ms
41,868 KB |
testcase_26 | AC | 199 ms
53,532 KB |
testcase_27 | AC | 415 ms
44,544 KB |
testcase_28 | AC | 400 ms
44,544 KB |
testcase_29 | AC | 376 ms
44,544 KB |
testcase_30 | AC | 393 ms
44,544 KB |
testcase_31 | AC | 375 ms
44,544 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename Container> auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector<int> i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template <typename, template <typename> typename, typename = void_t<>> struct detect : false_type {}; template <typename T, template <typename> typename Check> struct detect<T, Check, void_t<Check<T>>> : true_type {}; template <typename T, template <typename> typename Check> constexpr inline bool detect_v = detect<T, Check>::value; template <typename T> using has_member_sort = decltype(declval<T>().sort()); template <typename Container, typename Compare = less<typename Container::value_type>> auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v<Container, has_member_sort>) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template <typename Container, typename Compare = equal_to<typename Container::value_type>> auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } template <typename F> constexpr auto fix(F &&f) noexcept { return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable { return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...); }; } #include <atcoder/dsu> int main() { int n; cin >> n; auto g = vec<int>(uns, n, 0); auto e = vec<array<int, 2>>(uns, n); for (auto &[a, b] : e) { cin >> a >> b; --a; --b; g[a].push_back(b); g[b].push_back(a); } auto h = vec<int>(uns, n, 0); int sa = -1, sb = -1; atcoder::dsu dsu(n); for (auto [a, b] : e) { if (dsu.same(a, b)) { sa = a; sb = b; continue; } dsu.merge(a, b); h[a].push_back(b); h[b].push_back(a); } map<tuple<int, int>, bool> d; fix([&](auto f, int v, int p = -1) -> void { if (p != -1) { d[{ v, p }] = true; } for (auto u : h[v]) { if (u == p) { continue; } f(u, v); } })(sa); d[{ sa, sb }] = true; for (auto &[a, b] : e) { if (d[{ a, b }]) { cout << "->" << '\n'; } else { cout << "<-" << '\n'; } } cout << flush; }