#626332 (C++17) No.1420 国勢調査 (Easy)

提出ソース

結果

問題	No.1420 国勢調査 (Easy)
ユーザー	👑 hitonanode
提出日時	2021-03-06 13:42:46
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	45 ms / 2,000 ms
コード長	6,121 bytes
コンパイル時間	2,490 ms
コンパイル使用メモリ	200,168 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-04-17 02:14:21
合計ジャッジ時間	5,261 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	29 ms 5,376 KB
testcase_03	AC	30 ms 5,376 KB
testcase_04	AC	30 ms 5,376 KB
testcase_05	AC	32 ms 5,376 KB
testcase_06	AC	30 ms 5,376 KB
testcase_07	AC	10 ms 5,376 KB
testcase_08	AC	24 ms 5,376 KB
testcase_09	AC	13 ms 5,376 KB
testcase_10	AC	23 ms 5,376 KB
testcase_11	AC	6 ms 5,376 KB
testcase_12	AC	4 ms 5,376 KB
testcase_13	AC	11 ms 5,376 KB
testcase_14	AC	5 ms 5,376 KB
testcase_15	AC	10 ms 5,376 KB
testcase_16	AC	10 ms 5,376 KB
testcase_17	AC	10 ms 5,376 KB
testcase_18	AC	10 ms 5,376 KB
testcase_19	AC	10 ms 5,376 KB
testcase_20	AC	11 ms 5,376 KB
testcase_21	AC	10 ms 5,376 KB
testcase_22	AC	44 ms 5,376 KB
testcase_23	AC	43 ms 5,376 KB
testcase_24	AC	43 ms 5,376 KB
testcase_25	AC	45 ms 5,376 KB
testcase_26	AC	44 ms 5,376 KB
testcase_27	AC	17 ms 5,376 KB
testcase_28	AC	17 ms 5,376 KB
testcase_29	AC	10 ms 5,376 KB
testcase_30	AC	18 ms 5,376 KB
testcase_31	AC	18 ms 5,376 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

void bad() {
    puts("-1");
    exit(0);
}

// UnionFind Tree (0-indexed), based on size of each disjoint set
struct UnionFind {
    std::vector<int> par, cou;
    UnionFind(int N = 0) : par(N), cou(N, 1) { iota(par.begin(), par.end(), 0); }
    int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
    bool unite(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return false;
        if (cou[x] < cou[y]) std::swap(x, y);
        par[y] = x, cou[x] += cou[y];
        return true;
    }
    int count(int x) { return cou[find(x)]; }
    bool same(int x, int y) { return find(x) == find(y); }
};


// Weighted UnionFind
template <typename T> struct WeightedUnionFind {
    std::vector<int> par, sz;
    std::vector<T> pot;
    WeightedUnionFind(int N = 0) : par(N), sz(N, 1), pot(N) { std::iota(par.begin(), par.end(), 0); }
    int find(int x) {
        if (par[x] != x) {
            int r = find(par[x]);
            pot[x] = pot[x] ^ pot[par[x]], par[x] = r;
        }
        return par[x];
    }
    bool unite(int s, int t, T rel_diff) {
        // Relate s and t by t = s + rel_diff
        // Return false iff contradiction happens.
        rel_diff = rel_diff ^ weight(s) ^ weight(t);
        if ((s = find(s)) == (t = find(t))) return rel_diff == 0;
        if (sz[s] < sz[t]) std::swap(s, t);
        par[t] = s, sz[s] ^= sz[t], pot[t] = rel_diff;
        return true;
    }
    T weight(int x) {
        find(x);
        return pot[x];
    }
    T diff(int s, int t) { return weight(t) ^ weight(s); }
    int count(int x) { return sz[find(x)]; }
    bool same(int s, int t) { return find(s) == find(t); }
};


int main() {
    int N, M;
    cin >> N >> M;
    vector<int> ret(N);

    WeightedUnionFind<int> uf(N);
    while (M--) {
        int a, b, y;
        cin >> a >> b >> y;
        a--, b--;
        if (!uf.unite(a, b, y)) bad();
    }
    REP(i, N) cout << uf.weight(i) << '\n';
}

yukicoder

結果

テストケース

ソースコード