제출 #261460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261460		zecookiez	새로운 문제 (POI13_luk)	C++14	0 / 100	337 ms	22644 KiB

luk

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300005;
vector<int> adj[MAXN];
int depth[MAXN], tot[MAXN];
int main(){
    cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n; cin >> n;
    for(int a, b, i = 1; i < n; ++i){
        cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a);
    }
    queue<int> q; q.push(1); depth[1] = 1; tot[1] = 1;
    while(!q.empty()){
        int no = q.front(); q.pop();
        for(auto i : adj[no]){
            if(depth[i] != 0) continue;
            depth[i] = depth[no] + 1;
            tot[depth[i]]++;
            q.push(i);
        }
    }
    int ans = 0, tasks = 0;
    for(int i = 2; i <= n; ++i){
        int must = tot[i];
        tasks += must;
        while((i - 1) * ans < tasks) ++ans;
    }
    cout << ans << '\n';
    return 0;
}

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