結果

問題 No.1718 Random Squirrel
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2021-10-23 00:03:57
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 306 ms / 2,000 ms
コード長 5,825 bytes
コンパイル時間 3,082 ms
コンパイル使用メモリ 220,152 KB
実行使用メモリ 44,388 KB
最終ジャッジ日時 2023-10-24 16:25:13
合計ジャッジ時間 8,689 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
7,164 KB
testcase_01 AC 5 ms
7,164 KB
testcase_02 AC 5 ms
7,164 KB
testcase_03 AC 5 ms
7,164 KB
testcase_04 AC 4 ms
7,164 KB
testcase_05 AC 5 ms
7,164 KB
testcase_06 AC 5 ms
7,164 KB
testcase_07 AC 5 ms
7,164 KB
testcase_08 AC 5 ms
7,164 KB
testcase_09 AC 5 ms
7,164 KB
testcase_10 AC 4 ms
7,164 KB
testcase_11 AC 140 ms
9,804 KB
testcase_12 AC 35 ms
8,220 KB
testcase_13 AC 106 ms
10,068 KB
testcase_14 AC 149 ms
9,804 KB
testcase_15 AC 168 ms
12,460 KB
testcase_16 AC 76 ms
9,540 KB
testcase_17 AC 134 ms
9,540 KB
testcase_18 AC 233 ms
14,556 KB
testcase_19 AC 156 ms
12,180 KB
testcase_20 AC 55 ms
8,220 KB
testcase_21 AC 201 ms
10,860 KB
testcase_22 AC 297 ms
15,876 KB
testcase_23 AC 242 ms
11,388 KB
testcase_24 AC 202 ms
10,860 KB
testcase_25 AC 306 ms
15,876 KB
testcase_26 AC 160 ms
12,228 KB
testcase_27 AC 159 ms
12,236 KB
testcase_28 AC 157 ms
12,228 KB
testcase_29 AC 182 ms
25,116 KB
testcase_30 AC 243 ms
44,388 KB
testcase_31 AC 194 ms
39,900 KB
testcase_32 AC 183 ms
25,116 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

#include <bits/stdc++.h>

// #include <atcoder/all>
// #include <atcoder/modint>

using namespace std;
// using namespace atcoder;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                            \
    cerr << #v << endl;                         \
    for (int i = 0; i < v.size(); i++) {        \
        for (int j = 0; j < v[i].size(); j++) { \
            cerr << v[i][j] << " ";             \
        }                                       \
        cerr << endl;                           \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
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 <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

const int N = 100011;
vector<vector<pii>> G(N);
vector<bool> on(N);

bool pre_dfs(int now, int par) {
    bool rres = on[now];
    rep(i, G[now].size()) {
        auto [ch, _] = G[now][i];
        if (ch == par) continue;

        bool res = pre_dfs(ch, now);

        if (res) {
            G[now][i].second = 1;
        }
        rres |= res;
    }
    return rres;
}

vi depth(N), max_depth(N);

int dfs1(int now, int par, int d) {
    if (on[now]) {
        depth[now] = d;
        max_depth[now] = d;
    }

    rep(i, G[now].size()) {
        auto [ch, _] = G[now][i];
        if (ch == par) continue;

        int ma = dfs1(ch, now, d + 1);
        chmax(max_depth[now], ma);
    }
    return max_depth[now];
}

vl ans(N);
ll def = 0;

void dfs2(int now, int par, int ex, int d) {
    // DEBUG(now);
    int ori_ma = max_depth[now];

    int n = G[now].size();
    vi mas(n, -inf);
    rep(i, G[now].size()) {
        auto [ch, add] = G[now][i];

        mas[i] = max_depth[ch];
    }
    // DEBUG_VEC(mas);
    int ma = -inf;
    rep(i, n) chmax(ma, mas[i]);
    chmax(ma, max_depth[now]);
    ans[now] = 2 * ex + def - (ma - d);

    vi left(n + 1, -inf), right(n + 1, -inf);
    rep(i, n) {
        left[i + 1] = max(left[i], mas[i]);
        right[i + 1] = max(right[i], mas[n - 1 - i]);
    }

    rep(i, G[now].size()) {
        auto [ch, add] = G[now][i];
        if (ch == par) continue;

        int ma = max({left[i], right[n - 1 - i], depth[now]});
        max_depth[now] = ma + 2;
        dfs2(ch, now, ex + 1 - add, d + 1);
        max_depth[now] = ori_ma;
    }
}

signed main() {
    int n, k;
    cin >> n >> k;

    rep(i, n - 1) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        G[u].push_back(pii(v, 0));
        G[v].push_back(pii(u, 0));
    }

    vi d(k);
    rep(i, k) {
        cin >> d[i];
        d[i]--;
        on[d[i]] = true;
    }

    pre_dfs(d[0], -1);

    dfs1(d[0], -1, 0);

    set<pii> st;
    rep(u, n) {
        rep(i, G[u].size()) {
            if (G[u][i].second == 1) {
                def++;
                int v = G[u][i].first;
                st.insert(pii(u, v));
            }
        }
    }
    def *= 2;
    rep(u, n) {
        rep(i, G[u].size()) {
            int v = G[u][i].first;
            if (st.count(pii(v, u))) G[u][i].second = 1;
        }
    }

    dfs2(d[0], -1, 0, 0);

    rep(i, n) {
        cout << ans[i] << endl;
    }
}
0