Submission #1518714


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, mx = 0;
	for (int i : g[pos]) {
		if (i != pre) {
			int res = solve(i, pos);
			mx = max(mx, res);
			ret += res;
		}
	}
	return max(ret, mx + 1);
}
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 = N;
	for (int i = 0; i < N; i++) {
		if (g[i].size() >= 3) {
			ret = solve(i, -1); break;
		}
	}
	printf("%d\n", ret);
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:21: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 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 32 ms 5248 KB
subtask1_02.txt WA 26 ms 4736 KB
subtask1_03.txt WA 13 ms 3456 KB
subtask1_04.txt WA 14 ms 3712 KB
subtask1_05.txt WA 17 ms 3968 KB
subtask1_06.txt WA 4 ms 2688 KB
subtask1_07.txt WA 38 ms 5760 KB
subtask1_08.txt WA 11 ms 3456 KB
subtask1_09.txt WA 23 ms 4480 KB
subtask1_10.txt WA 30 ms 5120 KB
subtask1_11.txt WA 15 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 38 ms 5760 KB
subtask1_16.txt WA 57 ms 5760 KB
subtask1_17.txt WA 38 ms 5760 KB
subtask1_18.txt WA 38 ms 5760 KB
subtask1_19.txt WA 38 ms 5760 KB
subtask1_20.txt WA 38 ms 5760 KB
subtask1_21.txt WA 38 ms 5760 KB
subtask1_22.txt WA 40 ms 5760 KB
subtask1_23.txt WA 39 ms 5760 KB
subtask1_24.txt WA 39 ms 5760 KB
subtask1_25.txt WA 38 ms 5760 KB
subtask1_26.txt WA 38 ms 5760 KB
subtask1_27.txt WA 38 ms 5760 KB
subtask1_28.txt WA 38 ms 5760 KB
subtask1_29.txt WA 39 ms 5760 KB
subtask1_30.txt WA 38 ms 5760 KB
subtask1_31.txt WA 41 ms 5760 KB
subtask1_32.txt WA 38 ms 5760 KB
subtask1_33.txt WA 38 ms 5760 KB
subtask1_34.txt WA 38 ms 5760 KB
subtask1_35.txt WA 38 ms 5760 KB
subtask1_36.txt WA 38 ms 5760 KB
subtask1_37.txt WA 38 ms 5760 KB
subtask1_38.txt WA 38 ms 5760 KB
subtask1_39.txt WA 38 ms 5760 KB