結果
| 問題 | No.399 動的な領主 |
| ユーザー |
 もりを
|
| 提出日時 | 2020-05-05 14:36:55 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 457 ms / 2,000 ms |
| コード長 | 15,354 bytes |
| コンパイル時間 | 2,860 ms |
| コンパイル使用メモリ | 225,192 KB |
| 実行使用メモリ | 22,912 KB |
| 最終ジャッジ日時 | 2024-06-26 09:15:58 |
| 合計ジャッジ時間 | 8,798 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,812 KB |
| testcase_01 | AC | 2 ms
6,812 KB |
| testcase_02 | AC | 2 ms
6,944 KB |
| testcase_03 | AC | 2 ms
6,944 KB |
| testcase_04 | AC | 4 ms
6,940 KB |
| testcase_05 | AC | 28 ms
6,940 KB |
| testcase_06 | AC | 445 ms
18,176 KB |
| testcase_07 | AC | 438 ms
18,176 KB |
| testcase_08 | AC | 423 ms
18,048 KB |
| testcase_09 | AC | 444 ms
18,048 KB |
| testcase_10 | AC | 4 ms
6,944 KB |
| testcase_11 | AC | 20 ms
6,944 KB |
| testcase_12 | AC | 298 ms
18,176 KB |
| testcase_13 | AC | 287 ms
18,040 KB |
| testcase_14 | AC | 95 ms
22,912 KB |
| testcase_15 | AC | 131 ms
22,912 KB |
| testcase_16 | AC | 190 ms
21,120 KB |
| testcase_17 | AC | 457 ms
18,048 KB |
| testcase_18 | AC | 433 ms
17,920 KB |
ソースコード
// #pragma GCC target ("avx")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\n'
#pragma region TEMPLATE
/* TYPE */
typedef long long ll; typedef long double ld;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef vector<pii> vpii; typedef vector<pll> vpll;
typedef vector<int> vi; typedef vector<ll> vl;
typedef vector<string> vst; typedef vector<bool> vb;
typedef vector<ld> vld; typedef vector<vector<int>> vvi;
template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>;
template<typename T> using prique_r = prique<T, greater<>>;
/* CONSTANT */
#define ln '\n'
const int INF = 1 << 30; const ll INFF = 1LL << 60; const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD = 1e9 + 7; const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double EPS = 1e-9; const ld PI = 3.14159265358979323846264338327950288;
const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1, 0 };
const int dy[] = { 0, 1, 0, -1, -1, -1, 1, 1, 0 };
/* CONTAINER */
#define PB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin())
#define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin())
#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))
#define GEQ(x, val) (int)(x).size() - LESS((x), (val))
#define UNIQUE(v) sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end())
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); }
template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); }
/* LOOP */
#define _overload3(_1, _2, _3, name, ...) name
#define _REP(i, n) REPI(i, 0, n)
#define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)
#define REP(...) _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__)
#define _RREP(i, n) RREPI(i, n, 0)
#define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i)
#define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__)
#define EACH(e, v) for (auto& e : v)
#define PERM(v) sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))
/* INPUT */
template<typename T> void SSS(T& t) { cin >> t; }
template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); }
#define SS(T, ...) T __VA_ARGS__; SSS(__VA_ARGS__);
#define SV(T, v, n) vector<T> v(n); for (auto& i : v) cin >> i;
#define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i;
/* OUTPUT */
// PROTOTYPE DECLARATION
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j);
template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t);
template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c);
template<typename T> ostream &operator<<(ostream &os, const stack<T> &j);
template<typename T> ostream &operator<<(ostream &os, const queue<T> &j);
template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);
// IMPLEMENTATION
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; }
template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {}
template<size_t num = 0, typename... T> enable_if_t<num < sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num + 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); }
template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; }
template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C &c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; }
template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; }
template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front()); return os << d; }
template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; }
// OUTPUT FUNCTION
template<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1]; return 0; }
inline int print() { cout << endl; return 0; }
template<typename Head> int print(Head&& head){ cout << head; return print(); }
template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); }
#ifdef LOCAL
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do {cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif
/* OTHER */
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
template<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); }
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1) r *= a; a *= a; } while (b >>= 1); return r; }
inline ll MOP(ll a, ll b, const ll &m = MOD) { ll r = 1; do { if (b & 1) (r *= a) %= m; (a *= a) %= m; } while (b >>= 1); return r; }
struct abracadabra {
abracadabra() {
cin.tie(nullptr); ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
cerr << fixed << setprecision(5);
};
} ABRACADABRA;
#pragma endregion
#pragma region SegmentTree
/**
* @brief 遅延セグメント木
* @docs docs/datastructure/segmenttree/lazysegmenttree.md
*/
template <typename M, typename OM, typename F, typename G, typename H, typename P>
struct LazySegmentTree {
int sz;
F f; G g; H h; P p;
const M ID_M;
const OM ID_OM;
vector<M> dat;
vector<OM> laz;
LazySegmentTree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p)
: ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) { build(n); }
LazySegmentTree(const vector<M> &v, M ID_M, OM ID_OM, F f, G g, H h, P p)
: ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
int n = v.size();
build(n);
for (int i = 0; i < n; ++i) dat[i + sz - 1] = v[i];
for (int i = sz - 2; i >= 0; --i) dat[i] = f(dat[2 * i + 1], dat[2 * i + 2]);
}
void build(int n) {
sz = 1; while (sz < n) sz <<= 1;
dat.assign(2 * sz - 1, ID_M);
laz.assign(2 * sz - 1, ID_OM);
}
void eval(int len, int k) {
if (laz[k] == ID_OM) return;
if (2 * k + 1 < 2 * sz - 1) {
laz[2 * k + 1] = h(laz[2 * k + 1], laz[k]);
laz[2 * k + 2] = h(laz[2 * k + 2], laz[k]);
}
dat[k] = g(dat[k], p(laz[k], len));
laz[k] = ID_OM;
}
M update(int a, int b, OM x, int k, int l, int r) {
eval(r - l, k);
if (r <= a or b <= l) return dat[k];
if (a <= l and r <= b) {
laz[k] = h(laz[k], x);
return g(dat[k], p(laz[k], r - l));
}
return dat[k] = f(update(a, b, x, 2 * k + 1, l, (l + r) / 2),
update(a, b, x, 2 * k + 2, (l + r) / 2, r));
}
M update(int a, int b, OM x) {
return update(a, b, x, 0, 0, sz);
}
M query(int a, int b, int k, int l, int r) {
eval(r - l, k);
if (r <= a or b <= l) return ID_M;
if (a <= l and r <= b) return dat[k];
M vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
M vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return f(vl, vr);
}
M query(int a, int b) {
return query(a, b, 0, 0, sz);
}
M operator[](const int &k) {
return query(k, k + 1);
}
void print() {
for (int i = 0; i < sz; ++i) cerr << query(i, i + 1) << ' ';
cerr << endl;
}
};
template<typename M, typename OM, typename F, typename G, typename H, typename P>
auto make_segtree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p) {
return LazySegmentTree<M, OM, F, G, H, P>(n, ID_M, ID_OM, f, g, h, p);
}
template<typename M, typename OM, typename F, typename G, typename H, typename P>
auto make_segtree(vector<M> v, M ID_M, OM ID_OM, F f, G g, H h, P p) {
return LazySegmentTree<M, OM, F, G, H, P>(v, ID_M, ID_OM, f, g, h, p);
}
#pragma endregion
#pragma region Graph template
/**
* @brief グラフテンプレート
* @docs docs/graph/template.md
*/
template<typename T>
struct Edge {
int frm, to, idx; T cst;
Edge() {}
Edge(int f, int t, T c, int i = -1) : frm(f), to(t), cst(c), idx(i) {}
operator int() const { return to; }
};
template<typename T>
struct Graph {
int V, E; static const T INF = numeric_limits<T>::max() / 10;
vector<vector<Edge<T>>> mat;
vector<vector<T>> wf;
Graph() {}
Graph(int v) : V(v), E(0), mat(v) {}
inline void add_edge(int a, int b, T c = 1, int margin = 0) {
a -= margin, b -= margin, E += 2;
mat[a].emplace_back(a, b, c);
mat[b].emplace_back(b, a, c);
}
inline void add_arc(int a, int b, T c = 1, int margin = 0) {
a -= margin, b -= margin, E += 1;
mat[a].emplace_back(a, b, c);
}
inline void input_edges(int M, int margin = 0, bool need_cost = false) {
for (int i = 0; i < M; ++i) {
if (need_cost) {
int a, b; T c;
cin >> a >> b >> c;
add_edge(a, b, c, margin);
} else {
int a, b; T c(1);
cin >> a >> b;
add_edge(a, b, c, margin);
}
}
}
inline void input_arcs(int M, int margin = 0, bool need_cost = false) {
for (int i = 0; i < M; ++i) {
if (need_cost) {
int a, b; T c;
cin >> a >> b >> c;
add_arc(a, b, c, margin);
} else {
int a, b; T c(1);
cin >> a >> b;
add_arc(a, b, c, margin);
}
}
}
};
#pragma endregion
#pragma region HLDecomposition
/**
* @brief HL分解
* @docs docs/graph/tree/hldecomposition.md
*/
template<typename T>
struct HLDecomposition : Graph<T> {
using Graph<T>::Graph;
using Graph<T>::mat;
using Graph<T>::V;
vector<int> sub, dep, par, head, in, out, rev;
vector<T> dst;
void build(const int root = 0) {
sub.assign(V, 0);
dep.assign(V, 0);
par.assign(V, 0);
head.assign(V, 0);
in.assign(V, 0);
out.assign(V, 0);
rev.assign(V, 0);
dst.assign(V, T(0));
dfs_sz(root, -1, 0, T(0));
int t = 0;
dfs_hld(root, -1, t);
}
int get(int u) const { return in[u]; }
int lca(int u, int v) const {
for (;; v = par[head[v]]) {
// uよりもvを後に来るようにして, vを上に押し上げていく
if (in[u] > in[v]) swap(u, v);
if (head[u] == head[v]) return u;
}
}
T dist(int u, int v) const {
return dst[u] + dst[v] - 2 * dst[lca(u, v)];
}
pair<int, int> query_subtree(int u, bool isEdge = false) const {
return make_pair(in[u] + isEdge, out[u]);
}
vector<pair<int, int>> query_path(int u, int v, bool isEdge = false) {
vector<pair<int, int>> ret;
for(;; v = par[head[v]]) {
if (in[u] > in[v]) swap(u, v);
if (head[u] == head[v]) break;
ret.emplace_back(in[head[v]], in[v] + 1);
}
ret.emplace_back(in[u] + isEdge, in[v] + 1);
return ret;
}
void dfs_sz(int cur, int prv, int depth, T weight) {
sub[cur] = 1;
dep[cur] = depth;
par[cur] = prv;
dst[cur] = weight;
// 0番目をheavy-pathにするための比較対象を設定
if (mat[cur].size() && mat[cur][0] == prv)
swap(mat[cur][0], mat[cur].back());
for (auto& nxt : mat[cur]) {
if (nxt == prv) continue;
dfs_sz(nxt, cur, depth + 1, weight + nxt.cst);
sub[cur] += sub[nxt];
if (sub[mat[cur][0]] < sub[nxt]) swap(mat[cur][0], nxt);
}
}
void dfs_hld(int cur, int prv, int& times) {
in[cur] = times++;
rev[in[cur]] = cur;
for (auto& nxt : mat[cur]) {
if (nxt == prv) continue;
// cur-nxtがheavy-path上ならheadは同じ
head[nxt] = mat[cur][0] == nxt ? head[cur] : nxt;
dfs_hld(nxt, cur, times);
}
out[cur] = times;
}
};
#pragma endregion
signed main() {
int N; cin >> N;
HLDecomposition<int> hld(N);
hld.input_edges(N - 1, 1, false);
hld.build();
using lint = long long;
using M = lint;
auto f = [](M a, M b) -> M { return a + b; };
auto p = [](M a, int b) -> M { return a * b; };
auto seg = make_segtree(N, M(0), M(0), f, f, f, p);
auto query = [&](int u, int v) -> lint {
auto prs = hld.query_path(u, v);
lint ret = 0;
for (auto& e: prs) ret += seg.query(e.first, e.second);
return ret;
};
auto update = [&](int u, int v, lint num) -> void {
auto prs = hld.query_path(u, v);
for (auto& e: prs) seg.update(e.first, e.second, 1);
};
int Q; cin >> Q;
while (Q--) {
int A, B;
cin >> A >> B;
--A, --B;
update(A, B, 1);
}
lint res = 0;
for (int i = 0; i < N; ++i) {
lint tmp = seg.query(i, i + 1);
res += tmp * (tmp + 1) >> 1;
}
cout << res << endl;
}