#724947 (C++17) No.1718 Random Squirrel

提出ソース

結果

問題	No.1718 Random Squirrel
ユーザー	heno239
提出日時	2021-12-18 21:47:57
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	146 ms / 2,000 ms
コード長	5,452 bytes
コンパイル時間	2,182 ms
コンパイル使用メモリ	154,952 KB
実行使用メモリ	77,952 KB
最終ジャッジ日時	2024-09-15 14:01:43
合計ジャッジ時間	6,325 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	19 ms 20,736 KB
testcase_01	AC	19 ms 20,736 KB
testcase_02	AC	19 ms 20,864 KB
testcase_03	AC	19 ms 20,864 KB
testcase_04	AC	19 ms 20,736 KB
testcase_05	AC	19 ms 20,864 KB
testcase_06	AC	20 ms 20,864 KB
testcase_07	AC	19 ms 20,736 KB
testcase_08	AC	19 ms 20,736 KB
testcase_09	AC	19 ms 20,736 KB
testcase_10	AC	19 ms 20,736 KB
testcase_11	AC	89 ms 27,264 KB
testcase_12	AC	30 ms 22,144 KB
testcase_13	AC	60 ms 24,576 KB
testcase_14	AC	96 ms 27,392 KB
testcase_15	AC	85 ms 26,368 KB
testcase_16	AC	47 ms 23,424 KB
testcase_17	AC	86 ms 26,880 KB
testcase_18	AC	112 ms 28,416 KB
testcase_19	AC	84 ms 26,112 KB
testcase_20	AC	40 ms 23,168 KB
testcase_21	AC	136 ms 29,696 KB
testcase_22	AC	146 ms 29,952 KB
testcase_23	AC	133 ms 29,824 KB
testcase_24	AC	131 ms 29,824 KB
testcase_25	AC	137 ms 29,824 KB
testcase_26	AC	70 ms 35,636 KB
testcase_27	AC	70 ms 35,260 KB
testcase_28	AC	70 ms 35,632 KB
testcase_29	AC	129 ms 77,824 KB
testcase_30	AC	130 ms 77,952 KB
testcase_31	AC	128 ms 77,824 KB
testcase_32	AC	129 ms 77,952 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-4;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

const int mn = 1 << 17;
struct edge {
	int to;
};
using Data = array<ll, 3>;
vector<edge> G[mn];
vector<int> ids[mn];
vector<Data> memo[mn];
int root;

Data merge(Data a, Data b) {
	Data res;
	//
	res[0] = a[0] + b[0];
	res[1] = a[1] + b[1];
	res[2] = max(a[2], b[2]);
	//
	return res;
}

bool isd[mn];
Data dfs(int id, int fr) {
	Data res;
	//
	//initialize
	res = { 0,0,-mod };
	if (isd[id])res = { 0,1,0 };
	//
	for (edge e : G[id]) {
		if (e.to == fr)continue;
		Data nex = dfs(e.to, id);
		//
		//update with edge
		if (nex[1])nex[0] += 2;
		nex[2] += 1;
		//
		res = merge(res, nex);
		ids[id].push_back(e.to);
		memo[id].push_back(nex);
	}
	//
	//update for return
	//
	return res;
}

ll ans[mn];
void invdfs(int id, int fr, Data pre) {
	vector<Data> v;
	for (Data d : memo[id])v.push_back(d);
	if (fr >= 0)v.push_back(pre);
	int len = v.size();
	//
	//calcurate id's ans
	Data nd = { 0,0,-mod };
	if (isd[id])nd = { 0,1,0 };
	for (Data d : v)nd = merge(nd, d);
	ans[id] = nd[0] - nd[2];
	//
	vector<Data> le(len + 1);
	vector<Data> ri(len + 1);
	//
	Data init_c = { 0,0,-mod };
	//
	le[0] = init_c;
	rep(i, len) {
		le[i + 1] = merge(le[i], v[i]);
	}
	ri[len] = init_c;
	per(i, len) {
		ri[i] = merge(ri[i + 1], v[i]);
	}
	rep(i, ids[id].size()) {
		int to = ids[id][i];
		Data d = merge(le[i], ri[i + 1]);

		//
		//update for return
		if (isd[id]) {
			d[1]++;
			chmax(d[2], (ll)0);
		}
		if (d[1])d[0] += 2;
		d[2] += 1;
		//
		invdfs(to, id, d);
	}
}
void yaru() {
	dfs(root, -1);
	invdfs(root, -1, { 0,0,-mod });
}




void solve() {
	int n, k; cin >> n >> k;
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back({ b });
		G[b].push_back({ a });
	}
	rep(i, k) {
		int d; cin >> d; d--;
		isd[d] = true;
	}
	yaru();
	rep(i, n)cout << ans[i] << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(8);
	//init_f();
	//init();
	//while(true)
	//expr();
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード