제출 #1143806

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143806		adimiclaus15	Triumphal arch (POI13_luk)	C++17	100 / 100	508 ms	25100 KiB

luk

#include <bits/stdc++.h>

using namespace std;

const int NMAX = 3e5;
int dp[NMAX + 1];
vector<int> G[NMAX + 1];

void dfs(int node, int p, int val) {
    dp[node] = 0;
    for(auto next : G[node]) {
        if(next != p) {
            dfs(next, node, val);
            dp[node] += dp[next] + 1;
        }
    }
    dp[node] = max(dp[node] - val, 0);
}

int main() {
    int n;
    cin >> n;
    if(n == 1) {
        cout << 0;
        return 0;
    }
    for(int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    int st = 1;
    int dr = n;
    int sol = 0;
    while(st <= dr) {
        int mid = (st + dr) / 2;
        dfs(1, 0, mid);
        if(dp[1] == 0) {
            sol = mid;
            dr = mid - 1;
        } else {
            st = mid + 1;
        }
    }
    cout << sol;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10