結果
| 問題 |
No.3194 Do Optimize Your Solution
|
| ユーザー |
👑  hos.lyric
|
| 提出日時 | 2025-06-28 00:18:22 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2,975 ms / 3,000 ms |
| コード長 | 15,606 bytes |
| コンパイル時間 | 2,548 ms |
| コンパイル使用メモリ | 157,992 KB |
| 実行使用メモリ | 457,156 KB |
| 最終ジャッジ日時 | 2025-06-28 00:19:06 |
| 合計ジャッジ時間 | 43,495 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 17 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:429:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
429 | scanf("%d%d", &A[h][i], &B[h][i]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
from main.cpp:9:
In function ‘typename __gnu_cxx::__enable_if<std::__is_scalar<_Tp>::__value, void>::__type std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’,
inlined from ‘void std::__fill_a1(__gnu_cxx::__normal_iterator<_Iterator, _Container>, __gnu_cxx::__normal_iterator<_Iterator, _Container>, const _Tp&) [with _Ite = int*; _Cont = vector<int>; _Tp = int]’ at /usr/include/c++/13/bits/stl_algobase.h:960:21,
inlined from ‘void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Tp = int]’ at /usr/include/c++/13/bits/stl_algobase.h:977:21,
inlined from ‘void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = __gnu_cxx::__normal_iterator<int*, vector<int> >; _Tp = int]’ at /usr/include/c++/13/bits/stl_algobase.h:1007:20,
inlined from ‘int main()’ at main.cpp:482:11:
/usr/include/c++/13/bits/stl_algobase.h:931:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound between 18446744065119617024 and 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=]
931 | *__first = __tmp;
| ~~~~~~~~~^~~~~~~
ソースコード
// O(N log(N)) time no tsumori desu
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using Int = long long;
template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")
// build: O(n log(n)) time/space
// operator(): O(1) time
struct Lca {
int n, rt;
vector<vector<int>> graph;
vector<int> par, dep, su;
int usLen;
vector<int> us;
vector<int> buffer;
vector<int *> mn;
Lca() : n(0), rt(-1), usLen(0) {}
explicit Lca(int n_) : n(n_), rt(-1), graph(n), usLen(0) {}
void ae(int u, int v) {
assert(0 <= u); assert(u < n);
assert(0 <= v); assert(v < n);
graph[u].push_back(v);
graph[v].push_back(u);
}
void dfs(int u, int p) {
us[su[u] = usLen++] = u;
for (const int v : graph[u]) if (p != v) {
par[v] = u;
dep[v] = dep[u] + 1;
dfs(v, u);
us[usLen++] = u;
}
}
void build(int rt_) {
assert(0 <= rt_); assert(rt_ < n);
rt = rt_;
par.assign(n, -1);
dep.assign(n, -1);
su.assign(n, -1);
usLen = 0;
us.assign(2 * n - 1, -1);
dep[rt] = 0;
dfs(rt, -1);
assert(usLen == 2 * n - 1);
const int l = (31 - __builtin_clz(usLen)) + 1;
buffer.resize(l * usLen);
mn.resize(l);
for (int e = 0; e < l; ++e) mn[e] = buffer.data() + e * usLen;
for (int j = 0; j < usLen; ++j) mn[0][j] = us[j];
for (int e = 0; e < l - 1; ++e) for (int i = 0; i + (1 << (e + 1)) <= usLen; ++i) {
mn[e + 1][i] = shallower(mn[e][i], mn[e][i + (1 << e)]);
}
}
int shallower(int u, int v) const {
return (dep[u] <= dep[v]) ? u : v;
}
int operator()(int u, int v) const {
int j0 = su[u], j1 = su[v];
if (j0 > j1) swap(j0, j1);
++j1;
const int e = 31 - __builtin_clz(j1 - j0);
return shallower(mn[e][j0], mn[e][j1 - (1 << e)]);
}
int dist(int u, int v) const {
return dep[u] + dep[v] - 2 * dep[operator()(u, v)];
}
};
////////////////////////////////////////////////////////////////////////////////
struct Hld {
int n, rt;
// needs to be tree
// vertex lists
// modified in build(rt) (parent removed, heavy child first)
vector<vector<int>> graph;
vector<int> sz, par, dep;
int zeit;
vector<int> dis, fin, sid;
// head vertex (minimum depth) in heavy path
vector<int> head;
Hld() : n(0), rt(-1), zeit(0) {}
explicit Hld(int n_) : n(n_), rt(-1), graph(n), zeit(0) {}
void ae(int u, int v) {
assert(0 <= u); assert(u < n);
assert(0 <= v); assert(v < n);
graph[u].push_back(v);
graph[v].push_back(u);
}
void dfsSz(int u) {
sz[u] = 1;
for (const int v : graph[u]) {
auto it = std::find(graph[v].begin(), graph[v].end(), u);
if (it != graph[v].end()) graph[v].erase(it);
par[v] = u;
dep[v] = dep[u] + 1;
dfsSz(v);
sz[u] += sz[v];
}
}
void dfsHld(int u) {
dis[u] = zeit++;
const int deg = graph[u].size();
if (deg > 0) {
int vm = graph[u][0];
int jm = 0;
for (int j = 1; j < deg; ++j) {
const int v = graph[u][j];
if (sz[vm] < sz[v]) {
vm = v;
jm = j;
}
}
swap(graph[u][0], graph[u][jm]);
head[vm] = head[u];
dfsHld(vm);
for (int j = 1; j < deg; ++j) {
const int v = graph[u][j];
head[v] = v;
dfsHld(v);
}
}
fin[u] = zeit;
}
void build(int rt_) {
assert(0 <= rt_); assert(rt_ < n);
rt = rt_;
sz.assign(n, 0);
par.assign(n, -1);
dep.assign(n, -1);
dep[rt] = 0;
dfsSz(rt);
zeit = 0;
dis.assign(n, -1);
fin.assign(n, -1);
head.assign(n, -1);
head[rt] = rt;
dfsHld(rt);
assert(zeit == n);
sid.assign(n, -1);
for (int u = 0; u < n; ++u) sid[dis[u]] = u;
}
friend ostream &operator<<(ostream &os, const Hld &hld) {
const int maxDep = *max_element(hld.dep.begin(), hld.dep.end());
vector<string> ss(2 * maxDep + 1);
int pos = 0, maxPos = 0;
for (int j = 0; j < hld.n; ++j) {
const int u = hld.sid[j];
const int d = hld.dep[u];
if (hld.head[u] == u) {
if (j != 0) {
pos = maxPos + 1;
ss[2 * d - 1].resize(pos, '-');
ss[2 * d - 1] += '+';
}
} else {
ss[2 * d - 1].resize(pos, ' ');
ss[2 * d - 1] += '|';
}
ss[2 * d].resize(pos, ' ');
ss[2 * d] += std::to_string(u);
if (maxPos < static_cast<int>(ss[2 * d].size())) {
maxPos = ss[2 * d].size();
}
}
for (int d = 0; d <= 2 * maxDep; ++d) os << ss[d] << '\n';
return os;
}
bool contains(int u, int v) const {
return (dis[u] <= dis[v] && dis[v] < fin[u]);
}
int lca(int u, int v) const {
assert(0 <= u); assert(u < n);
assert(0 <= v); assert(v < n);
for (; head[u] != head[v]; ) (dis[u] > dis[v]) ? (u = par[head[u]]) : (v = par[head[v]]);
return (dis[u] > dis[v]) ? v : u;
}
int jumpUp(int u, int d) const {
assert(0 <= u); assert(u < n);
assert(d >= 0);
if (dep[u] < d) return -1;
const int tar = dep[u] - d;
for (u = head[u]; ; u = head[par[u]]) {
if (dep[u] <= tar) return sid[dis[u] + (tar - dep[u])];
}
}
int jump(int u, int v, int d) const {
assert(0 <= u); assert(u < n);
assert(0 <= v); assert(v < n);
assert(d >= 0);
const int l = lca(u, v);
const int du = dep[u] - dep[l], dv = dep[v] - dep[l];
if (d <= du) {
return jumpUp(u, d);
} else if (d <= du + dv) {
return jumpUp(v, du + dv - d);
} else {
return -1;
}
}
// [u, v) or [u, v]
template <class F> void doPathUp(int u, int v, bool inclusive, F f) const {
assert(contains(v, u));
for (; head[u] != head[v]; u = par[head[u]]) f(dis[head[u]], dis[u] + 1);
if (inclusive) {
f(dis[v], dis[u] + 1);
} else {
if (v != u) f(dis[v] + 1, dis[u] + 1);
}
}
// not path order, include lca(u, v) or not
template <class F> void doPath(int u, int v, bool inclusive, F f) const {
const int l = lca(u, v);
doPathUp(u, l, false, f);
doPathUp(v, l, inclusive, f);
}
// (vs, ps): compressed tree
// vs: DFS order (sorted by dis)
// vs[ps[x]]: the parent of vs[x]
// ids[vs[x]] = x, not set for non-tree vertex
vector<int> ids;
pair<vector<int>, vector<int>> compress(vector<int> us) {
// O(n) first time
ids.resize(n, -1);
std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
return (dis[u] < dis[v]);
});
us.erase(std::unique(us.begin(), us.end()), us.end());
int usLen = us.size();
assert(usLen >= 1);
for (int x = 1; x < usLen; ++x) us.push_back(lca(us[x - 1], us[x]));
std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
return (dis[u] < dis[v]);
});
us.erase(std::unique(us.begin(), us.end()), us.end());
usLen = us.size();
for (int x = 0; x < usLen; ++x) ids[us[x]] = x;
vector<int> ps(usLen, -1);
for (int x = 1; x < usLen; ++x) ps[x] = ids[lca(us[x - 1], us[x])];
return make_pair(us, ps);
}
// matomete sort
// O(N + \sum |us|)
vector<pair<vector<int>, vector<int>>> compress(const vector<vector<int>> &uss, const Lca &lcaFast) {
const int len = uss.size();
vector<int> freq(len, 0);
for (int q = 0; q < len; ++q) for (const int u : uss[q]) ++freq[u];
vector<vector<int>> qss(n);
for (int u = 0; u < n; ++u) qss[u].reserve(freq[u]);
for (int q = 0; q < len; ++q) for (const int u : uss[q]) qss[u].push_back(q);
vector<vector<int>> vss(len);
for (int q = 0; q < len; ++q) vss[q].reserve(uss[q].size());
for (const int u : sid) for (const int q : qss[u]) vss[q].push_back(u);
for (int q = 0; q < len; ++q) {
const int nn = vss[q].size();
vss[q].reserve(2 * nn - 1);
for (int x = 1; x < nn; ++x) vss[q].push_back(lcaFast(vss[q][x - 1], vss[q][x]));
}
fill(freq.begin(), freq.end(), 0);
for (int q = 0; q < len; ++q) for (const int u : uss[q]) ++freq[u];
for (int u = 0; u < n; ++u) { qss[u].clear(); qss[u].reserve(freq[u]); }
for (int q = 0; q < len; ++q) for (const int u : vss[q]) qss[u].push_back(q);
for (int q = 0; q < len; ++q) vss[q].clear();
for (const int u : sid) for (const int q : qss[u]) vss[q].push_back(u);
vector<int> xs(n, -1);
vector<pair<vector<int>, vector<int>>> ret(len);
for (int q = 0; q < len; ++q) {
vss[q].erase(std::unique(vss[q].begin(), vss[q].end()), vss[q].end());
const int nn = vss[q].size();
auto &vs = ret[q].first, &ps = ret[q].second;
vs = vss[q];
ps.resize(nn, -1);
for (int x = 0; x < nn; ++x) xs[vs[x]] = x;
for (int x = 1; x < nn; ++x) ps[x] = xs[lcaFast(vs[x - 1], vs[x])];
}
return ret;
}
};
////////////////////////////////////////////////////////////////////////////////
struct Tree {
int n;
vector<pair<int, int>> edges;
explicit Tree(int n_) : n(n_), edges() {
edges.reserve(n - 1);
}
void ae(int u, int v) {
edges.emplace_back(u, v);
}
vector<int> pt;
vector<int> zu;
void build() {
pt.assign(n + 1, 0);
for (int i = 0; i < n - 1; ++i) {
const int u = edges[i].first;
const int v = edges[i].second;
++pt[u];
++pt[v];
}
for (int u = 0; u < n; ++u) pt[u + 1] += pt[u];
zu.resize(2 * (n - 1));
for (int i = n - 1; --i >= 0; ) {
const int u = edges[i].first;
const int v = edges[i].second;
zu[--pt[u]] = v;
zu[--pt[v]] = u;
}
}
template <class F> void decomp(F f) {
sz.assign(n, 0);
dfsSz(0, -1);
del.assign(n, 0);
solveRec(0, f);
}
vector<int> sz, del;
void dfsSz(int u, int p) {
sz[u] = 1;
for (int j = pt[u]; j < pt[u + 1]; ++j) { const int v = zu[j]; if (p != v) {
dfsSz(v, u);
sz[u] += sz[v];
}}
}
template <class F> void solveRec(int u, F f) {
for (; ; ) {
int vm = -1;
for (int j = pt[u]; j < pt[u + 1]; ++j) { const int v = zu[j]; if (!del[v]) {
if (!~vm || sz[vm] < sz[v]) {
vm = v;
}
}}
if (!~vm || 2 * sz[vm] <= sz[u]) {
solveSubtree(u, f);
del[u] = 1;
for (int j = pt[u]; j < pt[u + 1]; ++j) { const int v = zu[j]; if (!del[v]) {
solveRec(v, f);
}}
break;
} else {
sz[u] -= sz[vm];
sz[vm] += sz[u];
u = vm;
}
}
}
template <class F> void solveSubtree(int r, F f) {
int allLen = 0;
vector<pair<int, int>> all(sz[r]);
all[allLen++] = make_pair(0, r);
for (int j1 = pt[r]; j1 < pt[r + 1]; ++j1) { const int r1 = zu[j1]; if (!del[r1]) {
int queLen = 0;
// vector<pair<int, int>> que(sz[r1]);
auto *que = all.data() + allLen;
que[queLen++] = make_pair(1, r1);
for (int k = 0; k < sz[r1]; ++k) {
const int d = que[k].first;
const int u = que[k].second;
for (int j = pt[u]; j < pt[u + 1]; ++j) { const int v = zu[j]; if (!del[v] && sz[u] > sz[v]) {
que[queLen++] = make_pair(d + 1, v);
}}
}
// f(-1, que);
f(-1, que, que + queLen);
// for (int k = 0; k < sz[r1]; ++k) all[allLen++] = que[k];
allLen += queLen;
}}
// f(+1, all);
f(+1, all.data(), all.data() + allLen);
}
};
int N;
vector<int> A[2], B[2];
int main() {
for (; ~scanf("%d", &N); ) {
for (int h = 0; h < 2; ++h) {
A[h].resize(N - 1);
B[h].resize(N - 1);
for (int i = 0; i < N - 1; ++i) {
scanf("%d%d", &A[h][i], &B[h][i]);
--A[h][i];
--B[h][i];
}
}
Hld hld[2];
Lca lca[2];
#ifdef LOCAL
for (int h = 0; h < 2; ++h) {
#else
for (int h = 1; h < 2; ++h) {
#endif
hld[h] = Hld(N);
for (int i = 0; i < N - 1; ++i) hld[h].ae(A[h][i], B[h][i]);
hld[h].build(0);
// cerr<<hld[h]<<endl;
lca[h] = Lca(N);
for (int i = 0; i < N - 1; ++i) lca[h].ae(A[h][i], B[h][i]);
lca[h].build(0);
}
vector<pair<int, vector<pair<int, int>>>> subss;
Tree T0(N);
for (int i = 0; i < N - 1; ++i) T0.ae(A[0][i], B[0][i]);
T0.build();
T0.decomp([&](int sig, const pair<int, int> *fL, const pair<int, int> *fR) -> void {
subss.emplace_back(sig, vector<pair<int, int>>(fL, fR));
});
const int Q = subss.size();
vector<vector<int>> uss(Q);
for (int q = 0; q < Q; ++q) {
const auto &fs = subss[q].second;
const int fsLen = fs.size();
uss[q].resize(fsLen);
for (int k = 0; k < fsLen; ++k) uss[q][k] = fs[k].second;
}
const auto css = hld[1].compress(uss, lca[1]);
// cerr<<"css = "<<css<<endl;
unsigned long long ans = 0;
vector<int> ids(N);
vector<int> gs(N);
vector<unsigned long long> dp0(N), dp1(N);
for (int q = 0; q < Q; ++q) {
const auto &fs = subss[q].second;
const int fsLen = fs.size();
const auto &vs = css[q].first;
const auto &ps = css[q].second;
const int n = vs.size();
for (int x = 0; x < n; ++x) ids[vs[x]] = x;
fill(gs.begin(), gs.begin() + n, 0);
for (int y = 1; y < n; ++y) {
const int x = ps[y];
gs[y] = gs[x] + (hld[1].dep[vs[y]] - hld[1].dep[vs[x]]);
}
fill(dp0.begin(), dp0.begin() + n, 0);
fill(dp1.begin(), dp1.begin() + n, 0);
unsigned long long sum = 0, sumF = 0, sumG = 0, sumFG = 0;
for (int k = 0; k < fsLen; ++k) {
const int f = fs[k].first;
const int x = ids[fs[k].second];
dp0[x] += 1;
dp1[x] += f;
sum += 1;
sumF += f;
sumG += gs[x];
sumFG += (unsigned long long)f * gs[x];
}
for (int y = n; --y; ) {
const int x = ps[y];
dp0[x] += dp0[y];
dp1[x] += dp1[y];
}
unsigned long long here = 0;
here += sum * sumFG;
here += sumF * sumG;
for (int y = 1; y < n; ++y) {
const int x = ps[y];
here -= 2 * (gs[y] - gs[x]) * dp0[y] * dp1[y];
}
ans += subss[q].first * here;
}
ans *= 2;
printf("%llu\n", ans);
#ifdef LOCAL
if(N<=1000){
unsigned long long brt=0;
for(int u=0;u<N;++u)for(int v=0;v<N;++v){
unsigned long long d[2];
for(int h=0;h<2;++h){
const int l=hld[h].lca(u,v);
d[h]=hld[h].dep[u]+hld[h].dep[v]-2*hld[h].dep[l];
}
brt+=d[0]*d[1];
}
if(brt!=ans){
cerr<<N<<endl;
for(int h=0;h<2;++h)for(int i=0;i<N-1;++i)cerr<<(A[h][i]+1)<<" "<<(B[h][i]+1)<<endl;
cerr<<"brt = "<<brt<<endl;
cerr<<"ans = "<<ans<<endl;
assert(false);
}
}
#endif
}
return 0;
}