QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#220474#6307. Chase Game 2ucup-team1883#WA 7ms3940kbC++14575b2023-10-20 14:19:182023-10-20 14:19:18

Judging History

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

  • [2023-10-20 14:19:18]
  • 评测
  • 测评结果：WA
  • 用时：7ms
  • 内存：3940kb
查看
  • [2023-10-20 14:19:18]
  • 提交

answer

#include <iostream>

const int N = 100005;

int deg[N];

int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) deg[i] = 0;
    for (int i = 1; i < n; ++i) {
      int u, v;
      scanf("%d %d", &u, &v);
      ++deg[u], ++deg[v];
    }
    bool flag = false;
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
      if (deg[i] == n - 1) flag = true;
      if (deg[i] == 1) ++ans;
    }
    if (flag) {
      puts("-1");
    } else {
      printf("%d\n", ans - 1);
    }
  }
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 2ms
memory: 3808kb

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: 7ms
memory: 3940kb

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
4
4
5
3
2
5
3
4
3
4
3
4
3
4
4
4
3
4
3
5
3
4
4
3
3
4
5
4
5
4
4
3
5
4
5
5
4
5
4
3
4
4
4
4
5
2
5
4
4
4
5
4
2
5
2
4
3
3
4
4
6
4
5
4
4
3
3
4
2
3
3
5
4
3
4
5
3
5
4
4
5
3
5
3
3
4
5
5
4
3
4
4
3
4
5
4
4
4
3
4
3
3
5
5
4
4
2
3
5
3
4
6
3
6
4
2
4
4
3
5
3
4
5
4
4
3
2
5
5
4
3
4
4
4
4
5
4
3
5
4
3
3
6
4
5
4
4
3
4
...

result:

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

Server Time: 2024-12-03 04:42:28 | OpenSource Project