제출 #1143244

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

luk

#include <bits/stdc++.h>
using namespace std;
    vector<vector<int>> v;
    vector<int> depth;
int maxim = 1;
void bfs(int nod){
    queue <int> q;
    for(int i=0;i<v[nod].size();i++){
        int newnod = v[nod][i];
        if(depth[newnod]==0){
            depth[newnod]=depth[nod]+1;
            maxim = max(maxim,depth[newnod]);
            q.push(newnod);
        }
    }
    while(!q.empty()){
    bfs(q.front());
    q.pop();
    }
}
int main() {
	int n;
    cin>>n;
    v.resize(n+1);
    depth.resize(n+1);
    for(int i=1;i<=n-1;i++){
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    depth[1]=1;
    bfs(1);
    cout<<maxim;
}

• 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