238232026-01-30 14:56:40BoldizsárÁtvágás (75 pont)cpp17Accepted 75/75301ms1332 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;cin >> n; 
    int bambusz = 0,csillag = 0;
    vector<int>feladat(n);
    for(int i = 0;i < n-1;i++){
        int egyik,masik;cin >> egyik >> masik;
        feladat[egyik-1]++;feladat[masik-1]++;
    }
    for(int i = 0;i < n;i++) csillag = max(csillag,feladat[i]);
    for(int i = 0;i < n;i++) if(feladat[i]> 2) bambusz+= feladat[i]-2;

    for(int i = 0;i < n;i++) cerr << feladat[i] << " ";
    csillag = n-csillag-1;
    cout << bambusz <<" "<<csillag;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted0/014ms316 KiB
4Accepted4/41ms508 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/4266ms1196 KiB
11Accepted4/4284ms1192 KiB
12Accepted4/4293ms1196 KiB
13Accepted4/4300ms1076 KiB
14Accepted4/4300ms1332 KiB
15Accepted4/4301ms1076 KiB
16Accepted4/4300ms1076 KiB
17Accepted4/4298ms1076 KiB
18Accepted5/5300ms1076 KiB
19Accepted6/6301ms1076 KiB
20Accepted6/6296ms1076 KiB
21Accepted2/21ms332 KiB