152462025-02-17 17:17:13TakacsAndrasÁtvágás (75 pont)cpp17Accepted 75/75238ms12308 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n; cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n-1; i++) {
        int a,b; cin >> a >> b;
        g[--a].push_back(--b);
        g[b].push_back(a);
    }
    int cnt1 = 0, cnt2 = 0;
    for (int i = 0; i < n; i++) {
        cnt1 += max(0, (int)g[i].size()-2);
        cnt2 = max(cnt2, (int)g[i].size());
    }
    cout << cnt1 << ' ' << n-cnt2-1 << '\n';
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms508 KiB
2Accepted0/01ms316 KiB
3Accepted0/08ms824 KiB
4Accepted4/41ms512 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms388 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms544 KiB
9Accepted4/41ms508 KiB
10Accepted4/4165ms12016 KiB
11Accepted4/4187ms11968 KiB
12Accepted4/4185ms12084 KiB
13Accepted4/4203ms12308 KiB
14Accepted4/4222ms12036 KiB
15Accepted4/4211ms11528 KiB
16Accepted4/4238ms11316 KiB
17Accepted4/4215ms11312 KiB
18Accepted5/5231ms11312 KiB
19Accepted6/6231ms11240 KiB
20Accepted6/6212ms11160 KiB
21Accepted2/21ms500 KiB