/* author : Dinmukhammed ^_^ */
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define sz size()
#define ll long long
#define ld long double
const int N=1e6+3;
const ll inf=1e18;
const ll MOD=1e9+7;
bool has[N];
void Main(){
int n,q;cin>>n>>q;
for(int i=1;i<n;i++){
int a,b;cin>>a>>b;
}
while(q--){
int d;cin>>d;
int cnt=n-1;
ll ans=n-1;
int num;
for(int i=1;i<=d;i++){
cin>>num;
if(!has[num])cnt--;
cnt++;
has[num]=1;
}
ans+=d;
if(cnt&1)cout<<-1;
else cout<<ans;
}
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int tt=1;
// cin>>tt;
while(tt--)Main(),cout<<"\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |