/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 77ms 98.98 MiB
#2 Accepted 76ms 99.02 MiB
#3 Accepted 76ms 99.031 MiB
#4 Accepted 77ms 99.012 MiB
#5 Accepted 374ms 124.148 MiB
#6 Accepted 405ms 124.297 MiB
#7 Accepted 416ms 124.379 MiB
#8 Accepted 778ms 124.656 MiB
#9 Accepted 301ms 124.5 MiB
#10 Accepted 1029ms 124.461 MiB
#11 Accepted 1229ms 124.461 MiB
#12 Accepted 1455ms 124.5 MiB
#13 Accepted 1120ms 123.285 MiB
#14 Accepted 248ms 123.234 MiB
#15 Accepted 403ms 123.27 MiB
#16 Accepted 1007ms 123.293 MiB
#17 Accepted 279ms 123.27 MiB
#18 Accepted 953ms 123.293 MiB
#19 Accepted 877ms 122.855 MiB
#20 Accepted 747ms 138.098 MiB
#21 Accepted 513ms 153.43 MiB
#22 Wrong Answer 16ms 18.852 MiB
#23 Wrong Answer 16ms 18.773 MiB

Code

// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define int long long
#define endl '\n'

using namespace std;
using pii = pair<int, int>;
using tup = tuple<int, int, int>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// template <class T> using ordered_set = tree<T, null_type,
//                          less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int inf = 1e9;
const int mod = 1000000007;
const double eps = 1e-9;
const int N = 200005;

void preprocess() {}

vector<int> e[N];
multiset<int> mst[N];
int sz[N], mx[N], par[N];

void dfs(int u, int p) {
    sz[u] = 1;
    mx[u] = 1;
    par[u] = p;
    for(int v : e[u]) if(v != p) {
        dfs(v, u);
        sz[u] += sz[v];
        mx[u] = max(mx[v] + 1, mx[u]);
    }
}

int dp[N][105];
vector<int> cst[N];

int DP(int i, int k, int p) {
    if(dp[i][k] != -1) return dp[i][k];
    // if(sz[i] <= k+1) return dp[i][k] = sz[i];

    int ans = 1;
    for(int jj=0; jj<e[i].size(); jj++) {
        int j = e[i][jj];
        if(j == p) continue;
        ans = max(ans, 1 + DP(j, k, i));
        if(k) {
            int mxnow = cst[i][jj];
            int lo = 0, hi = k-1;

            int now = 0;
            while(lo <= hi) {
                int mid = lo + hi >> 1;

                int f1 = 1 + DP(j, mid, i) + min(mxnow, k - mid);
                int f2 = 1 + DP(j, mid+1, i) + min(mxnow, k - (mid+1));

                if(f1 <= f2) lo = mid + 1;
                else hi = mid - 1;

                now = max({now, f1, f2});
            }
            ans = max(ans, now);
        }
    }

    return dp[i][k] = ans;
}

void solve(int tc) {
    int n, k;
    cin >> n >> k;

    if(n <= k+1) {
        cout << n << endl;
        return;
    }

    for(int i=1; i<n; i++) {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }

    memset(dp, -1, sizeof dp);
    dfs(1, -1);

    for(int i=1; i<=n; i++) {
        for(int j : e[i]) if(j - par[i]) {
            mst[i].insert(mx[j]);
        }

        for(int j : e[i]) {
            if(j == par[i]) {
                cst[i].push_back(0);
                continue;
            }
            mst[i].erase(mst[i].find(mx[j]));
            if(mst[i].size()) {
                cst[i].push_back(*mst[i].rbegin());
            }
            else cst[i].push_back(0);
            mst[i].insert(mx[j]);
        }
    }
    cout << DP(1, k, -1) << endl;
}   

int32_t main() {
    cin.tie(NULL)->sync_with_stdio(false);
    cout.precision(10);

    preprocess();

    int T = 1;
    // cin >> T;

    for (int i = 1; i <= T; i++) {  
        solve(i);
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1111 Thakurs tree game
Contest
Brain Booster #7
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-05 16:42:43
Judged At
2024-11-07 09:26:05
Judged By
Score
97
Total Time
1455ms
Peak Memory
153.43 MiB