# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013785 | vjudge1 | Triumphal arch (POI13_luk) | C++17 | 119 ms | 19188 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |