QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#303277#6307. Chase Game 2AH20WA 6ms3452kbC++14629b2024-01-12 01:46:442024-01-12 01:46:44

Judging History

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

  • [2024-01-12 01:46:44]
  • 评测
  • 测评结果:WA
  • 用时:6ms
  • 内存:3452kb
  • [2024-01-12 01:46:44]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;
const int maxm = 2e5+8;
int ct[maxm];
void solve(){
    int n;cin>>n;
    for(int i=1;i<=n;i++) ct[i] = 0;
    for(int i=1;i<n;i++){
        int u,v;cin>>u>>v;
        ct[u]++,ct[v]++;
    }
    int num = 0;
    for(int i=1;i<=n;i++){
        if(ct[i] == 1) ++num;
    }
    if(num == n-1 or (num == 2 and n == 2)){
        cout<<"-1\n";
    }
    //对菊花图,一定无解
    else{
        cout<<num-1<<"\n";
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T;cin>>T;
    while(T--) solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3448kb

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

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

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'