結果
問題 | No.1002 Twotone |
ユーザー | risujiroh |
提出日時 | 2020-02-28 22:06:00 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,619 bytes |
コンパイル時間 | 2,497 ms |
コンパイル使用メモリ | 193,924 KB |
実行使用メモリ | 81,488 KB |
最終ジャッジ日時 | 2024-04-21 19:01:26 |
合計ジャッジ時間 | 49,382 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 745 ms
33,296 KB |
testcase_04 | AC | 1,000 ms
42,072 KB |
testcase_05 | AC | 1,011 ms
42,076 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 741 ms
26,752 KB |
testcase_08 | AC | 1,403 ms
42,072 KB |
testcase_09 | AC | 1,418 ms
42,072 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 1,730 ms
33,312 KB |
testcase_12 | AC | 2,405 ms
42,108 KB |
testcase_13 | AC | 2,424 ms
41,856 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 1,230 ms
25,344 KB |
testcase_16 | AC | 2,524 ms
41,980 KB |
testcase_17 | AC | 3,190 ms
41,980 KB |
testcase_18 | AC | 3 ms
5,376 KB |
testcase_19 | AC | 1,509 ms
41,500 KB |
testcase_20 | AC | 1,869 ms
51,464 KB |
testcase_21 | AC | 1,774 ms
51,032 KB |
testcase_22 | AC | 3 ms
5,376 KB |
testcase_23 | AC | 2,167 ms
52,056 KB |
testcase_24 | AC | 4,110 ms
81,488 KB |
testcase_25 | AC | 4,178 ms
81,344 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 293 ms
30,076 KB |
testcase_28 | AC | 663 ms
42,932 KB |
testcase_29 | AC | 515 ms
43,064 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 453 ms
42,784 KB |
testcase_32 | AC | 693 ms
43,060 KB |
testcase_33 | AC | 510 ms
42,928 KB |
testcase_34 | TLE | - |
ソースコード
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n, k; cin >> n >> k; vector<vector<int>> g(n); map<pair<int, int>, int> col; for (int _ = n - 1; _--; ) { int u, v, c; cin >> u >> v >> c; --u, --v, --c; g[u].push_back(v); g[v].push_back(u); col[{u, v}] = col[{v, u}] = c; } vector<bool> be(n, true); vector<int> sz(n), par(n); auto centroid = [&](int r) { vector<int> vs; auto dfs = [&](auto&& self, int v, int p) -> void { vs.push_back(v); par[v] = p; sz[v] = 1; for (int u : g[v]) { if (be[u] and u != p) { self(self, u, v); sz[v] += sz[u]; } } }; dfs(dfs, r, -1); for (int v : vs) { bool ok = vs.size() - sz[v] <= vs.size() / 2; for (int u : g[v]) { if (be[u] and u != par[v]) { if (sz[u] > (int)vs.size() / 2) { ok = false; break; } } } if (ok) { return v; } } return -1; }; long long res = 0; map<int, int> mp1; map<pair<int, int>, int> mp2; auto dfs = [&](auto&& self, int v, int p, set<int> se) -> void { if (se.size() == 1) { ++mp1[*begin(se)]; } else if (se.size() == 2) { ++mp2[{*begin(se), *next(begin(se))}]; } else { assert(false); } for (int u : g[v]) { if (be[u] and u != p) { auto nse = se; nse.insert(col[{v, u}]); if (nse.size() >= 3) { continue; } self(self, u, v, nse); } } }; auto rec = [&](auto&& self, int c) -> void { c = centroid(c); map<int, int> smp1; map<pair<int, int>, int> smp2; for (int v : g[c]) { if (be[v]) { mp1.clear(), mp2.clear(); dfs(dfs, v, c, {col[{c, v}]}); for (auto e : mp1) { for (auto f : mp1) { if (e.first != f.first) { res -= (long long)e.second * f.second; } } for (auto f : mp2) { if (e.first == f.first.first or e.first == f.first.second) { res -= (long long)e.second * f.second; } } } for (auto e : mp2) { res += 2 * e.second; for (auto f : mp1) { if (e.first.first == f.first or e.first.second == f.first) { res -= (long long)e.second * f.second; } } for (auto f : mp2) { if (e.first == f.first) { res -= (long long)e.second * f.second; } } } for (auto e : mp1) { smp1[e.first] += e.second; } for (auto e : mp2) { smp2[e.first] += e.second; } } } for (auto e : smp1) { for (auto f : smp1) { if (e.first != f.first) { res += (long long)e.second * f.second; } } for (auto f : smp2) { if (e.first == f.first.first or e.first == f.first.second) { res += (long long)e.second * f.second; } } } for (auto e : smp2) { for (auto f : smp1) { if (e.first.first == f.first or e.first.second == f.first) { res += (long long)e.second * f.second; } } for (auto f : smp2) { if (e.first == f.first) { res += (long long)e.second * f.second; } } } be[c] = false; for (int u : g[c]) { if (be[u]) { self(self, u); } } be[c] = true; }; rec(rec, 0); res /= 2; cout << res << '\n'; }