#564679 (C++17) No.1254 補強への架け橋

提出ソース

結果

問題	No.1254 補強への架け橋
ユーザー	haruki_K
提出日時	2020-10-09 22:12:40
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	56 ms / 2,000 ms
コード長	6,154 bytes
コンパイル時間	2,135 ms
コンパイル使用メモリ	215,528 KB
実行使用メモリ	18,152 KB
最終ジャッジ日時	2023-09-27 17:39:27
合計ジャッジ時間	12,228 ms
ジャッジサーバーID （参考情報）	judge15 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	1 ms 4,376 KB
testcase_02	AC	2 ms 4,376 KB
testcase_03	AC	2 ms 4,380 KB
testcase_04	AC	1 ms 4,376 KB
testcase_05	AC	2 ms 4,376 KB
testcase_06	AC	2 ms 4,376 KB
testcase_07	AC	1 ms 4,380 KB
testcase_08	AC	2 ms 4,376 KB
testcase_09	AC	1 ms 4,376 KB
testcase_10	AC	1 ms 4,376 KB
testcase_11	AC	2 ms 4,380 KB
testcase_12	AC	1 ms 4,380 KB
testcase_13	AC	2 ms 4,376 KB
testcase_14	AC	1 ms 4,376 KB
testcase_15	AC	1 ms 4,376 KB
testcase_16	AC	1 ms 4,380 KB
testcase_17	AC	2 ms 4,376 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	2 ms 4,380 KB
testcase_20	AC	1 ms 4,380 KB
testcase_21	AC	2 ms 4,504 KB
testcase_22	AC	2 ms 4,376 KB
testcase_23	AC	1 ms 4,380 KB
testcase_24	AC	2 ms 4,380 KB
testcase_25	AC	1 ms 4,376 KB
testcase_26	AC	1 ms 4,376 KB
testcase_27	AC	1 ms 4,380 KB
testcase_28	AC	1 ms 4,380 KB
testcase_29	AC	1 ms 4,376 KB
testcase_30	AC	1 ms 4,376 KB
testcase_31	AC	2 ms 4,380 KB
testcase_32	AC	1 ms 4,376 KB
testcase_33	AC	1 ms 4,376 KB
testcase_34	AC	1 ms 4,376 KB
testcase_35	AC	1 ms 4,380 KB
testcase_36	AC	2 ms 4,384 KB
testcase_37	AC	1 ms 4,376 KB
testcase_38	AC	2 ms 4,376 KB
testcase_39	AC	1 ms 4,380 KB
testcase_40	AC	1 ms 4,380 KB
testcase_41	AC	1 ms 4,380 KB
testcase_42	AC	1 ms 4,380 KB
testcase_43	AC	2 ms 4,380 KB
testcase_44	AC	1 ms 4,380 KB
testcase_45	AC	2 ms 4,380 KB
testcase_46	AC	2 ms 4,380 KB
testcase_47	AC	2 ms 4,380 KB
testcase_48	AC	2 ms 4,376 KB
testcase_49	AC	2 ms 4,380 KB
testcase_50	AC	2 ms 4,380 KB
testcase_51	AC	2 ms 4,376 KB
testcase_52	AC	1 ms 4,376 KB
testcase_53	AC	2 ms 4,380 KB
testcase_54	AC	2 ms 4,376 KB
testcase_55	AC	2 ms 4,376 KB
testcase_56	AC	2 ms 4,376 KB
testcase_57	AC	2 ms 4,376 KB
testcase_58	AC	2 ms 4,380 KB
testcase_59	AC	2 ms 4,376 KB
testcase_60	AC	1 ms 4,376 KB
testcase_61	AC	2 ms 4,376 KB
testcase_62	AC	2 ms 4,376 KB
testcase_63	AC	5 ms 4,376 KB
testcase_64	AC	3 ms 4,380 KB
testcase_65	AC	4 ms 4,376 KB
testcase_66	AC	3 ms 4,376 KB
testcase_67	AC	2 ms 4,376 KB
testcase_68	AC	3 ms 4,376 KB
testcase_69	AC	3 ms 4,380 KB
testcase_70	AC	3 ms 4,376 KB
testcase_71	AC	2 ms 4,380 KB
testcase_72	AC	4 ms 4,376 KB
testcase_73	AC	3 ms 4,376 KB
testcase_74	AC	3 ms 4,376 KB
testcase_75	AC	3 ms 4,380 KB
testcase_76	AC	2 ms 4,376 KB
testcase_77	AC	3 ms 4,380 KB
testcase_78	AC	5 ms 4,380 KB
testcase_79	AC	4 ms 4,380 KB
testcase_80	AC	4 ms 4,376 KB
testcase_81	AC	5 ms 4,376 KB
testcase_82	AC	4 ms 4,376 KB
testcase_83	AC	40 ms 12,600 KB
testcase_84	AC	37 ms 12,304 KB
testcase_85	AC	22 ms 9,276 KB
testcase_86	AC	30 ms 11,308 KB
testcase_87	AC	33 ms 12,128 KB
testcase_88	AC	6 ms 4,780 KB
testcase_89	AC	39 ms 12,576 KB
testcase_90	AC	24 ms 9,320 KB
testcase_91	AC	19 ms 8,136 KB
testcase_92	AC	10 ms 5,940 KB
testcase_93	AC	34 ms 10,716 KB
testcase_94	AC	30 ms 10,028 KB
testcase_95	AC	29 ms 10,044 KB
testcase_96	AC	34 ms 12,116 KB
testcase_97	AC	17 ms 7,388 KB
testcase_98	AC	35 ms 12,196 KB
testcase_99	AC	22 ms 8,792 KB
testcase_100	AC	35 ms 12,740 KB
testcase_101	AC	10 ms 5,752 KB
testcase_102	AC	5 ms 4,544 KB
testcase_103	AC	11 ms 5,876 KB
testcase_104	AC	14 ms 6,796 KB
testcase_105	AC	28 ms 10,912 KB
testcase_106	AC	16 ms 7,772 KB
testcase_107	AC	40 ms 12,584 KB
testcase_108	AC	34 ms 12,448 KB
testcase_109	AC	30 ms 10,708 KB
testcase_110	AC	26 ms 9,988 KB
testcase_111	AC	29 ms 10,408 KB
testcase_112	AC	13 ms 6,752 KB
testcase_113	AC	26 ms 9,800 KB
testcase_114	AC	17 ms 7,616 KB
testcase_115	AC	7 ms 4,908 KB
testcase_116	AC	19 ms 8,260 KB
testcase_117	AC	14 ms 6,616 KB
testcase_118	AC	35 ms 11,984 KB
testcase_119	AC	20 ms 8,692 KB
testcase_120	AC	33 ms 11,768 KB
testcase_121	AC	12 ms 6,412 KB
testcase_122	AC	20 ms 8,240 KB
testcase_123	AC	2 ms 4,380 KB
testcase_124	AC	56 ms 18,152 KB
testcase_125	AC	56 ms 17,964 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) {
    using S = typename iterator_traits<It>::value_type;
    using T = conditional_t<is_signed_v<S>,i64,u64>;
    return accumulate(b,e,T{});
}
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<
// >>> union find
struct UnionFind {
    int n, sz; // id : 0...n-1
    vector<int> par;

    UnionFind(int n = 0) : n(n), sz(n), par(n,-1) { }
    int root(int x) {
        assert(0 <= x); assert(x < n);
        return par[x] < 0 ? x : par[x] = root(par[x]);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        sz--;
        if (par[x] < par[y]) swap(x,y);
        par[y] += par[x];
        par[x] = y;
        return true;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return -par[root(x)]; }
    int size() const { return sz; }
    struct groups_t {
        vector<vector<int> > grp;
        vector<pair<int,int> > id;
    };
    groups_t groups() {
        vector<vector<int> > g(n);
        rep (i,n) if (par[i] < 0) g[i].reserve(-par[i]);
        rep (i,n) g[root(i)].push_back(i);
        vector<vector<int> > grp; grp.reserve(size());
        rep (i,n) if (g[i].size()) grp.emplace_back(move(g[i]));
        vector<pair<int,int> > id(n);
        rep (i,grp.size()) rep (j,grp[i].size()) {
            id[grp[i][j]] = make_pair(i,j);
        }
        return { grp, id };
    }
};
// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> a(n),b(n);
    rep (i,n) cin >> a[i] >> b[i], a[i]--, b[i]--;

    struct edge { int to,id; };
    vector<vector<edge>> g(n);
    UnionFind uf(n);
    int id = -1;
    rep (i,n) {
        if (uf.unite(a[i],b[i])) {
            g[a[i]].pb({b[i],i});
            g[b[i]].pb({a[i],i});
        } else {
            id = i;
        }
    }

    vector<int> path = { id+1 };
    def (dfs, int x, int p) -> void {
        if (x == b[id]) {
            cout << path.size() << endl;
            cout << path << endl;
            exit(0);
        }
        for (auto [y,id] : g[x]) {
            if (y == p) continue;
            path.eb(id+1);
            dfs(y,x);
            path.pop_back();
        }
    };
    dfs(a[id],-1);
    assert(0);

}

yukicoder

結果

テストケース

ソースコード