Submission #1518751


Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int N, a, b, d[100009]; vector<int> g[100009];
int solve(int pos, int pre) {
	int ret = 0, r1 = 0, r2 = 0;
	for (int i : g[pos]) {
		if (i != pre) {
			ret = max(ret, solve(i, pos));
			if (r1 < d[i]) r2 = r1, r1 = d[i];
			else if (r2 < d[i]) r2 = d[i];
		}
	}
	d[pos] = r1 + (g[pos].size() == 2 ? 1 : 0);
	return max(ret, d[pos] + r2);
}
int main() {
	scanf("%d", &N);
	for (int i = 1; i < N; i++) {
		scanf("%d %d", &a, &b); a--, b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	int ret = 0;
	for (int i = 0; i < N; i++) ret += (g[i].size() == 1 ? 1 : 0);
	printf("%d\n", ret + solve(0, -1));
	return 0;
}

Submission Info

Submission Time
Task K - Problem on Tree
User square1001
Language C++14 (GCC 5.4.1)
Score 100
Code Size 749 Byte
Status AC
Exec Time 44 ms
Memory 6144 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 43
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 AC 33 ms 5632 KB
subtask1_02.txt AC 26 ms 4992 KB
subtask1_03.txt AC 12 ms 3584 KB
subtask1_04.txt AC 15 ms 3840 KB
subtask1_05.txt AC 17 ms 4096 KB
subtask1_06.txt AC 4 ms 2688 KB
subtask1_07.txt AC 39 ms 6144 KB
subtask1_08.txt AC 12 ms 3584 KB
subtask1_09.txt AC 24 ms 4736 KB
subtask1_10.txt AC 44 ms 5376 KB
subtask1_11.txt AC 15 ms 3840 KB
subtask1_12.txt AC 7 ms 3072 KB
subtask1_13.txt AC 5 ms 2816 KB
subtask1_14.txt AC 5 ms 2816 KB
subtask1_15.txt AC 40 ms 6144 KB
subtask1_16.txt AC 39 ms 6144 KB
subtask1_17.txt AC 40 ms 6144 KB
subtask1_18.txt AC 40 ms 6144 KB
subtask1_19.txt AC 43 ms 6144 KB
subtask1_20.txt AC 40 ms 6144 KB
subtask1_21.txt AC 41 ms 6144 KB
subtask1_22.txt AC 39 ms 6144 KB
subtask1_23.txt AC 41 ms 6144 KB
subtask1_24.txt AC 39 ms 6144 KB
subtask1_25.txt AC 40 ms 6144 KB
subtask1_26.txt AC 40 ms 6144 KB
subtask1_27.txt AC 41 ms 6144 KB
subtask1_28.txt AC 40 ms 6144 KB
subtask1_29.txt AC 40 ms 6144 KB
subtask1_30.txt AC 39 ms 6144 KB
subtask1_31.txt AC 40 ms 6144 KB
subtask1_32.txt AC 40 ms 6144 KB
subtask1_33.txt AC 39 ms 6144 KB
subtask1_34.txt AC 39 ms 6144 KB
subtask1_35.txt AC 39 ms 6144 KB
subtask1_36.txt AC 40 ms 6144 KB
subtask1_37.txt AC 42 ms 6144 KB
subtask1_38.txt AC 40 ms 6144 KB
subtask1_39.txt AC 40 ms 6144 KB