제출 #1138603

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138603		simplemind_31	새로운 문제 (POI13_luk)	C++20	30 / 100	100 ms	21776 KiB

luk

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a,b,maxi=0;
vector<vector<ll>> graph;
ll degree[300000];
void solve(ll now,ll cantiadja,ll dia,ll res,ll ante){
    res=max(res,((cantiadja-1)/dia)+1);
    maxi=max(maxi,res);
    for(auto u:graph[now]){
        if(u==ante){
            continue;
        }
        solve(u,cantiadja+degree[u]-1,dia+1,res,now);
    }
}
int main(){
    scanf("%lld",&n);
    graph.resize(n);
    ll l=0,r=n;
    while(--n){
        scanf("%lld%lld",&a,&b);
        a--;b--;
        degree[a]++;degree[b]++;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    solve(0,degree[0],1,0,-1);
    printf("%lld",maxi);
}

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

luk.cpp: In function 'int main()':
luk.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%lld",&n);
      |     ~~~~~^~~~~~~~~~~
luk.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         scanf("%lld%lld",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 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