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

• 問題: No.1420 国勢調査 (Easy)
• ユーザー: rniya
• 提出日時: 2021-03-05 22:02:32
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 72 ms / 2,000 ms
• コード長: 4,981 bytes
• コンパイル時間: 2,225 ms
• コンパイル使用メモリ: 212,744 KB
• 実行使用メモリ: 16,384 KB
• 最終ジャッジ日時: 2024-10-07 01:55:43
• 合計ジャッジ時間: 5,653 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	61 ms; 16,380 KB
testcase_03	AC	64 ms; 16,256 KB
testcase_04	AC	59 ms; 16,256 KB
testcase_05	AC	58 ms; 16,384 KB
testcase_06	AC	61 ms; 16,372 KB
testcase_07	AC	39 ms; 10,880 KB
testcase_08	AC	46 ms; 14,592 KB
testcase_09	AC	41 ms; 12,288 KB
testcase_10	AC	44 ms; 13,952 KB
testcase_11	AC	35 ms; 8,064 KB
testcase_12	AC	7 ms; 6,784 KB
testcase_13	AC	14 ms; 6,528 KB
testcase_14	AC	8 ms; 6,784 KB
testcase_15	AC	14 ms; 6,528 KB
testcase_16	AC	14 ms; 6,400 KB
testcase_17	AC	14 ms; 6,656 KB
testcase_18	AC	15 ms; 6,528 KB
testcase_19	AC	15 ms; 6,656 KB
testcase_20	AC	15 ms; 6,528 KB
testcase_21	AC	16 ms; 6,528 KB
testcase_22	AC	72 ms; 13,476 KB
testcase_23	AC	67 ms; 13,696 KB
testcase_24	AC	69 ms; 13,568 KB
testcase_25	AC	68 ms; 13,568 KB
testcase_26	AC	67 ms; 13,568 KB
testcase_27	AC	47 ms; 10,368 KB
testcase_28	AC	54 ms; 10,368 KB
testcase_29	AC	46 ms; 10,240 KB
testcase_30	AC	45 ms; 10,368 KB
testcase_31	AC	48 ms; 10,240 KB

ソースコード

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    vector<vector<tuple<int, int, int>>> G(N);
    for (int i = 0; i < M; i++) {
        int A, B, Y;
        cin >> A >> B >> Y;
        A--, B--;
        G[A].emplace_back(B, Y, i);
        G[B].emplace_back(A, Y, i);
    }

    vector<bool> seen(M, false);
    vector<int> ans(N, -1);
    auto dfs = [&](auto self, int v) -> void {
        for (auto& e : G[v]) {
            int u, y, idx;
            tie(u, y, idx) = e;
            if (seen[idx]) continue;
            seen[idx] = true;
            if (ans[u] < 0) {
                ans[u] = ans[v] ^ y;
            } else if ((ans[u] ^ ans[v]) != y) {
                cout << -1 << '\n';
                exit(0);
            }
            self(self, u);
        }
    };

    for (int i = 0; i < N; i++) {
        if (ans[i] < 0) {
            ans[i] = 0;
            dfs(dfs, i);
        }
    }

    for (int& x : ans) cout << x << '\n';
    return 0;
}