Submission #1168073

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168073		AbdullahIshfaq	Triumphal arch (POI13_luk)	C++20	0 / 100	134 ms	21632 KiB

luk

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
const int N = 300005;
vector<ll> g[N];
ll dep[N], freq[N];
void dfs(int u, int v = 0){
	dep[u] = dep[v] + 1;
	freq[dep[u]]++;
	for(auto c : g[u]){
		if(c != v){
			dfs(c, u);
		}
	}
}
void solve(){
	ll n, u, v;
	cin >> n;
	for(int i = 0; i <n - 1; i ++){
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs(1);
	ll mx = 1;
	for(int i = 1;i <= n; i++){
		mx = max(mx, freq[i]);
	}
	cout << mx << '\n';
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int tests = 1;
	// cin >> tests;
	for(int i = 1; i <= tests; i ++)
		solve();
}

• 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