146992025-01-28 14:41:46KristófÁtvágás (75 pont)cpp17Accepted 75/75141ms3636 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    cin>>n;
    int tmp;
    int tmp2;
    vector<int> cs (n);
    for(int i=0;i<n-1;i++)
        {
        cin>>tmp;
        cs[tmp-1]++;
        cin>>tmp2;
        cs[tmp2-1]++;
        }
        //for(int i=0;i<n-1;i++)
        //{
        //cout<<cs[i]<<" ";
        //}
        int bam=0;
        int max=-1;
        for(int x :cs)
            {
            if(x>2)
                {
                bam+=x-2;
                }
            if(max<x)
                {
                max=x;
                }
            }
        cout<<bam<<" "<<n-1-max;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms316 KiB
2Accepted0/01ms556 KiB
3Accepted0/07ms316 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/4109ms2612 KiB
11Accepted4/4122ms2976 KiB
12Accepted4/4136ms3380 KiB
13Accepted4/4141ms3616 KiB
14Accepted4/4141ms3608 KiB
15Accepted4/4140ms3620 KiB
16Accepted4/4141ms3616 KiB
17Accepted4/4141ms3604 KiB
18Accepted5/5141ms3636 KiB
19Accepted6/6140ms3636 KiB
20Accepted6/6140ms3636 KiB
21Accepted2/21ms316 KiB