Submission #3,548

2023-02-28 21:16:58

cpp17

Partially correct 71/75

138ms

5396 KiB

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin>>n;
	vector<int>fszam(n+1);
	for(int i=0; i<n+1; i++){
		fszam[i]=0;
	}
	for(int i=1; i<n; i++){
		int a, b;
		cin>>a>>b;
		fszam[a]++;
		fszam[b]++;
	}
	int szaml=0;
	int maxi=0;
for(int i=1; i<n; i++){
	if(fszam[i]>2){
		szaml+=fszam[i]-2;
	}
	if(maxi<fszam[i]){
		maxi=fszam[i];
	}
}

cout<<szaml<<" "<<n-1-maxi << '\n';
}

	Sum	Test	Verdict		Time	Memory
base	71/75
		1	Accepted	0/0	3ms	2000 KiB
		2	Accepted	0/0	3ms	2140 KiB
		3	Accepted	0/0	8ms	2556 KiB
		4	Accepted	4/4	3ms	2468 KiB
		5	Accepted	4/4	3ms	2600 KiB
		6	Accepted	4/4	3ms	2556 KiB
		7	Accepted	4/4	3ms	2552 KiB
		8	Partially correct	2/4	3ms	2684 KiB
		9	Partially correct	2/4	3ms	2896 KiB
		10	Accepted	4/4	108ms	4460 KiB
		11	Accepted	4/4	119ms	4552 KiB
		12	Accepted	4/4	134ms	4680 KiB
		13	Accepted	4/4	136ms	4760 KiB
		14	Accepted	4/4	136ms	5032 KiB
		15	Accepted	4/4	136ms	5104 KiB
		16	Accepted	4/4	138ms	5104 KiB
		17	Accepted	4/4	136ms	4992 KiB
		18	Accepted	5/5	136ms	5120 KiB
		19	Accepted	6/6	137ms	5120 KiB
		20	Accepted	6/6	136ms	5396 KiB
		21	Accepted	2/2	3ms	3952 KiB