結果

問題 No.1718 Random Squirrel
ユーザー rniyarniya
提出日時 2022-12-27 01:10:22
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 138 ms / 2,000 ms
コード長 4,731 bytes
コンパイル時間 2,584 ms
コンパイル使用メモリ 216,476 KB
実行使用メモリ 48,256 KB
最終ジャッジ日時 2024-11-21 12:03:48
合計ジャッジ時間 7,567 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 82 ms
13,824 KB
testcase_12 AC 13 ms
5,248 KB
testcase_13 AC 45 ms
9,472 KB
testcase_14 AC 84 ms
14,208 KB
testcase_15 AC 75 ms
12,416 KB
testcase_16 AC 31 ms
7,808 KB
testcase_17 AC 78 ms
13,184 KB
testcase_18 AC 112 ms
15,616 KB
testcase_19 AC 71 ms
12,032 KB
testcase_20 AC 23 ms
7,168 KB
testcase_21 AC 136 ms
18,304 KB
testcase_22 AC 138 ms
18,304 KB
testcase_23 AC 129 ms
18,304 KB
testcase_24 AC 136 ms
18,304 KB
testcase_25 AC 137 ms
18,304 KB
testcase_26 AC 58 ms
17,252 KB
testcase_27 AC 58 ms
17,356 KB
testcase_28 AC 58 ms
17,520 KB
testcase_29 AC 93 ms
48,128 KB
testcase_30 AC 93 ms
48,256 KB
testcase_31 AC 94 ms
48,128 KB
testcase_32 AC 92 ms
48,128 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) void(0)
#endif
template <typename T> istream& operator>>(istream& is, vector<T>& v) {
for (T& x : v) is >> x;
return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
for (size_t i = 0; i < v.size(); i++) {
os << v[i] << (i + 1 == v.size() ? "" : " ");
}
return os;
}
template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }
template <class T> T ceil(T x, T y) {
assert(y >= 1);
return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
assert(y >= 1);
return (x > 0 ? x / y : (x - y + 1) / y);
}
template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> void mkuni(vector<T>& v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }
const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;
#include <cassert>
#include <functional>
#include <vector>
template <class key_t, class sum_t = key_t> struct Rerooting {
struct edge {
int from, to;
key_t cost;
sum_t dp, ndp;
edge(int from, int to, key_t cost, sum_t dp, sum_t ndp) : from(from), to(to), cost(cost), dp(dp), ndp(ndp) {}
};
using F = std::function<sum_t(sum_t, sum_t)>;
using G = std::function<sum_t(sum_t, edge)>;
int n;
std::vector<std::vector<edge>> g;
const F op;
const G mapping;
const sum_t id;
Rerooting(int n, const F& op, const G& mapping, const sum_t& id)
: n(n), g(n), op(op), mapping(mapping), id(id), sub(n, id), dp(n, id) {}
void add_edge(int u, int v, key_t w) {
assert(0 <= u and u < n);
assert(0 <= v and v < n);
g[u].emplace_back(u, v, w, id, id);
g[v].emplace_back(v, u, w, id, id);
}
std::vector<sum_t> solve() {
dfs_sub(0, -1);
dfs_all(0, -1, id);
return dp;
}
private:
std::vector<sum_t> sub, dp;
void dfs_sub(int v, int p) {
for (auto& e : g[v]) {
if (e.to == p) continue;
dfs_sub(e.to, v);
e.dp = mapping(sub[e.to], e);
sub[v] = op(sub[v], e.dp);
}
}
void dfs_all(int v, int p, sum_t top) {
sum_t cur = id;
for (int i = 0; i < (int)g[v].size(); i++) {
auto& e = g[v][i];
e.ndp = cur;
if (e.to == p) e.dp = mapping(top, e);
cur = op(cur, e.dp);
}
dp[v] = cur;
cur = id;
for (int i = (int)g[v].size() - 1; i >= 0; i--) {
auto& e = g[v][i];
if (e.to != p) dfs_all(e.to, v, op(e.ndp, cur));
cur = op(cur, e.dp);
}
}
};
struct S {
int back, go;
bool must;
S(int back, int go, bool must) : back(back), go(go), must(must) {}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<bool> D(N, false);
auto op = [](S l, S r) { return S(l.back + r.back, min(l.go + r.back, l.back + r.go), l.must | r.must); };
auto mapping = [&](S x, auto e) {
bool must = x.must | D[e.to];
return S(x.back + (must ? 2 : 0), x.go + (must ? 1 : 0), must);
};
Rerooting<int, S> G(N, op, mapping, S(0, 0, false));
for (int i = 0; i < N - 1; i++) {
int u, v;
cin >> u >> v;
G.add_edge(--u, --v, 1);
}
for (; K--;) {
int d;
cin >> d;
D[--d] = true;
}
auto ans = G.solve();
for (int i = 0; i < N; i++) cout << ans[i].go << '\n';
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0