253912026-02-19 18:46:29sarminÁtvágás (75 pont)cpp17Accepted 75/75135ms12296 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n-1; i++) {
    	int u, v; cin >> u >> v;
    	u--; v--;
    	g[u].push_back(v); g[v].push_back(u);
    }
    
    int mx = 0, cnt = 0/*, start = 0*/;
    for (int i = 0; i < n; i++) {
    	if (mx < (int) g[i].size()) {
    		mx = (int) g[i].size();
    	}
    	if ((int) g[i].size() == 1) cnt++;
    }
    
    cout << cnt-2 << " " << n-1-mx << "\n";

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms508 KiB
2Accepted0/01ms508 KiB
3Accepted0/04ms820 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms508 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/476ms12096 KiB
11Accepted4/4108ms12164 KiB
12Accepted4/493ms12260 KiB
13Accepted4/4115ms12296 KiB
14Accepted4/4108ms12084 KiB
15Accepted4/4116ms11480 KiB
16Accepted4/4135ms11232 KiB
17Accepted4/4135ms11316 KiB
18Accepted5/5123ms11348 KiB
19Accepted6/6119ms11164 KiB
20Accepted6/6115ms11360 KiB
21Accepted2/21ms316 KiB