제출 #203240

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

luk

#include<bits/stdc++.h>
using namespace std;
const int nmax=3e5+42;
int n;
vector<int> adj[nmax];
int seen[nmax];

void dfs(int node,int parent,int h)
{
    seen[h]++;
    for(auto k:adj[node])
        if(k!=parent)dfs(k,node,h+1);
}

bool can(int current)
{
    int sum=0;
    for(int i=1;i<=n;i++)
    {
        sum=sum+seen[i];
        if(1LL*i*current<sum)return 0;
    }
    return 1;
}
int main()
{
    scanf("%i",&n);
    int u,v;
    for(int i=1;i<n;i++)
    {
        scanf("%i%i",&u,&v);
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    dfs(1,0,0);

    int ok=n-1,not_ok=-1;
    while(ok-not_ok>1)
    {
        int av=(ok+not_ok)/2;
        if(can(av))ok=av;
        else not_ok=av;
    }

    printf("%i\n",ok);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

luk.cpp: In function 'int main()':
luk.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&n);
     ~~~~~^~~~~~~~~
luk.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i",&u,&v);
         ~~~~~^~~~~~~~~~~~~~

• 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