結果

問題 No.1420 国勢調査 (Easy)
ユーザー haruki_Kharuki_K
提出日時 2021-03-05 22:05:19
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 51 ms / 2,000 ms
コード長 7,453 bytes
コンパイル時間 2,478 ms
コンパイル使用メモリ 206,132 KB
実行使用メモリ 5,760 KB
最終ジャッジ日時 2024-04-16 09:34:23
合計ジャッジ時間 5,550 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 33 ms
5,376 KB
testcase_03 AC 33 ms
5,376 KB
testcase_04 AC 34 ms
5,376 KB
testcase_05 AC 33 ms
5,376 KB
testcase_06 AC 33 ms
5,376 KB
testcase_07 AC 11 ms
5,376 KB
testcase_08 AC 24 ms
5,376 KB
testcase_09 AC 12 ms
5,376 KB
testcase_10 AC 24 ms
5,376 KB
testcase_11 AC 7 ms
5,376 KB
testcase_12 AC 5 ms
5,376 KB
testcase_13 AC 14 ms
5,504 KB
testcase_14 AC 6 ms
5,376 KB
testcase_15 AC 14 ms
5,760 KB
testcase_16 AC 14 ms
5,632 KB
testcase_17 AC 14 ms
5,632 KB
testcase_18 AC 14 ms
5,632 KB
testcase_19 AC 15 ms
5,760 KB
testcase_20 AC 15 ms
5,760 KB
testcase_21 AC 15 ms
5,760 KB
testcase_22 AC 49 ms
5,504 KB
testcase_23 AC 49 ms
5,632 KB
testcase_24 AC 51 ms
5,504 KB
testcase_25 AC 51 ms
5,632 KB
testcase_26 AC 50 ms
5,504 KB
testcase_27 AC 20 ms
5,376 KB
testcase_28 AC 19 ms
5,376 KB
testcase_29 AC 13 ms
5,376 KB
testcase_30 AC 21 ms
5,376 KB
testcase_31 AC 20 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> 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 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 rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
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, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) 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) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
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(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
vector<int> &operator--(vector<int> &v) { for (int &x : v) --x; return v; }
vector<int> &operator++(vector<int> &v) { for (int &x : v) ++x; return v; }
// <<<
// >>> weighted union find
template <class Group> struct WeightedUnionFind {
    using Value = typename Group::Value;
    static Value unit() { return Group::unit(); }
    static Value op(Value const& x, Value const& y) { return Group::op(x, y); }
    static Value inv(Value const& x) { return Group::inv(x); }

    int n, sz; // id : 0...n-1
    vector<int> par;
    vector<Value> val; // (value of par[x]) == val*(value of x)

    WeightedUnionFind(int n = 0) : n(n), sz(n), par(n, -1), val(n, unit()) { }
    int root(int x) {
        assert(0 <= x); assert(x < n);
        if (par[x] < 0) return x;
        int ret = root(par[x]);
        val[x] = op(val[par[x]], val[x]);
        return par[x] = ret;
    }

    // (value of y) == v*(value of x)
    bool unite(int x, int y, Value const& v) {
        int rx = root(x), ry = root(y);
        if (rx == ry) return diff(x, y) == v;
        Value w = op(op(val[y], v), inv(val[x]));
        sz--;
        if (par[rx] < par[ry]) swap(rx, ry), w = inv(w);
        par[ry] += par[rx];
        par[rx] = ry;
        val[rx] = w;
        return true;
    }

    // return (value of y)/(value of x)
    Value diff(int x, int y) {
        assert(same(x, y));
        return op(inv(val[y]), val[x]);
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return -par[root(x)]; }
    int size() const { return sz; }
    vector<vector<int>> 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]));
        return grp;
    }
};
// <<<

struct Group {
    using Value = int;
    static constexpr Value unit() { return 0; }
    static constexpr Value op(Value x, Value y) {
        return x^y;
    }
    static constexpr Value inv(Value x) {
        return x;
    }
};

int32_t main() {
    int n, m; cin >> n >> m;
    WeightedUnionFind<Group> uf(n);
    rep (i, m) {
        int a, b, y; cin >> a >> b >> y; --a, --b;
        if (not uf.unite(a, b, y)) quit(-1);
    }

    vector<int> x(n);
    rep (i, n) x[i] = uf.diff(uf.root(i), i);
    cout << x << '\n';


}
0