Submission #3,533

2023-02-28 18:53:03

cpp11

Partially correct 71/75

137ms

5652 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;
}

	Sum	Test	Verdict		Time	Memory
base	71/75
		1	Accepted	0/0	3ms	1816 KiB
		2	Accepted	0/0	3ms	2064 KiB
		3	Accepted	0/0	8ms	2464 KiB
		4	Accepted	4/4	3ms	2608 KiB
		5	Accepted	4/4	2ms	2636 KiB
		6	Accepted	4/4	3ms	2888 KiB
		7	Accepted	4/4	3ms	2976 KiB
		8	Partially correct	2/4	3ms	3188 KiB
		9	Partially correct	2/4	3ms	3184 KiB
		10	Accepted	4/4	107ms	4536 KiB
		11	Accepted	4/4	119ms	4536 KiB
		12	Accepted	4/4	131ms	4664 KiB
		13	Accepted	4/4	136ms	4848 KiB
		14	Accepted	4/4	136ms	5216 KiB
		15	Accepted	4/4	136ms	5080 KiB
		16	Accepted	4/4	136ms	5152 KiB
		17	Accepted	4/4	137ms	5280 KiB
		18	Accepted	5/5	136ms	5372 KiB
		19	Accepted	6/6	136ms	5440 KiB
		20	Accepted	6/6	136ms	5652 KiB
		21	Accepted	2/2	2ms	4300 KiB