結果
問題 | No.2618 除霊 |
ユーザー | NyaanNyaan |
提出日時 | 2024-01-26 22:31:52 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,480 ms / 2,000 ms |
コード長 | 17,771 bytes |
コンパイル時間 | 3,427 ms |
コンパイル使用メモリ | 268,988 KB |
実行使用メモリ | 34,912 KB |
最終ジャッジ日時 | 2024-09-28 08:32:07 |
合計ジャッジ時間 | 31,633 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 519 ms
31,220 KB |
testcase_07 | AC | 485 ms
31,164 KB |
testcase_08 | AC | 820 ms
31,552 KB |
testcase_09 | AC | 1,149 ms
32,584 KB |
testcase_10 | AC | 1,424 ms
32,184 KB |
testcase_11 | AC | 300 ms
30,980 KB |
testcase_12 | AC | 859 ms
34,420 KB |
testcase_13 | AC | 383 ms
29,880 KB |
testcase_14 | AC | 956 ms
26,900 KB |
testcase_15 | AC | 137 ms
30,156 KB |
testcase_16 | AC | 148 ms
29,840 KB |
testcase_17 | AC | 409 ms
31,136 KB |
testcase_18 | AC | 702 ms
31,060 KB |
testcase_19 | AC | 176 ms
29,980 KB |
testcase_20 | AC | 143 ms
31,316 KB |
testcase_21 | AC | 417 ms
30,272 KB |
testcase_22 | AC | 729 ms
31,140 KB |
testcase_23 | AC | 404 ms
31,052 KB |
testcase_24 | AC | 401 ms
30,112 KB |
testcase_25 | AC | 712 ms
30,328 KB |
testcase_26 | AC | 996 ms
30,308 KB |
testcase_27 | AC | 411 ms
30,696 KB |
testcase_28 | AC | 420 ms
30,036 KB |
testcase_29 | AC | 705 ms
30,188 KB |
testcase_30 | AC | 1,025 ms
30,284 KB |
testcase_31 | AC | 895 ms
34,912 KB |
testcase_32 | AC | 218 ms
32,596 KB |
testcase_33 | AC | 316 ms
32,584 KB |
testcase_34 | AC | 422 ms
30,944 KB |
testcase_35 | AC | 535 ms
31,280 KB |
testcase_36 | AC | 686 ms
32,584 KB |
testcase_37 | AC | 776 ms
31,968 KB |
testcase_38 | AC | 983 ms
32,560 KB |
testcase_39 | AC | 1,089 ms
31,776 KB |
testcase_40 | AC | 1,259 ms
31,388 KB |
testcase_41 | AC | 1,466 ms
31,820 KB |
testcase_42 | AC | 1,480 ms
32,288 KB |
ソースコード
/*** date : 2024-01-26 22:31:46* author : Nyaan*/#define NDEBUGusing namespace std;// intrinstic#include <immintrin.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <complex>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <typeinfo>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>// utilitynamespace Nyaan {using ll = long long;using i64 = long long;using u64 = unsigned long long;using i128 = __int128_t;using u128 = __uint128_t;template <typename T>using V = vector<T>;template <typename T>using VV = vector<vector<T>>;using vi = vector<int>;using vl = vector<long long>;using vd = V<double>;using vs = V<string>;using vvi = vector<vector<int>>;using vvl = vector<vector<long long>>;template <typename T>using minpq = priority_queue<T, vector<T>, greater<T>>;template <typename T, typename U>struct P : pair<T, U> {template <typename... Args>P(Args... args) : pair<T, U>(args...) {}using pair<T, U>::first;using pair<T, U>::second;P &operator+=(const P &r) {first += r.first;second += r.second;return *this;}P &operator-=(const P &r) {first -= r.first;second -= r.second;return *this;}P &operator*=(const P &r) {first *= r.first;second *= r.second;return *this;}template <typename S>P &operator*=(const S &r) {first *= r, second *= r;return *this;}P operator+(const P &r) const { return P(*this) += r; }P operator-(const P &r) const { return P(*this) -= r; }P operator*(const P &r) const { return P(*this) *= r; }template <typename S>P operator*(const S &r) const {return P(*this) *= r;}P operator-() const { return P{-first, -second}; }};using pl = P<ll, ll>;using pi = P<int, int>;using vp = V<pl>;constexpr int inf = 1001001001;constexpr long long infLL = 4004004004004004004LL;template <typename T>int sz(const T &t) {return t.size();}template <typename T, typename U>inline bool amin(T &x, U y) {return (y < x) ? (x = y, true) : false;}template <typename T, typename U>inline bool amax(T &x, U y) {return (x < y) ? (x = y, true) : false;}template <typename T>inline T Max(const vector<T> &v) {return *max_element(begin(v), end(v));}template <typename T>inline T Min(const vector<T> &v) {return *min_element(begin(v), end(v));}template <typename T>inline long long Sum(const vector<T> &v) {return accumulate(begin(v), end(v), 0LL);}template <typename T>int lb(const vector<T> &v, const T &a) {return lower_bound(begin(v), end(v), a) - begin(v);}template <typename T>int ub(const vector<T> &v, const T &a) {return upper_bound(begin(v), end(v), a) - begin(v);}constexpr long long TEN(int n) {long long ret = 1, x = 10;for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);return ret;}template <typename T, typename U>pair<T, U> mkp(const T &t, const U &u) {return make_pair(t, u);}template <typename T>vector<T> mkrui(const vector<T> &v, bool rev = false) {vector<T> ret(v.size() + 1);if (rev) {for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];} else {for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];}return ret;};template <typename T>vector<T> mkuni(const vector<T> &v) {vector<T> ret(v);sort(ret.begin(), ret.end());ret.erase(unique(ret.begin(), ret.end()), ret.end());return ret;}template <typename F>vector<int> mkord(int N, F f) {vector<int> ord(N);iota(begin(ord), end(ord), 0);sort(begin(ord), end(ord), f);return ord;}template <typename T>vector<int> mkinv(vector<T> &v) {int max_val = *max_element(begin(v), end(v));vector<int> inv(max_val + 1, -1);for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;return inv;}vector<int> mkiota(int n) {vector<int> ret(n);iota(begin(ret), end(ret), 0);return ret;}template <typename T>T mkrev(const T &v) {T w{v};reverse(begin(w), end(w));return w;}template <typename T>bool nxp(T &v) {return next_permutation(begin(v), end(v));}// 返り値の型は入力の T に依存// i 要素目 : [0, a[i])template <typename T>vector<vector<T>> product(const vector<T> &a) {vector<vector<T>> ret;vector<T> v;auto dfs = [&](auto rc, int i) -> void {if (i == (int)a.size()) {ret.push_back(v);return;}for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();};dfs(dfs, 0);return ret;}// F : function(void(T&)), mod を取る操作// T : 整数型のときはオーバーフローに注意するtemplate <typename T>T Power(T a, long long n, const T &I, const function<void(T &)> &f) {T res = I;for (; n; f(a = a * a), n >>= 1) {if (n & 1) f(res = res * a);}return res;}// T : 整数型のときはオーバーフローに注意するtemplate <typename T>T Power(T a, long long n, const T &I = T{1}) {return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});}template <typename T>T Rev(const T &v) {T res = v;reverse(begin(res), end(res));return res;}template <typename T>vector<T> Transpose(const vector<T> &v) {using U = typename T::value_type;int H = v.size(), W = v[0].size();vector res(W, T(H, U{}));for (int i = 0; i < H; i++) {for (int j = 0; j < W; j++) {res[j][i] = v[i][j];}}return res;}template <typename T>vector<T> Rotate(const vector<T> &v, int clockwise = true) {using U = typename T::value_type;int H = v.size(), W = v[0].size();vector res(W, T(H, U{}));for (int i = 0; i < H; i++) {for (int j = 0; j < W; j++) {if (clockwise) {res[W - 1 - j][i] = v[i][j];} else {res[j][H - 1 - i] = v[i][j];}}}return res;}} // namespace Nyaan// bit operationnamespace Nyaan {__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {return _mm_popcnt_u64(a);}inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }template <typename T>inline int gbit(const T &a, int i) {return (a >> i) & 1;}template <typename T>inline void sbit(T &a, int i, bool b) {if (gbit(a, i) != b) a ^= T(1) << i;}constexpr long long PW(int n) { return 1LL << n; }constexpr long long MSK(int n) { return (1LL << n) - 1; }} // namespace Nyaan// inoutnamespace Nyaan {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}istream &operator>>(istream &is, __int128_t &x) {string S;is >> S;x = 0;int flag = 0;for (auto &c : S) {if (c == '-') {flag = true;continue;}x *= 10;x += c - '0';}if (flag) x = -x;return is;}istream &operator>>(istream &is, __uint128_t &x) {string S;is >> S;x = 0;for (auto &c : S) {x *= 10;x += c - '0';}return is;}ostream &operator<<(ostream &os, __int128_t x) {if (x == 0) return os << 0;if (x < 0) os << '-', x = -x;string S;while (x) S.push_back('0' + x % 10), x /= 10;reverse(begin(S), end(S));return os << S;}ostream &operator<<(ostream &os, __uint128_t x) {if (x == 0) return os << 0;string S;while (x) S.push_back('0' + x % 10), x /= 10;reverse(begin(S), end(S));return os << S;}void in() {}template <typename T, class... U>void in(T &t, U &...u) {cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &...u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}struct IoSetupNya {IoSetupNya() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetupnya;} // namespace Nyaan// debug#ifdef NyaanDebug#define trc(...) (void(0))#else#define trc(...) (void(0))#endif#ifdef NyaanLocal#define trc2(...) (void(0))#else#define trc2(...) (void(0))#endif// macro#define each(x, v) for (auto&& x : v)#define each2(x, y, v) for (auto&& [x, y] : v)#define all(v) (v).begin(), (v).end()#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)#define reg(i, a, b) for (long long i = (a); i < (b); i++)#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)#define fi first#define se second#define ini(...) \int __VA_ARGS__; \in(__VA_ARGS__)#define inl(...) \long long __VA_ARGS__; \in(__VA_ARGS__)#define ins(...) \string __VA_ARGS__; \in(__VA_ARGS__)#define in2(s, t) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i]); \}#define in3(s, t, u) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i]); \}#define in4(s, t, u, v) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i], v[i]); \}#define die(...) \do { \Nyaan::out(__VA_ARGS__); \return; \} while (0)namespace Nyaan {void solve();}int main() { Nyaan::solve(); }//template <typename T>struct edge {int src, to;T cost;edge(int _to, T _cost) : src(-1), to(_to), cost(_cost) {}edge(int _src, int _to, T _cost) : src(_src), to(_to), cost(_cost) {}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template <typename T>using Edges = vector<edge<T>>;template <typename T>using WeightedGraph = vector<Edges<T>>;using UnweightedGraph = vector<vector<int>>;// Input of (Unweighted) GraphUnweightedGraph graph(int N, int M = -1, bool is_directed = false,bool is_1origin = true) {UnweightedGraph g(N);if (M == -1) M = N - 1;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;if (is_1origin) x--, y--;g[x].push_back(y);if (!is_directed) g[y].push_back(x);}return g;}// Input of Weighted Graphtemplate <typename T>WeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,bool is_1origin = true) {WeightedGraph<T> g(N);if (M == -1) M = N - 1;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;cin >> c;if (is_1origin) x--, y--;g[x].emplace_back(x, y, c);if (!is_directed) g[y].emplace_back(y, x, c);}return g;}// Input of Edgestemplate <typename T>Edges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {Edges<T> es;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;if (is_weighted)cin >> c;elsec = 1;if (is_1origin) x--, y--;es.emplace_back(x, y, c);}return es;}// Input of Adjacency Matrixtemplate <typename T>vector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,bool is_directed = false, bool is_1origin = true) {vector<vector<T>> d(N, vector<T>(N, INF));for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;if (is_weighted)cin >> c;elsec = 1;if (is_1origin) x--, y--;d[x][y] = c;if (!is_directed) d[y][x] = c;}return d;}/*** @brief グラフテンプレート* @docs docs/graph/graph-template.md*/// LazySegmentTreetemplate <typename T, typename E, typename F, typename G, typename H>struct LazySegmentTree {int n, height;F f;G g;H h;T ti;E ei;vector<T> dat;vector<E> laz;LazySegmentTree(int _n, F _f, G _g, H _h, T _ti, E _ei): f(_f), g(_g), h(_h), ti(_ti), ei(_ei) {init(_n);}LazySegmentTree(const vector<T> &v, F _f, G _g, H _h, T _ti, E _ei): f(_f), g(_g), h(_h), ti(_ti), ei(_ei) {init((int)v.size());build(v);}void init(int _n) {n = 1;height = 0;while (n < _n) n <<= 1, height++;dat.assign(2 * n, ti);laz.assign(2 * n, ei);}void build(const vector<T> &v) {int _n = v.size();init(_n);for (int i = 0; i < _n; i++) dat[n + i] = v[i];for (int i = n - 1; i; i--)dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);}inline T reflect(int k) { return laz[k] == ei ? dat[k] : g(dat[k], laz[k]); }inline void eval(int k) {if (laz[k] == ei) return;laz[(k << 1) | 0] = h(laz[(k << 1) | 0], laz[k]);laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);dat[k] = reflect(k);laz[k] = ei;}inline void thrust(int k) {for (int i = height; i; i--) eval(k >> i);}inline void recalc(int k) {while (k >>= 1) dat[k] = f(reflect((k << 1) | 0), reflect((k << 1) | 1));}void update(int a, int b, E x) {if (a >= b) return;thrust(a += n);thrust(b += n - 1);for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {if (l & 1) laz[l] = h(laz[l], x), l++;if (r & 1) --r, laz[r] = h(laz[r], x);}recalc(a);recalc(b);}void set_val(int a, T x) {thrust(a += n);dat[a] = x;laz[a] = ei;recalc(a);}T get_val(int a) {thrust(a += n);return reflect(a);}T query(int a, int b) {if (a >= b) return ti;thrust(a += n);thrust(b += n - 1);T vl = ti, vr = ti;for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {if (l & 1) vl = f(vl, reflect(l++));if (r & 1) vr = f(reflect(--r), vr);}return f(vl, vr);}};template <typename T>struct has_cost {private:template <typename U>static auto confirm(U u) -> decltype(u.cost, std::true_type());static auto confirm(...) -> std::false_type;public:enum : bool { value = decltype(confirm(std::declval<T>()))::value };};template <typename T>vector<vector<T>> inverse_tree(const vector<vector<T>>& g) {int N = (int)g.size();vector<vector<T>> rg(N);for (int i = 0; i < N; i++) {for (auto& e : g[i]) {if constexpr (is_same<T, int>::value) {rg[e].push_back(i);} else if constexpr (has_cost<T>::value) {rg[e].emplace_back(e.to, i, e.cost);} else {assert(0);}}}return rg;}template <typename T>vector<vector<T>> rooted_tree(const vector<vector<T>>& g, int root = 0) {int N = (int)g.size();vector<vector<T>> rg(N);vector<char> v(N, false);v[root] = true;queue<int> que;que.emplace(root);while (!que.empty()) {auto p = que.front();que.pop();for (auto& e : g[p]) {if (v[e] == false) {v[e] = true;que.push(e);rg[p].push_back(e);}}}return rg;}/*** @brief 根付き木・逆辺からなる木への変換*/using namespace Nyaan;void q() {inl(N);auto g = graph(N);vi obake(N);{ini(M);rep(i, M) {ini(v);obake[v - 1] = 1;}}g = rooted_tree(g, 0);vi order, par(N, -1);{queue<int> Q;Q.push(0);while (sz(Q)) {int c = Q.front();Q.pop();order.push_back(c);each(d, g[c]) {par[d] = c;Q.push(d);}}}vi inv = mkinv(order);trc(order);trc(inv);LazySegmentTree seg(vp(N + 1, pl{0, 1}),[](pl a, pl b) {if (a.fi == b.fi) return pl{a.fi, a.se + b.se};return min(a, b);},[](pl a, int b) {return pl{a.fi + b, a.se};},[](int a, int b) { return a + b; }, pl{inf, 0}, 0);// 地点 xauto f = [&](int x, int act) {seg.update(inv[x], inv[x] + 1, act ? 1 : -1);if (sz(g[x])) {int L = inv[g[x][0]];int R = inv[g[x].back()] + 1;seg.update(L, R, act ? 1 : -1);}if (x != 0) {int p = par[x];seg.update(inv[p], inv[p] + 1, act ? 1 : -1);}};rep(i, N) if (obake[i]) f(i, 1);trc(seg.query(0, N));rep(i, N) {if (obake[i]) f(i, 0);each(j, g[i]) if (obake[j]) f(j, 0);if (i and obake[par[i]]) f(par[i], 0);auto [mn, num] = seg.query(0, N);out(mn ? N : N - num);if (obake[i]) f(i, 1);each(j, g[i]) if (obake[j]) f(j, 1);if (i and obake[par[i]]) f(par[i], 1);}}void Nyaan::solve() {int t = 1;// in(t);while (t--) q();}