# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1143114 | asaass | Triumphal arch (POI13_luk) | C++20 | 177 ms | 35532 KiB |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
ll n,m,i,j,k,l,d[1000000],t[1000000];
vector<ll>g[1000000];
ll df(ll v){
m=max(m,++t[d[v]]);
for(auto i:g[v])
if(d[i]==0)
d[i]=d[v]+1,df(i);
}
int main()
{
cin>>n;
for(k=1;k<n;k++)
cin>>i>>j,g[i].emplace_back(j),g[j].emplace_back(i);
d[1]=1;
df(1);
cout<<m;
}
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... |