結果
問題 | No.1420 国勢調査 (Easy) |
ユーザー | fastmath |
提出日時 | 2021-03-05 22:36:58 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 542 ms / 2,000 ms |
コード長 | 3,726 bytes |
コンパイル時間 | 1,376 ms |
コンパイル使用メモリ | 133,548 KB |
実行使用メモリ | 20,548 KB |
最終ジャッジ日時 | 2024-04-16 10:23:10 |
合計ジャッジ時間 | 8,684 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
6,144 KB |
testcase_01 | AC | 3 ms
6,016 KB |
testcase_02 | AC | 130 ms
11,208 KB |
testcase_03 | AC | 130 ms
11,088 KB |
testcase_04 | AC | 129 ms
10,956 KB |
testcase_05 | AC | 132 ms
11,096 KB |
testcase_06 | AC | 132 ms
11,164 KB |
testcase_07 | AC | 62 ms
11,588 KB |
testcase_08 | AC | 50 ms
10,780 KB |
testcase_09 | AC | 43 ms
10,736 KB |
testcase_10 | AC | 44 ms
10,688 KB |
testcase_11 | AC | 44 ms
10,564 KB |
testcase_12 | AC | 16 ms
9,216 KB |
testcase_13 | AC | 104 ms
11,392 KB |
testcase_14 | AC | 12 ms
8,320 KB |
testcase_15 | AC | 108 ms
11,136 KB |
testcase_16 | AC | 101 ms
11,136 KB |
testcase_17 | AC | 103 ms
11,264 KB |
testcase_18 | AC | 102 ms
11,392 KB |
testcase_19 | AC | 101 ms
11,392 KB |
testcase_20 | AC | 110 ms
11,136 KB |
testcase_21 | AC | 105 ms
11,264 KB |
testcase_22 | AC | 523 ms
20,480 KB |
testcase_23 | AC | 542 ms
20,424 KB |
testcase_24 | AC | 514 ms
20,352 KB |
testcase_25 | AC | 513 ms
20,352 KB |
testcase_26 | AC | 521 ms
20,548 KB |
testcase_27 | AC | 64 ms
12,928 KB |
testcase_28 | AC | 64 ms
12,672 KB |
testcase_29 | AC | 62 ms
12,928 KB |
testcase_30 | AC | 64 ms
12,800 KB |
testcase_31 | AC | 63 ms
12,928 KB |
ソースコード
#include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <ctime> #include <cassert> #include <complex> #include <string> #include <cstring> #include <chrono> #include <random> #include <bitset> #include <fstream> using namespace std; #define int long long #define ii pair <int, int> #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define x first #define y second #define Time (double)clock()/CLOCKS_PER_SEC #define debug(x) std::cerr << #x << ": " << x << '\n'; #define FOR(i, n) for (int i = 0; i < n; ++i) #define pb push_back #define trav(a, x) for (auto& a : x) using vi = vector<int>; template <typename T> std::ostream& operator <<(std::ostream& output, const pair <T, T> & data) { output << "(" << data.x << "," << data.y << ")"; return output; } template <typename T> std::ostream& operator <<(std::ostream& output, const std::vector<T>& data) { for (const T& x : data) output << x << " "; return output; } ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down ll math_mod(ll a, ll b) { return a - b * div_down(a, b); } #define tcT template<class T #define tcTU tcT, class U tcT> using V = vector<T>; tcT> void re(V<T>& x) { trav(a, x) cin >> a; } tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ll gcd(ll a, ll b) { while (b) { tie(a, b) = mp(b, a % b); } return a; } const int N = 1e5+7; int n, m; int a[N], b[N], sum[N]; vi g[N]; int comp[N]; bool used[N]; int col[N]; void dfs(int u, int c) { comp[u] = c; used[u] = 1; trav (v, g[u]) if (!used[v]) dfs(v, c); } void color(int u) { used[u] = 1; trav (v, g[u]) { if (!used[v]) { col[v] = col[u] ^ 1; color(v); } } } int ans[N]; signed main() { #ifdef ONLINE_JUDGE #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif cin >> n >> m; FOR (i, m) { cin >> a[i] >> b[i] >> sum[i]; } FOR (bit, 30) { for (int i = 1; i <= n; ++i) g[i].clear(); FOR (i, m) { if ((sum[i] >> bit) & 1) { } else { g[a[i]].app(b[i]); g[b[i]].app(a[i]); } } memset(used, 0, sizeof used); int p = 0; for (int i = 1; i <= n; ++i) { if (!used[i]) { dfs(i, p); p++; } } FOR (i, p) g[i].clear(); FOR (i, m) { if ((sum[i] >> bit) & 1) { int u = comp[a[i]], v = comp[b[i]]; g[u].app(v); g[v].app(u); } } memset(used, 0, sizeof used); FOR (i, p) { if (!used[i]) { color(i); } } FOR (i, m) { if ((sum[i] >> bit) & 1) { int u = comp[a[i]], v = comp[b[i]]; if (col[u] == col[v]) { cout << -1 << endl; exit(0); } } } for (int i = 1; i <= n; ++i) { if (col[comp[i]]) { ans[i] += 1ll << bit; } } } for (int i = 1; i <= n; ++i) { cout << ans[i] << endl; } }