結果
| 問題 | No.1002 Twotone |
| ユーザー |
👑  hitonanode
|
| 提出日時 | 2020-02-28 22:56:31 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 7,586 bytes |
| コンパイル時間 | 2,673 ms |
| コンパイル使用メモリ | 194,848 KB |
| 実行使用メモリ | 56,700 KB |
| 最終ジャッジ日時 | 2024-04-21 20:07:16 |
| 合計ジャッジ時間 | 35,826 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 1 ms
5,376 KB |
| testcase_03 | AC | 1,012 ms
33,348 KB |
| testcase_04 | AC | 1,376 ms
42,620 KB |
| testcase_05 | AC | 1,439 ms
42,488 KB |
| testcase_06 | AC | 2 ms
5,376 KB |
| testcase_07 | AC | 748 ms
27,164 KB |
| testcase_08 | AC | 1,266 ms
42,620 KB |
| testcase_09 | AC | 1,254 ms
42,556 KB |
| testcase_10 | AC | 2 ms
5,376 KB |
| testcase_11 | AC | 1,312 ms
33,688 KB |
| testcase_12 | AC | 2,169 ms
42,752 KB |
| testcase_13 | AC | 2,152 ms
42,744 KB |
| testcase_14 | AC | 2 ms
5,376 KB |
| testcase_15 | AC | 802 ms
25,720 KB |
| testcase_16 | AC | 1,663 ms
42,236 KB |
| testcase_17 | AC | 1,650 ms
42,368 KB |
| testcase_18 | AC | 3 ms
5,376 KB |
| testcase_19 | AC | 1,247 ms
45,228 KB |
| testcase_20 | AC | 1,388 ms
56,700 KB |
| testcase_21 | AC | 1,367 ms
56,060 KB |
| testcase_22 | AC | 2 ms
5,376 KB |
| testcase_23 | AC | 1,048 ms
34,208 KB |
| testcase_24 | AC | 1,802 ms
54,140 KB |
| testcase_25 | AC | 1,750 ms
52,348 KB |
| testcase_26 | AC | 2 ms
5,376 KB |
| testcase_27 | TLE | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#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> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
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> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
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> ostream &operator<<(ostream &os, const unordered_set<T> &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> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
vector<vector<int>> edge;
vector<int> color;
vector<pint> uv;
lint ret;
struct Tree
{
int NO_PARENT = -1;
using pint = std::pair<int, int>;
int V;
int E;
std::vector<std::set<pint>> to; // (node_id, edge_id)
std::vector<int> par; // parent node_id par[root] = -1
std::vector<std::vector<int>> chi; // children id's
std::vector<int> subtree_size; // size of each subtree
std::vector<int> available_edge; // If 0, ignore the corresponding edge.
Tree() : Tree(0) {}
Tree(int v) : V(v), E(0), to(v), par(v, NO_PARENT), chi(v), subtree_size(v) {}
std::vector<int> color;
void add_edge(int v1, int v2, int c)
{
to[v1].emplace(v2, E);
to[v2].emplace(v1, E);
color.emplace_back(c);
E++;
available_edge.emplace_back(1);
}
int _dfs_fixroot(int now, int prv)
{
chi[now].clear();
subtree_size[now] = 1;
for (auto nxt : to[now]) {
if (nxt.first != prv and available_edge[nxt.second]) {
par[nxt.first] = now;
chi[now].push_back(nxt.first);
subtree_size[now] += _dfs_fixroot(nxt.first, now);
}
}
return subtree_size[now];
}
void fix_root(int root) {
par[root] = NO_PARENT;
_dfs_fixroot(root, -1);
}
//// Centroid Decpmposition ////
std::vector<int> centroid_cand_tmp;
void _dfs_detect_centroids(int now, int prv, int n)
{
bool is_centroid = true;
for (auto nxt : to[now])
{
if (nxt.first != prv and available_edge[nxt.second])
{
_dfs_detect_centroids(nxt.first, now, n);
if (subtree_size[nxt.first] > n / 2) is_centroid = false;
}
}
if (n - subtree_size[now] > n / 2) is_centroid = false;
if (is_centroid) centroid_cand_tmp.push_back(now);
}
pint detect_centroids(int r) // ([centroid_node_id1], ([centroid_node_id2]|-1))
{
centroid_cand_tmp.clear();
while (par[r] != NO_PARENT) r = par[r];
int n = subtree_size[r];
_dfs_detect_centroids(r, -1, n);
if (centroid_cand_tmp.size() == 1) return std::make_pair(centroid_cand_tmp[0], -1);
else return std::make_pair(centroid_cand_tmp[0], centroid_cand_tmp[1]);
}
lint ret;
unordered_map<int, int> mp;
void cddfs(int now, int prv, int c1, int c2) {
for (auto p : to[now]) {
int nxt = p.first, eid = p.second;
if (nxt == prv or available_edge[eid] == 0) continue;
int c = color[eid];
int c2new = c2;
if (c2 >= 0 and c != c2 and c != c1) continue;
if (c != c1) c2new = c;
mp[c2new]++;
cddfs(nxt, now, c1, c2new);
}
}
void centroid_decomposition(int now) {
fix_root(now);
pint p = detect_centroids(now);
int s = p.first, t = p.second, steid = -1;
if (t < 0) {
fix_root(s);
int maxi_size = 0;
for (auto p : to[s]) {
int nxt, eid;
std::tie(nxt, eid) = p;
// if (available_edge[eid] == 0) continue;
if (mmax(maxi_size, subtree_size[nxt]))
{
t = nxt, steid = eid;
}
}
}
else {
for (auto p : to[s]) {
if (p.first == t) steid = p.second;
}
}
if (t < 0) return;
to[s].erase(pint(t, steid));
to[t].erase(pint(s, steid));
mp.clear();
mp[-1] = 1;
cddfs(s, t, color[steid], -1);
unordered_map<int, int> mps = mp;
mp.clear();
mp[-1] = 1;
cddfs(t, s, color[steid], -1);
lint nb_mps_0 = mps[-1];
for (auto p : mp) {
if (p.first >= 0 and mps.count(p.first)) ret += 1LL * p.second * mps[p.first];
if (p.first >= 0) ret += 1LL * p.second * nb_mps_0;
}
lint nb_mp_0 = mp[-1];
for (auto p : mps) {
if (p.first >= 0) ret += nb_mp_0 * p.second;
}
centroid_decomposition(s);
centroid_decomposition(t);
}
};
int main()
{
int N, K;
cin >> N >> K;
Tree tree(N);
REP(e, N - 1) {
int u, v, c;
cin >> u >> v >> c;
tree.add_edge(u - 1, v - 1, c);
}
tree.ret = 0;
tree.centroid_decomposition(0);
cout << tree.ret << endl;
}