結果
| 問題 | No.399 動的な領主 |
| ユーザー |
 satanic
|
| 提出日時 | 2023-04-12 19:41:46 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 890 ms / 2,000 ms |
| コード長 | 16,924 bytes |
| コンパイル時間 | 2,280 ms |
| コンパイル使用メモリ | 161,676 KB |
| 実行使用メモリ | 20,864 KB |
| 最終ジャッジ日時 | 2024-10-08 19:08:14 |
| 合計ジャッジ時間 | 10,774 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,248 KB |
| testcase_02 | AC | 2 ms
5,248 KB |
| testcase_03 | AC | 2 ms
5,248 KB |
| testcase_04 | AC | 4 ms
5,248 KB |
| testcase_05 | AC | 54 ms
5,248 KB |
| testcase_06 | AC | 857 ms
15,744 KB |
| testcase_07 | AC | 820 ms
15,744 KB |
| testcase_08 | AC | 859 ms
15,872 KB |
| testcase_09 | AC | 881 ms
15,872 KB |
| testcase_10 | AC | 7 ms
5,248 KB |
| testcase_11 | AC | 40 ms
5,248 KB |
| testcase_12 | AC | 590 ms
16,384 KB |
| testcase_13 | AC | 563 ms
16,256 KB |
| testcase_14 | AC | 181 ms
20,736 KB |
| testcase_15 | AC | 236 ms
20,864 KB |
| testcase_16 | AC | 385 ms
18,304 KB |
| testcase_17 | AC | 890 ms
15,872 KB |
| testcase_18 | AC | 861 ms
15,852 KB |
ソースコード
//
// S i r o t a n w a t c h e s o v e r y o u .
//
// ...Jggg+J+JJJg@NQmgJa.....,
// ....gH@@@@HHB""""7"YYYYHMMMMMMM@@@@@@@Hma,.
// ...JH@@MMHY"! ? __""YH@@@@N&...
// ..JH@@HY"~ _TW@@@Mme.
// .Jg@@#"= _TTM@@N..
// .Jg@@MY! ?T@@@h,.
// .-@@@B! (TM@@@L
// .(H@MY ?W@@@+
// .W@@@ .T@@@[
// .d@@M! .T@@N,
// .d@M@' -W@@o.
// (@@M\ ?M@N,
// -d@M% .., .., j@@b
// d@@M= TM9 ?MD W@@[
// .H@M: .W@H,
// H@Ht ,@@#
// (@@M~ .@@h.
// .@@M% ..gmHHJ. .JdHga. .H@@e
// j@@#_ .@@@@@@@b J@@@@@@@h. .H@@\
// d@@@ .4@@@@@@MF (@@@@@@@@ H@@b
// d@@[ ?"BMY"= .d@@@@H, ?TWHHY"! d@@e
// J@@b .JJJ-.., ,@@@@@@M% ......... -@@@M.
// ?@@M\ ?YHHM@@@@b .. .W@@HP X@@HMWY"= d@@@#
// ,@@@L. ?H@Ng&+gd@@#H@@NHaJ+gH@[ J@@@]
// X@@@[ ...... ?"YYYYY"" ?"YHHHB"^ ..... (@@@#
// WH@N+. .W@@@@MHB= .TWH@M@Hmc .H@@M~
// .H@@@@N, _!~ .d@@@N,
// .J@@#T@@@N, .d@@@@@@@b.
// (@@@@! .T@@@n, .(H@@@H>.W@@@x
// (@@@F 4@@@@MaJ. .d@@@@Y77 4@@@r
//.H@@P ?TM@@@@N... .-JH@HMY= d@@N,
//(@@@F ?"WM@@@MQa-,. .(J(JN@@M#" Z@@@L
// d@@H, (M@@@@@@@Ng&maJ.... .. ...J.J+W@@@@@@HY! .dH@b
// ?M@@@N&. ..(JW@@@MM"?7""TYHMH@@HH@@@@@HHHgkHagHa(mggdmmagH@H@@Q@@HMMMHY"7!TMM@@@HaJ,. ..H@@@M^
// ?"W@@@@MN@@@@@H@@MMY" _???!"= ?WMMBYYTMH=7""Y@""?"~^ _"YM@@@@@@@@MH@@@@@#"^
// ?77WMMMYB""! _7"WWMMMY"7=
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <fstream>
//std::ifstream ifs("AHC006/in/0000.txt");
//auto& scan_in = ifs;
auto& scan_in = std::cin;
auto& scan_out = std::cout;
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { scan_in >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { scan_in >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { scan_in >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { scan_in >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)scan_in>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)scan_in>>w;
// output
template<typename T>void MACRO_OUT(const T t) { scan_out << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { scan_out << first << ' '; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) scan_out<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) scan_out<<std::setw(n)<<std::setfill(c)<<(dist);
#define VOUT(v) {auto tv_(v); for(size_t w_ = 0; w_ < tv_.size(); ++w_) {OUT(tv_[w_]);if(w_+1<tv_.size()){SP}}}
#define EOUT(...) do{ OUT(__VA_ARGS__)BR; exit(0); }while(0);
#define SP scan_out<<' ';
#define TAB scan_out<<'\t';
#define BR scan_out<<'\n';
#define SPBR(w, n) scan_out<<(w + 1 == n ? '\n' : ' ');
#define ENDL scan_out<<std::endl;
#define FLUSH scan_out<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << '\n';}
// utility
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define REP(w, n) FOR(w, 0, n)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define RREP(w, n) RFOR(w, 0, n)
#define FORC(w, a, n) for(char w=(a);w<(n);++w)
#define REPC(w, n) FORC(w, 0, n)
template<class S, class T, class U> bool IN(S a, T x, U b) { return a <= x && x < b; }
template<class T> inline bool CHMAX(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool CHMIN(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;
//
//std::ostream& operator<<(std::ostream& os, const __int128& t) {
// if (t >= 1000000000000000000) {
// os << (long long)(t / 1000000000000000000) << (long long)(t % 1000000000000000000);
// }
// else {
// os << (long long)t;
// }
// return os;
//}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
os << '{';
for (size_t i = 0; i < v.size(); ++i) {
os << v[i];
if (i + 1 < v.size()) os << ',';
}
os << '}';
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& v) {
os << '{';
for (auto it = v.cbegin(); it != v.cend();) {
os << *it << (++it == v.cend() ? '}' : ',');
}
return os;
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, const std::map<S, T>& m) {
os << '{';
for (auto it = m.cbegin(); it != m.cend();) { os << it->first << ':' << it->second; ++it; os << (it != m.cend() ? ',' : '}'); }
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, std::queue<T> q) {
os << '<';
while (!q.empty()) { os << q.front(); q.pop(); os << (q.empty() ? '<' : ','); }
return os;
}
template<typename T>
std::ostream& operator<<(std::ostream& os, std::stack<T> q) {
os << '>';
while (!q.empty()) { os << q.top(); q.pop(); os << (q.empty() ? ']' : ','); }
return os;
}
namespace std {
template<typename S, typename T> class numeric_limits<pair<S, T>> {
public:
static constexpr pair<S, T> max() noexcept { return { numeric_limits<S>::max(), numeric_limits<T>::max() }; }
static constexpr pair<S, T> lowest() noexcept { return { numeric_limits<S>::lowest(), numeric_limits<T>::lowest() }; }
};
}
// type/const
using i64 = long long;
using u64 = unsigned long long;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr long long INFLL = 1LL << 60; // 1.15x10^18
constexpr long long INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-6;
constexpr int MOD = 998244353;
constexpr long double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------>8------------
// ------------>8---------- LazySegmentTree ---------->8------------
namespace MonoidOfValue {
template <class T> class sum {
public:
using value_type = T;
inline static T op(const T& a, const T& b) { return a + b; }
inline static value_type id() { return T(0); }
};
template <class T> class max {
public:
using value_type = T;
inline static T op(const T& a, const T& b) { return (a < b) ? b : a; }
inline static T id() { return std::numeric_limits<T>::lowest(); }
};
template <class T> class min {
public:
using value_type = T;
inline static T op(const T& a, const T& b) { return (a < b) ? a : b; }
inline static T id() { return std::numeric_limits<T>::max(); }
};
class MONOID {
public:
struct S { int x; };
using T = S;
using value_type = T;
inline static T op(const T& l, const T& r) { return S{ 0 }; }
inline static T id() { return S{ 0 }; }
};
}
namespace MonoidOfOperator {
template <class T> class add {
public:
using value_type = T;
inline static T op(const T& a, const T& b) { return a + b; }
inline static T id() { return T(0); }
};
template <class T> class upd {
public:
using value_type = T;
inline static T op(const T& a, const T& b) { return b; }
inline static T id() { return T(0); }
};
}
namespace ApplyOperator {
template <class T1, class T2> class RSQRAQ {
public:
inline static T1 op(const T1& a, const T2& b, int w) { return a + b * w; }
};
template <class T1, class T2> class RSQRUQ {
public:
inline static T1 op(const T1& a, const T2& b, int w) { return b * w; }
};
template <class T1, class T2> class RMQRAQ {
public:
inline static T1 op(const T1& a, const T2& b, int w) { return a + b; }
};
template <class T1, class T2> class RMQRUQ {
public:
inline static T1 op(const T1& a, const T2& b, int w) { return b; }
};
}
template<class MonoidOfValue, class MonoidOfOperator, template<class, class> class ApplyOperator>
class LazySegmentTree {
private:
using ValueType = typename MonoidOfValue::value_type;
using OperatorType = typename MonoidOfOperator::value_type;
using Applier = ApplyOperator<ValueType, OperatorType>;
std::vector<ValueType> seg;
std::vector<OperatorType> laz;
std::vector<bool> isUpdated;
int HEIGHT;
int ARY_SIZE;
void push(int k, int w) {
if (!isUpdated[k]) {
seg[k] = Applier::op(seg[k], laz[k], w);
if (w > 1) {
laz[(k << 1) + 0] = MonoidOfOperator::op(laz[(k << 1) + 0], laz[k]);
laz[(k << 1) + 1] = MonoidOfOperator::op(laz[(k << 1) + 1], laz[k]);
isUpdated[(k << 1) + 0] = false;
isUpdated[(k << 1) + 1] = false;
}
isUpdated[k] = true;
laz[k] = MonoidOfOperator::id();
}
}
void update(int k, int w) {
push(k, w);
if (k < ARY_SIZE) {
push((k << 1) + 0, w >> 1);
push((k << 1) + 1, w >> 1);
seg[k] = MonoidOfValue::op(seg[(k << 1) + 0], seg[(k << 1) + 1]);
}
}
public:
LazySegmentTree(int n) {
init(n);
}
LazySegmentTree(const std::vector<ValueType>& a) {
init(a.size());
std::copy(std::begin(a), std::end(a), std::begin(seg) + ARY_SIZE);
for (int k = ARY_SIZE - 1; k > 0; --k) seg[k] = MonoidOfValue::op(seg[(k << 1) + 0], seg[(k << 1) + 1]);
}
void init(int n) {
HEIGHT = 0;
while ((1 << HEIGHT) < n) ++HEIGHT;
ARY_SIZE = 1 << HEIGHT;
seg.resize(ARY_SIZE << 1, MonoidOfValue::id());
laz.resize(ARY_SIZE << 1, MonoidOfOperator::id());
isUpdated.resize(ARY_SIZE << 1, true);
}
// ## update [l, r) with v
void update(int l, int r, OperatorType v) {
l += ARY_SIZE; r += ARY_SIZE;
int L = l, R = r - 1;
for (int i = HEIGHT; i >= 0; --i) push(L >> i, 1 << i), push(R >> i, 1 << i);
while (l < r) {
if (l & 1) laz[l] = MonoidOfOperator::op(laz[l], v), isUpdated[l] = false, ++l;
if (r & 1) --r, laz[r] = MonoidOfOperator::op(laz[r], v), isUpdated[r] = false;
l >>= 1; r >>= 1;
}
for (int i = 1; i <= HEIGHT; ++i) {
push(L >> i, 1 << i), push(R >> i, 1 << i);
update(L >> i, 1 << i), update(R >> i, 1 << i);
}
}
// ## return SUM/MAX/MIN in [l, r)
ValueType query(int l, int r) {
l += ARY_SIZE; r += ARY_SIZE - 1;
for (int i = HEIGHT; i >= 0; --i) push(l >> i, 1 << i), push(r >> i, 1 << i);
++r;
ValueType vl = MonoidOfValue::id(), vr = MonoidOfValue::id();
int w = 1;
while (l < r) {
if (l & 1) update(l, w), vl = MonoidOfValue::op(vl, seg[l]), ++l;
if (r & 1) --r, update(r, w), vr = MonoidOfValue::op(seg[r], vr);
l >>= 1; r >>= 1; w <<= 1;
}
return MonoidOfValue::op(vl, vr);
}
};
// ------------>8---------- LazySegmentTree ---------->8------------
template<class T>
class HeavyLightDecomposition {
public:
std::vector<std::vector<int>> g;
std::vector<int> sz;
std::vector<int> left, right, head, par;
HeavyLightDecomposition() {}
HeavyLightDecomposition(int n) : g(n), sz(n), left(n), right(n), head(n), par(n) {}
void add_edge(int a, int b) {
g[a].emplace_back(b);
g[b].emplace_back(a);
}
void dfs_sz(int v = 0, int pre = -1) {
sz[v] = 1;
for (auto& u : g[v]) if (u != pre) {
par[u] = v;
dfs_sz(u, v);
sz[v] += sz[u];
if (g[v][0] == pre || sz[u] > sz[g[v][0]]) std::swap(u, g[v][0]);
}
}
void dfs_hld(int v = 0, int par = -1) {
static int t = 0;
left[v] = t++;
for (const auto& u : g[v]) if (u != par) {
head[u] = (u == g[v][0] ? head[v] : u);
dfs_hld(u, v);
}
right[v] = t;
}
void build() {
dfs_sz();
dfs_hld();
}
inline int id(int i) const {
return left[i];
}
void query_vertex(int u, int v, const std::function<void(int, int)>& f) {
while (true) {
if (id(u) > id(v)) std::swap(u, v);
if (head[u] != head[v]) {
f(id(head[v]), id(v) + 1);
v = par[head[v]];
}
else {
f(id(u), id(v) + 1);
break;
}
}
}
void query_edge(int u, int v, const std::function<void(int, int)>& f) {
while (true) {
if (id(u) > id(v)) std::swap(u, v);
if (head[u] != head[v]) {
f(id(head[v]), id(v) + 1);
v = par[head[v]];
}
else {
if (u != v) f(id(u) + 1, id(v) + 1);
break;
}
}
}
void query_subtree(int v, const std::function<void(int, int)>& f) {
f(left[v], right[v]);
}
int lca(int u, int v) {
while (true) {
if (left[u] > left[v]) std::swap(u, v);
if (head[u] == head[v]) return u;
v = par[head[v]];
}
}
};
signed main() {
INIT;
VAR(int, n);
VEC_ROW(int, n - 1, a_, b_);
HeavyLightDecomposition<int> hld(n);
REP(i, n - 1) {
--a_[i]; --b_[i];
hld.add_edge(a_[i], b_[i]);
}
hld.build();
LazySegmentTree<MonoidOfValue::sum<i64>, MonoidOfOperator::add<i64>, ApplyOperator::RSQRAQ> lst(n);
i64 ans = 0;
VAR(int, Q);
REP(_, Q) {
VAR(int, a, b); --a; --b;
hld.query_vertex(a, b, [&](int l, int r) {
ans += lst.query(l, r) + (r - l);
lst.update(l, r, 1);
});
}
EOUT(ans);
return 0;
}