結果
問題 | No.2290 UnUnion Find |
ユーザー | sten_san |
提出日時 | 2023-05-05 21:27:33 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 165 ms / 2,000 ms |
コード長 | 3,532 bytes |
コンパイル時間 | 2,465 ms |
コンパイル使用メモリ | 210,804 KB |
実行使用メモリ | 13,492 KB |
最終ジャッジ日時 | 2023-08-15 02:58:28 |
合計ジャッジ時間 | 12,625 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,384 KB |
testcase_02 | AC | 36 ms
4,384 KB |
testcase_03 | AC | 102 ms
8,336 KB |
testcase_04 | AC | 103 ms
8,056 KB |
testcase_05 | AC | 103 ms
8,060 KB |
testcase_06 | AC | 102 ms
8,196 KB |
testcase_07 | AC | 104 ms
8,064 KB |
testcase_08 | AC | 103 ms
8,120 KB |
testcase_09 | AC | 102 ms
8,068 KB |
testcase_10 | AC | 102 ms
8,112 KB |
testcase_11 | AC | 101 ms
8,068 KB |
testcase_12 | AC | 102 ms
8,124 KB |
testcase_13 | AC | 104 ms
8,068 KB |
testcase_14 | AC | 104 ms
8,064 KB |
testcase_15 | AC | 104 ms
8,068 KB |
testcase_16 | AC | 103 ms
8,068 KB |
testcase_17 | AC | 103 ms
8,076 KB |
testcase_18 | AC | 103 ms
8,072 KB |
testcase_19 | AC | 120 ms
8,884 KB |
testcase_20 | AC | 165 ms
13,492 KB |
testcase_21 | AC | 44 ms
4,384 KB |
testcase_22 | AC | 73 ms
5,712 KB |
testcase_23 | AC | 72 ms
5,724 KB |
testcase_24 | AC | 139 ms
10,372 KB |
testcase_25 | AC | 62 ms
5,116 KB |
testcase_26 | AC | 155 ms
12,016 KB |
testcase_27 | AC | 153 ms
11,020 KB |
testcase_28 | AC | 99 ms
7,276 KB |
testcase_29 | AC | 135 ms
9,852 KB |
testcase_30 | AC | 50 ms
4,380 KB |
testcase_31 | AC | 124 ms
9,396 KB |
testcase_32 | AC | 63 ms
5,312 KB |
testcase_33 | AC | 94 ms
7,208 KB |
testcase_34 | AC | 165 ms
13,320 KB |
testcase_35 | AC | 152 ms
11,816 KB |
testcase_36 | AC | 67 ms
5,488 KB |
testcase_37 | AC | 87 ms
6,660 KB |
testcase_38 | AC | 67 ms
5,340 KB |
testcase_39 | AC | 75 ms
5,956 KB |
testcase_40 | AC | 146 ms
11,164 KB |
testcase_41 | AC | 60 ms
4,940 KB |
testcase_42 | AC | 114 ms
8,832 KB |
testcase_43 | AC | 110 ms
8,308 KB |
testcase_44 | AC | 103 ms
8,068 KB |
testcase_45 | AC | 104 ms
8,256 KB |
testcase_46 | AC | 108 ms
8,108 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, q; cin >> n >> q; set<int> rem; for (int i = 0; i < n; ++i) { rem.insert(i); } atcoder::dsu dsu(n); auto merge = [&](int u, int v) { if (dsu.same(u, v)) { return; } u = dsu.leader(u); v = dsu.leader(v); int x = dsu.merge(u, v); if (u != x) { rem.erase(u); } if (v != x) { rem.erase(v); } }; while (q--) { int t; cin >> t; if (t == 1) { int u, v; cin >> u >> v; --u; --v; merge(u, v); } if (t == 2) { int u; cin >> u; --u; u = dsu.leader(u); auto iter = begin(rem); while (iter != end(rem) && *iter == u) { ++iter; } if (iter != end(rem)) { cout << *iter + 1 << '\n'; } else { cout << -1 << '\n'; } } } cout << flush; }