제출 #1168127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168127		Muhammad_Aneeq	Triumphal arch (POI13_luk)	C++20	0 / 100	2096 ms	17368 KiB

luk

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <vector>
#warning check the output
using namespace std;
int const N=3e5+10;
vector<int>nei[N];
int ans=0;
void dfs(int u,int p=-1)
{
    int cur=0;
    for (auto i:nei[u])
    {
        if (i==p) continue;
        cur++;
        dfs(i,u);
    }
    ans=max(ans,cur);
}
inline void solve()
{
    int n;
    cin>>n;
    for (int i=1;i<n;i++)
    {
        int u,v;
        cin>>u>>v;
        nei[u].push_back(v);
        nei[v].push_back(u);
    }
    int ans1=n;
    for (int i=1;i<=n;i++)
    {
        ans=0;
        dfs(i);
        ans1=min(ans,ans1);
    }
    cout<<ans1<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}

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

luk.cpp:9:2: warning: #warning check the output [-Wcpp]
    9 | #warning check the output
      |  ^~~~~~~

• 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