結果

問題 No.1718 Random Squirrel
ユーザー carrot46
提出日時 2021-10-22 23:41:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 237 ms / 2,000 ms
コード長 3,567 bytes
コンパイル時間 2,860 ms
コンパイル使用メモリ 211,976 KB
最終ジャッジ日時 2025-01-25 04:31:56
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace atcoder;
//#pragma GCC optimize ("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
const ll INF = (1LL<<60);
template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}
using mint = modint998244353;
using vm = vector<mint>;
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N>>K;
    mat G(N);
    rep(i, N - 1){
        int u, v;
        cin>>u>>v;
        --u; --v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    vec flag(N, 0);
    rep(i, K) {
        cin>>A;
        flag[A - 1] = 1;
    }
    int r = -1;
    {
        vec num_d(N);
        auto dfs1 = [&](auto &&self, int p, int v) -> void{
            num_d[v] = flag[v];
            for(int to : G[v]){
                if(to != p){
                    self(self, v, to);
                    num_d[v] += num_d[to];
                }
            }
            if(r == -1){
                if(num_d[v] > 0) flag[v] = 1;
                if(num_d[v] == K) r = v;
            }
        };
        dfs1(dfs1, -1, 0);
    }
    ll base = accumulate(ALL(flag), -1) * 2;
    vec dist(N, INF), parent(N, -1);
    {
        rep(i, N) if(flag[i]) {
            dist[i] = 0;
            parent[i] = i;
        }
        queue<P> que;
        rep(i, N){
            if(flag[i]){
                for(int to : G[i]){
                    if(chmin(dist[to], 1LL)){
                        que.emplace(to, i);
                    }
                }
            }
        }
        while(!que.empty()){
            auto [v, p] = que.front();
            que.pop();
            parent[v] = p;
            for(int to : G[v]){
                if(chmin(dist[to], dist[v] + 1)){
                    que.emplace(to, p);
                }
            }
        }
    }
    vec res(N, 0);
    {
        auto calc_dist = [&](int st) {
            vec dist_in_r(N, INF);
            dist_in_r[st] = 0;
            queue<int> que;
            que.push(st);
            while (!que.empty()) {
                int v = que.front();
                que.pop();
                for (int to : G[v]) {
                    if (flag[to] && chmin(dist_in_r[to], dist_in_r[v] + 1)) {
                        que.push(to);
                    }
                }
            }
            rep(i, N) if(!flag[i]) dist_in_r[i] = -1;
            return dist_in_r;
        };
        auto d1 = calc_dist(r);
        int tp = max_element(ALL(d1)) - begin(d1);
        auto dL = calc_dist(tp);
        int bt = max_element(ALL(dL)) - begin(dL);
        auto dR = calc_dist(bt);
        rep(i, N) if(flag[i]) res[i] = - max(dL[i], dR[i]);
        rep(i, N) if(!flag[i]) res[i] = dist[i] + res[parent[i]];
    }
    rep(i, N) {
        //cout<<flag[i]<<' '<<res[i]<<' '<<base<<endl;
        cout<<res[i] + base<<endl;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0