QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#290123#6307. Chase Game 2zzuqy#WA 19ms28620kbC++14725b2023-12-24 13:54:172023-12-24 13:54:17

Judging History

你现在查看的是最新测评结果

  • [2023-12-24 13:54:17]
  • 评测
  • 测评结果：WA
  • 用时：19ms
  • 内存：28620kb
查看
  • [2023-12-24 13:54:17]
  • 提交

answer

#include <bits/stdc++.h>
#define N 1000009
using namespace std;
int n;
vector<int>to[N];
int cnt[N];

void solve() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		to[i].clear(), cnt[i] = 0;
	for (int i = 1; i < n; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		to[x].push_back(y);
		to[y].push_back(x);
	}
	for (int i = 1; i <= n; i++)
		if (to[i].size() == 1)
			cnt[to[i][0]]++;
	int sum = 0, mx = 0;
	for (int i = 1; i <= n; i++)
		sum += cnt[i], mx = max(mx, cnt[i]);
	if (n == 2) {
		cout << -1 << endl;
		return;
	}
	if (mx == sum) {
		cout << -1 << endl;
		return;
	}
	cout << min((sum + 1) / 2, mx) << endl;
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--)
		solve();
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 28620kb

input:

4
2
1 2
4
1 2
2 3
3 4
4
1 2
2 3
2 4
5
1 2
2 3
3 4
3 5

output:

-1
1
-1
2

result:

ok 4 number(s): "-1 1 -1 2"

Test #2:

score: 0
Accepted
time: 8ms
memory: 27388kb

input:

10000
4
1 2
1 3
3 4
4
1 2
1 3
1 4
4
1 2
2 3
1 4
5
1 2
2 3
1 4
4 5
5
1 2
2 3
3 4
4 5
4
1 2
2 3
2 4
5
1 2
1 3
2 4
2 5
4
1 2
2 3
1 4
5
1 2
1 3
2 4
1 5
5
1 2
2 3
3 4
2 5
5
1 2
1 3
2 4
2 5
4
1 2
1 3
3 4
5
1 2
1 3
3 4
1 5
4
1 2
1 3
1 4
5
1 2
1 3
3 4
3 5
5
1 2
2 3
3 4
3 5
4
1 2
1 3
2 4
5
1 2
2 3
2 4
3 5
5
...

output:

1
-1
1
1
1
-1
2
1
2
2
2
1
2
-1
2
2
1
2
2
1
1
1
-1
2
2
2
1
-1
1
1
2
1
1
-1
1
2
1
1
1
-1
1
1
2
2
2
1
1
1
-1
1
2
1
1
2
1
2
1
1
2
-1
-1
-1
2
2
2
1
1
1
2
2
2
-1
1
2
-1
1
1
-1
2
-1
-1
1
2
2
2
1
1
1
1
1
1
1
1
1
2
-1
1
1
2
-1
2
1
1
1
-1
2
-1
1
-1
-1
2
-1
2
1
2
2
1
1
1
1
2
1
1
1
1
-1
2
1
2
1
1
1
1
1
1
1
2
-1...

result:

ok 10000 numbers

Test #3:

score: -100
Wrong Answer
time: 19ms
memory: 27776kb

input:

10000
9
1 2
2 3
3 4
4 5
1 6
6 7
5 8
7 9
9
1 2
2 3
2 4
1 5
2 6
4 7
6 8
1 9
9
1 2
2 3
1 4
4 5
5 6
4 7
2 8
1 9
10
1 2
2 3
1 4
3 5
3 6
2 7
6 8
6 9
6 10
10
1 2
1 3
3 4
2 5
1 6
5 7
4 8
2 9
7 10
10
1 2
2 3
2 4
1 5
3 6
6 7
5 8
4 9
9 10
9
1 2
2 3
2 4
1 5
3 6
2 7
1 8
2 9
9
1 2
1 3
2 4
1 5
3 6
3 7
7 8
8 9
10
1...

output:

1
2
2
3
1
1
3
1
1
1
3
1
3
2
2
2
2
2
2
2
3
1
3
2
2
2
2
3
2
3
2
2
2
2
2
2
3
2
2
2
1
1
1
2
2
3
2
2
2
2
2
3
2
1
2
1
2
1
2
3
2
3
2
3
2
2
1
1
2
1
1
2
2
2
1
2
3
2
3
2
2
2
2
2
2
2
2
3
3
3
1
2
3
2
2
2
2
3
2
1
2
1
2
3
3
2
2
1
2
2
1
2
4
1
4
2
1
2
2
1
3
1
2
2
3
3
2
1
3
3
2
1
2
2
2
2
2
1
1
3
3
2
1
3
2
2
2
3
1
2
...

result:

wrong answer 2nd numbers differ - expected: '3', found: '2'
English 繁體中文 简体中文

Server Time: 2024-12-03 21:03:00 | OpenSource Project