Submission #1133485

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1133485	2025-01-08 00:17:19	sofija6	Hard route (IZhO17_road)	C++20	100 / 100	374 ms	125220 KiB

road

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define ll long long
#define MAXN 500010
using namespace std;
ll maxx[MAXN],cnt[MAXN];
vector<ll> G[MAXN];
void DFS_Dist(ll i,ll p)
{
    maxx[i]=0;
    cnt[i]=1;
    for (ll next : G[i])
    {
        if (next!=p)
        {
            DFS_Dist(next,i);
            if (maxx[next]+1==maxx[i])
                cnt[i]+=cnt[next];
            else if (maxx[next]+1>maxx[i])
            {
                maxx[i]=maxx[next]+1;
                cnt[i]=cnt[next];
            }
        }
    }
}
bool Cmp(pair<ll,ll> x,pair<ll,ll> y)
{
    if (x.first!=y.first)
        return x.first>y.first;
    return x.second>y.second;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 19 / 19
• Subtask 2: 33 / 33
• Subtask 3: 48 / 48