結果

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

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, (int)v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, (int)m.size()){ REP(j_debug, (int)m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; 
    } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < (int)v.size(); i++) { cout << v[i]; if(i != (int)v.size() - 1
    ) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
//const int mod = 998244353;
struct edge{int to, cost, id;};
class Graph
{
public:
    int N;
    vector<vector<edge>> G;
    v_bool f;
    v_Pii q;
    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
        f = v_bool(N, false);
        q = v_Pii(N, Pii(-1, -1));
    }
    void add_Directed_edge(int from, int to, int cost = 1, int id = 0){
        G[from].push_back(edge({to, cost, id}));
    }
    void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }
    void dfs1(int v, int p = -1){
        for(auto e: G[v]) if(e.to != p){
            dfs1(e.to, v);
            if(f[e.to]) f[v] = true;
        }
    }
    void dfs2(int v, int p = -1){
        if(f[v]) q[v] = Pii(v, 0);
        else{
            q[v] = q[p];
            q[v].se++;
        }
        for(auto e: G[v]) if(e.to != p){
            dfs2(e.to, v);
        }
    }
    //calculate diameter of a Tree
    void dfs_for_calcdist(int v, int p, int c, vec &dist){
        if(p != -1) dist[v] = dist[p] + c;
        for(auto e: G[v]) if(e.to != p && f[e.to]) dfs_for_calcdist(e.to, v, e.cost, dist);
    } 
    int diameter(int &v1, int &v2, int s = 0){
        vec dist(N, 0);
        dfs_for_calcdist(s, -1, -1, dist);
        v1 = distance(dist.begin(), max_element(dist.begin(), dist.end()));
        fill(dist.begin(), dist.end(), 0);
        dfs_for_calcdist(v1, -1, -1, dist);
        auto amax = max_element(dist.begin(), dist.end());
        v2 = distance(dist.begin(), amax);
        return *amax;
    }
};
signed main(){
    int N, K; cin >> N >> K;
    Graph G(N);
    REP(i, N - 1){
        int u, v; cin >> u >> v;
        u--; v--;
        G.add_Undirected_edge(u, v);
    }
    vec D(K); cin >> D;
    REP(i, K){
        D[i]--;
        G.f[D[i]] = true;
    }
    G.dfs1(D[0]);
    G.dfs2(D[0]);
    vec ans(N);
    if(K == 1){
        REP(i, N) ans[i] = G.q[i].se;
    }else{
        int s, t;
        G.diameter(s, t, D[0]);
        vec d_s(N, 0), d_t(N, 0);
        G.dfs_for_calcdist(s, -1, -1, d_s);
        G.dfs_for_calcdist(t, -1, -1, d_t);
        int n = 0;
        REP(i, N) if(G.f[i]) n++;
        REP(i, N){
            if(G.f[i]) ans[i] = 2 * (n - 1) - max(d_s[i], d_t[i]);
            else{
                int v = G.q[i].fi;
                ans[i] = 2 * (n - 1) - max(d_s[v], d_t[v]) + G.q[i].se;
            }
        }
    }
    Out(ans);
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0