QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#134902 | #6307. Chase Game 2 | yzhang | WA | 5ms | 30304kb | C++14 | 1.5kb | 2023-08-05 09:50:55 | 2023-08-05 09:50:57 |
Judging History
answer
//μ's forever
#include <bits/stdc++.h>
#define N 1000005
//#define getchar nc
using namespace std;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
register int x=0,f=1;register char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return x*f;
}
inline void write(register int x)
{
if(!x)putchar('0');if(x<0)x=-x,putchar('-');
static int sta[20];register int tot=0;
while(x)sta[tot++]=x%10,x/=10;
while(tot)putchar(sta[--tot]+48);
}
int T,n,deg[N];
vector<int> v[N];
int dep[N];
void dfs(int x,int f){
dep[x]=dep[f]+1;
for(int i=0;i<(int)v[x].size();++i)
if(v[x][i]!=f)
dfs(v[x][i],x);
}
int main()
{
T=read();
while(T--){
n=read();
for(int i=1;i<=n;++i) deg[i]=0,v[i].clear();
for(int i=1;i<n;++i){
int x=read(),y=read();
v[x].push_back(y);
v[y].push_back(x);
++deg[x],++deg[y];
}
dfs(1,0);
int pos=0,d=0;
for(int i=1;i<=n;++i) if(dep[i]>d) d=dep[i],pos=i;
dfs(pos,0);
d=0;
for(int i=1;i<=n;++i) if(dep[i]>d) d=dep[i];
if(d<=3){
puts("-1");
}else{
int ans=0;
for(int i=1;i<=n;++i) if(deg[i]==1) ++ans;
printf("%d\n",ans-1);
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 5ms
memory: 30304kb
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: 5ms
memory: 28248kb
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: 2ms
memory: 28192kb
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'