Submission #1444483


Source Code Expand

#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;

vector<int> G[100010];
int N,A,B;

int dfs(int x, int l)
{
	vector<int> u;
	for (int y : G[x]) if (y != l){
		u.push_back(dfs(y,x));
	}

	int mx = 0;
	for (int i=0;i<u.size();i++) mx = max(mx,u[i]);
	if (G[x].size() == 2){
		mx++;
		if (u.size() == 2){
			B = max(B, u[0] + u[1] + 1);
		}
		else{
			B = max(B,mx);
		}
	}
	return mx;
}

int main()
{
	scanf ("%d",&N);
	for (int i=1;i<N;i++){
		int x,y; scanf ("%d %d",&x,&y);
		G[x].push_back(y);
		G[y].push_back(x);
	}
	for (int i=1;i<=N;i++) if (G[i].size() == 1) A++;

	dfs(1,0);
	printf ("%d\n",A+B);

	return 0;
}

Submission Info

Submission Time
Task K - Problem on Tree
User august14
Language C++14 (GCC 5.4.1)
Score 0
Code Size 692 Byte
Status WA
Exec Time 61 ms
Memory 5760 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d",&N);
                 ^
./Main.cpp:34:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int x,y; scanf ("%d %d",&x,&y);
                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
AC × 4
WA × 39
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 2560 KB
sample_02.txt AC 2 ms 2560 KB
subtask1_01.txt WA 36 ms 5248 KB
subtask1_02.txt WA 29 ms 4736 KB
subtask1_03.txt WA 13 ms 3456 KB
subtask1_04.txt WA 16 ms 3712 KB
subtask1_05.txt WA 19 ms 3968 KB
subtask1_06.txt WA 4 ms 2688 KB
subtask1_07.txt WA 43 ms 5760 KB
subtask1_08.txt WA 13 ms 3456 KB
subtask1_09.txt WA 26 ms 4480 KB
subtask1_10.txt WA 34 ms 5120 KB
subtask1_11.txt WA 16 ms 3712 KB
subtask1_12.txt WA 7 ms 3072 KB
subtask1_13.txt WA 5 ms 2816 KB
subtask1_14.txt WA 5 ms 2816 KB
subtask1_15.txt WA 43 ms 5760 KB
subtask1_16.txt WA 43 ms 5760 KB
subtask1_17.txt WA 44 ms 5760 KB
subtask1_18.txt WA 44 ms 5760 KB
subtask1_19.txt WA 43 ms 5760 KB
subtask1_20.txt WA 46 ms 5760 KB
subtask1_21.txt WA 46 ms 5760 KB
subtask1_22.txt WA 44 ms 5760 KB
subtask1_23.txt WA 43 ms 5760 KB
subtask1_24.txt WA 43 ms 5760 KB
subtask1_25.txt WA 43 ms 5760 KB
subtask1_26.txt WA 43 ms 5760 KB
subtask1_27.txt WA 43 ms 5760 KB
subtask1_28.txt WA 44 ms 5760 KB
subtask1_29.txt WA 43 ms 5760 KB
subtask1_30.txt WA 43 ms 5760 KB
subtask1_31.txt WA 43 ms 5760 KB
subtask1_32.txt WA 43 ms 5760 KB
subtask1_33.txt WA 43 ms 5760 KB
subtask1_34.txt WA 43 ms 5760 KB
subtask1_35.txt WA 61 ms 5760 KB
subtask1_36.txt WA 43 ms 5760 KB
subtask1_37.txt WA 43 ms 5760 KB
subtask1_38.txt WA 44 ms 5760 KB
subtask1_39.txt WA 43 ms 5760 KB