제출 #1144386

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

luk

#include <bits/stdc++.h>

using namespace std;

#define N 300005

vector<int>adj[N];
int dist[N];

void bfs(int i)
{
    queue<int>Q;
    Q.push(i);
    while(!Q.empty())
    {
        const int s=Q.front();
        Q.pop();
        for(const auto v:adj[s])
        {
            if(dist[v]==0)
            {
                dist[v]=dist[s]+1;
                Q.push(v);
            }
        }
    }
}

int main()
{
    int n;
    cin>>n;
    int x,y;
    for(int i=1;i<n;i++)
    {
        cin>>x>>y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    dist[1]=1;
    bfs(1);
    dist[n+1]=0;
    int maxim=1;
    int cnt=1;
    for(int i=3;i<=n+1;i++)
    {
        if(dist[i]==dist[i+1])cnt++;
        else
        {
            maxim=max(cnt,maxim);
            cnt=1;
        }
    }
    cout<<maxim;
    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