結果

問題 No.1718 Random Squirrel
ユーザー leaf_1415
提出日時 2021-10-26 13:48:48
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
AC  
実行時間 280 ms / 2,000 ms
コード長 9,383 bytes
コンパイル時間 1,569 ms
コンパイル使用メモリ 115,372 KB
実行使用メモリ 30,116 KB
最終ジャッジ日時 2024-10-05 08:33:19
合計ジャッジ時間 7,687 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

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

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;
using namespace std;
typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{
    ll to, cost;
    edge(){}
    edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int mod = 1000000007;
//int mod = 998244353;
struct mint{
    int x;
    mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
    mint(const mint &ope) {x = ope.x;}
    
    mint operator-(){return mint(-x);}
    mint operator+(const mint &ope){return mint(x) += ope;}
    mint operator-(const mint &ope){return mint(x) -= ope;}
    mint operator*(const mint &ope){return mint(x) *= ope;}
    mint operator/(const mint &ope){return mint(x) /= ope;}
    mint& operator+=(const mint &ope){
        x += ope.x;
        if(x >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint &ope){
        x += mod - ope.x;
        if(x >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint &ope){
        ll tmp = x;
        tmp *= ope.x, tmp %= mod;
        x = tmp;
        return *this;
    }
    mint& operator/=(const mint &ope){
        ll n = mod-2; mint mul = ope;
        while(n){
            if(n & 1) *this *= mul;
            mul *= mul;
            n >>= 1;
        }
        return *this;
    }
    mint inverse(){return mint(1) / *this;}
    bool operator ==(const mint &ope){return x == ope.x;}
    bool operator !=(const mint &ope){return x != ope.x;}
    bool operator <(const mint &ope){return x < ope.x;}
};
mint modpow(mint a, ll n){
    if(n == 0) return mint(1);
    if(n % 2) return a * modpow(a, n-1);
    else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
    ll t; is >> t, ope.x = t;
    return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}
vector<mint> fact, fact_inv;
void make_fact(int n){
    fact.resize(n+1), fact_inv.resize(n+1);
    fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
    fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
vector<int> prime, pvec;
void make_prime(int n){
    prime.resize(n+1);
    rep(i, 2, n){
        if(prime[i]) continue;
        for(int j = i; j <= n; j+=i) prime[j] = i;
    }
    rep(i, 2, n) if(prime[i] == i) pvec.push_back(i);
}
bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}
template<class S, class T> pair<S, T>& operator+=(pair<S,T> &s, const pair<S,T> &t){
    s.first += t.first, s.second += t.second;
    return s;
}
template<class S, class T> pair<S, T>& operator-=(pair<S,T> &s, const pair<S,T> &t){
    s.first -= t.first, s.second -= t.second;
    return s;
}
template<class S, class T> pair<S, T> operator+(const pair<S,T> &s, const pair<S,T> &t){
    return pair<S,T>(s.first+t.first, s.second+t.second);
}
template<class S, class T> pair<S, T> operator-(const pair<S,T> &s, const pair<S,T> &t){
    return pair<S,T>(s.first-t.first, s.second-t.second);
}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
    reps(i, vec) os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os;
}
template<typename T>
ostream& operator << (ostream& os, const vector<T>& vec) {
    reps(i, vec) os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
    reps(i,  deq) os << deq[i] << (i + 1 == deq.size() ? "" : " "); return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
    for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++; if(itr != map_var.end()) os << ","; itr--;
    }
    return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
    for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
    }
    return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
    for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
    }
    return os;
}
template<typename T>
void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";}cout << endl;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    cout << head;
    if(sizeof...(Tail) > 0) cout << " ";
    dump_func(std::move(tail)...);
}
ll n, k;
vector<ll> G[100005];
ll sum[100005], dif[100005], ans[100005];
bool b[100005];
void dfs(int v, int p)
{
    for(auto u : G[v]){
        if(u == p) continue;
        dfs(u, v);
        sum[v] += sum[u];
    }
    if(b[v]) sum[v]++;
}
void dfs2(int v, int p)
{
    for(auto u : G[v]){
        if(u == p) continue;
        if(sum[u] < k) dif[u] += 2;
        if(sum[u]) dif[1] += 2, dif[u] -= 2;
        dfs2(u, v);
    }
}
void dfs3(int v, int p, ll s)
{
    s += dif[v], ans[v] = s;
    for(auto u : G[v]){
        if(u == p) continue;
        dfs3(u, v, s);
    }
}
struct Rerooting{
    typedef ll T;
    struct edge{
        int to;
        edge(){}
        edge(int a){to = a;}
    };
    
    int n;
    vector<vector<edge> > G;
    vector<int> parent;
    vector<T> dp, dp2, ans;
    vector<T> lsum, rsum;
    
    Rerooting(){};
    Rerooting(int n){
        this->n = n;
        init();
    }
    void init(){
        G.clear(), G.resize(n+1);
        parent.resize(n+1);
        dp.resize(n+1), dp2.resize(n+1);
        lsum.resize(n+1), rsum.resize(n+1);
        ans.resize(n+1);
    }
    void add_edge(int u, int v){
        G[u].push_back(edge(v));
        G[v].push_back(edge(u));
    }
    
    T Ident(){ //
        return -inf;
    }
    T ope(T &a, T &b){ //
        return max(a, b);
    }
    T ope2(int v, T sum){ //
        ll ret = sum + 1;
        if(b[v]) chmax(ret, 0LL);
        return ret;
    }
    
    T& get(int u, int v){
        if(parent[u] == v) return dp2[u];
        else return dp[v];
    }
    
    void dfs(int v, int p)
    {
        parent[v] = p;
        for(auto e : G[v]) if(e.to != p) dfs(e.to, v);
        
        T sum = Ident();
        for(auto e : G[v]) if(e.to != p) sum = ope(sum, get(v, e.to));
        dp[v] = ope2(v, sum);
    }
    void dfs2(int v, int p)
    {
        ll m = sz(G[v]); T sum;
        
        sum = lsum[0] = Ident();
        rep(i, 0, m-1){
            sum = ope(sum, get(v, G[v][i].to));
            lsum[i+1] = sum;
        }
        sum = rsum[m+1] = Ident();
        per(i, m-1, 0){
            sum = ope(sum, get(v, G[v][i].to));
            rsum[i+1] = sum;
        }
        
        reps(i, G[v]){
            int u = G[v][i].to;
            if(u == p) continue;
            T sum = ope(lsum[i], rsum[i+2]);
            dp2[u] = ope2(v, sum);
        }
        
        for(auto e : G[v]) if(e.to != p) dfs2(e.to, v);
    }
    
    void calc(){
        dfs(1, -1), dfs2(1, -1);
        rep(i, 1, n){
            T sum = Ident();
            for(auto e : G[i]) sum = ope(sum, get(i, e.to));
            ans[i] = ope2(i, sum);
        }
    }
    void print(){
        rep(i, 1, n) for(auto e : G[i]) outl(i, "->", e.to, ":", get(i, e.to));
    }
};
int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n >> k;
    Rerooting rt(n);
    
    ll u, v;
    rep(i, 1, n-1){
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
        rt.add_edge(u, v);
    }
    rep(i, 1, k) cin >> v, b[v] = true;
    
    dfs(1, -1);
    dfs2(1, -1);
    dfs3(1, -1, 0);
    
    rt.calc();
    rep(i, 1, n) ans[i] -= rt.ans[i];
    
    rep(i, 1, n) outl(ans[i]);
    
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0