QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#296212 | #6307. Chase Game 2 | fhq_treap | WA | 10ms | 15512kb | C++14 | 753b | 2024-01-02 14:35:04 | 2024-01-02 14:35:04 |
Judging History
answer
//晦暗的宇宙,我们找不到光,看不见` 尽头,但我们永远都不会被黑色打倒。——Quinn葵因
#include<bits/stdc++.h>
#define ll long long
#define N 500005
int n;
int T;
using std::vector;
vector<int>G[N];
int main(){
scanf("%d",&T);
while(T -- ){
scanf("%d",&n);
for(int i = 1;i <= n;++i)G[i].clear();
for(int i = 1;i < n;++i){
int x,y;
scanf("%d%d",&x,&y);
G[x].push_back(x),G[y].push_back(x);
}
int cnt = 0;
bool flag = 0;
for(int i = 1;i <= n;++i)flag |= (G[i].size() == n - 1),cnt += (G[i].size() == 1);
if(flag)puts("-1");
else std::cout<<cnt - 1<<"\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 15420kb
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: 15512kb
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: 10ms
memory: 15484kb
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'