結果
問題 | No.1002 Twotone |
ユーザー | risujiroh |
提出日時 | 2020-02-28 23:31:29 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,964 ms / 5,000 ms |
コード長 | 2,953 bytes |
コンパイル時間 | 2,390 ms |
コンパイル使用メモリ | 193,040 KB |
実行使用メモリ | 72,776 KB |
最終ジャッジ日時 | 2024-04-21 20:56:09 |
合計ジャッジ時間 | 35,939 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 591 ms
33,304 KB |
testcase_04 | AC | 794 ms
42,076 KB |
testcase_05 | AC | 785 ms
42,076 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 596 ms
26,684 KB |
testcase_08 | AC | 1,329 ms
42,204 KB |
testcase_09 | AC | 1,470 ms
42,076 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 1,431 ms
33,444 KB |
testcase_12 | AC | 1,970 ms
41,984 KB |
testcase_13 | AC | 2,013 ms
41,852 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 930 ms
25,292 KB |
testcase_16 | AC | 2,012 ms
41,852 KB |
testcase_17 | AC | 1,971 ms
41,984 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 1,212 ms
41,372 KB |
testcase_20 | AC | 1,437 ms
51,512 KB |
testcase_21 | AC | 1,459 ms
51,036 KB |
testcase_22 | AC | 3 ms
6,940 KB |
testcase_23 | AC | 1,557 ms
43,348 KB |
testcase_24 | AC | 2,964 ms
67,280 KB |
testcase_25 | AC | 2,910 ms
67,132 KB |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | AC | 217 ms
30,076 KB |
testcase_28 | AC | 490 ms
43,064 KB |
testcase_29 | AC | 371 ms
42,936 KB |
testcase_30 | AC | 1 ms
6,944 KB |
testcase_31 | AC | 359 ms
42,784 KB |
testcase_32 | AC | 500 ms
42,932 KB |
testcase_33 | AC | 394 ms
42,936 KB |
testcase_34 | AC | 1,917 ms
72,776 KB |
ソースコード
#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, vector<int> cs) -> void { if (cs.size() == 1) { ++mp1[cs[0]]; } else if (cs.size() == 2) { ++mp2[{cs[0], cs[1]}]; } else { assert(false); } for (int u : g[v]) { if (be[u] and u != p) { auto ncs = cs; ncs.push_back((col[{v, u}])); sort(begin(ncs), end(ncs)); ncs.erase(unique(begin(ncs), end(ncs)), end(ncs)); if (ncs.size() >= 3) { continue; } self(self, u, v, ncs); } } }; 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}]}); long long s1 = 0; for (auto e : mp1) { res += (long long)e.second * e.second; s1 += e.second; } res -= s1 * s1; for (auto e : mp2) { res += 2 * e.second; res -= 2 * (long long)(mp1[e.first.first] + mp1[e.first.second]) * e.second; res -= (long long)e.second * e.second; } for (auto e : mp1) { smp1[e.first] += e.second; } for (auto e : mp2) { smp2[e.first] += e.second; } } } long long s1 = 0; for (auto e : smp1) { res -= (long long)e.second * e.second; s1 += e.second; } res += s1 * s1; for (auto e : smp2) { res += 2 * (long long)(smp1[e.first.first] + smp1[e.first.second]) * e.second; res += (long long)e.second * e.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'; }