結果
| 問題 |
No.1817 Reversed Edges
|
| コンテスト | |
| ユーザー |
 iiljj
|
| 提出日時 | 2022-01-21 21:48:57 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 226 ms / 2,000 ms |
| コード長 | 15,835 bytes |
| コンパイル時間 | 2,138 ms |
| コンパイル使用メモリ | 148,804 KB |
| 最終ジャッジ日時 | 2025-01-27 13:39:02 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 23 |
ソースコード
/* #region Head */
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath> // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))
#define endl '\n'
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
REP(i, 0, SIZE(arr)) is >> arr[i];
return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
os << "{";
REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
os << get<N>(a);
if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
os << ' ';
} else if constexpr (end_line) {
os << '\n';
}
return operator<<<N + 1, end_line>(os, a);
}
return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<<<0, true>(cout, a); }
void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(Tail) > 0) cout << ' ';
pprint(move(tail)...);
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif
#ifndef MYLOCAL
#undef DEBUG_
#endif
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#define VAR(type, ...) \
type __VA_ARGS__; \
cin >> __VA_ARGS__;
template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }
/* #endregion */
// #include <atcoder/all>
// using namespace atcoder;
/* #region ReRootingWithEdge */
template <class T> class ReRootingWithEdge {
public:
int n; // node cnt
private:
T ti; // identity
function<T(T, T, int, int, int)> merge;
function<T(T, int)> addNode;
// adjs[i] := 頂点 i に隣接している頂点の配列. adjacents.
vc<vc<int>> adjs;
// idxForAdjs[i][j] := adjs[i][j] (=頂点 i の j 番目の隣接頂点) にとって、iが何番目の隣接頂点か.
// つまり、 adjs[adjs[i][j]][idxForAdjs[i][j]] == i である.
vc<vc<int>> idxForAdjs;
// edgenums[i][j] := 頂点 i と adjs[i][j] (=頂点 i の j 番目の隣接頂点) を結ぶ辺の番号
vc<vc<int>> edgenums;
// dp[i][j] := 頂点 i の j 番目の隣接頂点を根とする部分木の dp 結果
vc<vc<T>> dp;
vc<T> res;
public:
ReRootingWithEdge(int n, const vc<vc<int>> &edges, T ti, function<T(T, T, int, int, int)> merge,
function<T(T, int)> addNode)
: n(n), ti(ti), merge(merge), addNode(addNode), adjs(n), idxForAdjs(n), edgenums(n), dp(n), res(n) {
int edge_idx = 0;
for (const vc<int> &edge : edges) {
idxForAdjs[edge[0]].push_back(SIZE(adjs[edge[1]]));
idxForAdjs[edge[1]].push_back(SIZE(adjs[edge[0]]));
edgenums[edge[0]].push_back(edge_idx);
edgenums[edge[1]].push_back(edge_idx);
adjs[edge[0]].push_back(edge[1]);
adjs[edge[1]].push_back(edge[0]);
edge_idx++;
}
REP(i, 0, SIZE(adjs)) dp[i].resize(SIZE(adjs[i]));
if (n > 1)
init();
else if (n == 1)
res[0] = addNode(ti, 0);
}
ReRootingWithEdge(int n, const vc<int> &u, const vc<int> &v, T ti, function<T(T, T, int, int, int)> merge,
function<T(T, int)> addNode)
: n(n), ti(ti), merge(merge), addNode(addNode), adjs(n), idxForAdjs(n), edgenums(n), dp(n), res(n) {
assert(SIZE(u) == n - 1);
assert(SIZE(v) == n - 1);
REP(edge_idx, 0, n - 1) {
idxForAdjs[u[edge_idx]].push_back(SIZE(adjs[v[edge_idx]]));
idxForAdjs[v[edge_idx]].push_back(SIZE(adjs[u[edge_idx]]));
edgenums[u[edge_idx]].push_back(edge_idx);
edgenums[v[edge_idx]].push_back(edge_idx);
adjs[u[edge_idx]].push_back(v[edge_idx]);
adjs[v[edge_idx]].push_back(u[edge_idx]);
}
REP(i, 0, SIZE(adjs)) dp[i].resize(SIZE(adjs[i]));
if (n > 1)
init();
else if (n == 1)
res[0] = addNode(ti, 0);
}
T query(int node) { return res[node]; }
private:
void init() {
// parents[i] := 頂点 i の親，無効値 -1.
vc<int> parents(n);
// order[i] := DFS 行きがけ順で i 番目に訪れる頂点
vc<int> order(n);
{ // 行きがけ順を記録する
int index = 0;
stack<int> stack;
stack.push(0);
parents[0] = -1;
while (stack.size() > 0) {
int node = stack.top();
stack.pop();
order[index++] = node;
for (int adjacent : adjs[node]) {
if (adjacent == parents[node]) continue;
stack.push(adjacent);
parents[adjacent] = node;
}
}
}
{ // 帰りがけ順で部分木の値を求めていく
// 根以外の頂点を，葉から順番に
REPR(i, SIZE(order) - 1, 1) {
int node = order[i]; // 着目する頂点
int parent = parents[node]; // その親
T accum = ti; // 親以外の隣接頂点すべてについてマージした結果が入る
int parentIndex = -1;
REP(j, 0, SIZE(adjs[node])) { // 着目する頂点の隣接頂点について
if (adjs[node][j] == parent)
parentIndex = j;
else {
accum = merge(accum, dp[node][j], edgenums[node][j], node, adjs[node][j]);
// dump(accum, dp[node][j], edgenums[node][j], node, adjs[node][j]);
}
}
assert(parentIndex != -1);
// 親が持っている配列に結果を格納する (親にとって自分が何番目の隣接頂点なのかを調べて格納)
dp[parent][idxForAdjs[node][parentIndex]] = addNode(accum, node);
}
}
// 行きがけ順で頂点の値を確定させていく
for (int node : order) {
int sz = SIZE(adjs[node]); // 隣接頂点の数
// 後ろからの累積和. accumsFromTail[j] := 隣接頂点の j+1 (0-indexed) 番目〜 (sz-1) 番目までのマージ結果．
// 累積和計算を簡単にするため， sz - 1 (0-indexed) 番目には単位元を入れる．
// 0 番目 (0-indexed) は必ず前からの累積に含まれるため，この vector には含めない．
vc<T> accumsFromTail(sz);
accumsFromTail[sz - 1] = ti;
REPR(j, sz - 1, 1)
accumsFromTail[j - 1] = merge(accumsFromTail[j], dp[node][j], edgenums[node][j], node, adjs[node][j]);
// 前からの累積和．
T accum = ti;
REP(j, 0, sz) {
// 頂点 adjs[node][j] の idxForAdjs[node][j] 番目の隣接頂点（=node）を根とする部分木の結果を計算・格納.
// 0..(j-1) 番目の累積値と，(j+1)..(sz-1) 番目の累積値をマージ
dp[adjs[node][j]][idxForAdjs[node][j]] = addNode(merge(accum, accumsFromTail[j], -1, -1, -1), node);
// accum を 0..j 番目の累積和に更新する
accum = merge(accum, dp[node][j], edgenums[node][j], node, adjs[node][j]);
// dump(accum, dp[node][j], edgenums[node][j], node, adjs[node][j]);
}
res[node] = addNode(accum, node);
// dump(node, accumsFromTail, dp[node]);
}
// dump(res);
} // end init
};
/* #endregion */
// Problem
void solve() {
VAR(ll, n);
vc<int> a(n - 1), b(n - 1);
REP(i, 0, n - 1) {
cin >> a[i], b[i];
--a[i], --b[i];
}
using T = ll;
// 部分木のマージ.
// s=累積値，t=あるエッジにひっついてる子供側の部分木の dp 値, edge_num=エッジ番号
auto merge = [&](T s, T t, int edge_idx, int node, int adj) -> T {
T ret = s + t;
if (edge_idx != -1) {
// dump(node, adj);
// return 0;
if (adj < node) ret++;
}
// dump(node, adj, ret);
return ret;
};
auto addNode = [&](T val, [[maybe_unused]] int id) -> T { return val; }; // 頂点の追加
// ノード数，辺，<T>単位元，部分木マージ，頂点追加
T ti = 0;
// ReRootingWithEdge<T> rr(n, edges, ti, merge, addNode);
ReRootingWithEdge<T> rr(n, a, b, ti, merge, addNode);
REP(i, 0, n) {
T q = rr.query(i);
pprint(q);
}
}
// entry point
int main() {
solve();
return 0;
}