제출 #1143259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143259		hhvb	새로운 문제 (POI13_luk)	C++20	0 / 100	160 ms	18988 KiB

luk

#include <bits/stdc++.h>

using namespace std;

queue<int> q;
int dist[300001], h[300001];
bool used[300001];
vector<int> adj[300001];

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

    q.push( 1 );
    used[1] = true;
    while ( !q.empty() ) {
        u = q.front();
        for ( i = 0; i < adj[u].size(); i ++ ) {
            if ( used[ adj[u][i] ] == false ) {
                q.push( adj[u][i] );
                dist[ adj[u][i] ] = dist[u] + 1;
                used[adj[u][i]] = true;
            }
        }
        q.pop();
    }

    for ( i = 1; i <= n; i ++ ) {
        h[dist[i]] ++;
    }

    int ans = 0, mx, s = 0;
    i = 1;
    while ( h[i] != 0 ) {
        s += h[i];
        mx = ( s + i - 1 ) / i;
        ans = max( mx, ans );
        i ++;
    }

    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