Submission #1013785

#TimeUsernameProblemLanguageResultExecution timeMemory
1013785vjudge1Triumphal arch (POI13_luk)C++17
0 / 100
119 ms19188 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll d[300006];
vector<ll> v[300006];
void dfs(ll i=0,ll dep=0,ll par=0){
    d[dep]++;
    for(int j=0;j<v[i].size();j++){
        if(v[i][j]!=par){
            dfs(v[i][j],dep+1,i);
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll n;
    cin>>n;
    for(int i=0;i<n-1;i++){
        ll x,y;
        cin>>x>>y;x--;y--;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs();
    ll mx=0;
    for(int i=0;i<n;i++){
        mx=max(d[i],mx);
    }
    cout<<mx;
}

Compilation message (stderr)

luk.cpp: In function 'void dfs(ll, ll, ll)':
luk.cpp:8:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(int j=0;j<v[i].size();j++){
      |                 ~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...