#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
const int N=1e5+5;
int n, q, deg[N];
vector<int> adj[N];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> q;
for(int i=1; i<n; i++){
int u, v;
cin >> u >> v;
adj[u].emplace_back(v);
adj[v].emplace_back(u);
deg[u]++;
deg[v]++;
}
int __=1;
while(__++<=q){
multiset<int> ms;
int d;
cin >> d;
for(int i=1; i<=d; i++){
int x;
cin >> x;
ms.emplace(x);
}
vector<int> num(ms.begin(),ms.end());
int sz=num.size();
vector<int> real;
int ans=d+n-1;
for(int i=0; i<sz; i++){
int cnt=0;
int j=i;
while(num[j]==num[i]) cnt++,j++;
if(cnt%2) real.emplace_back(num[i]);
i=j-1;
}
int szz=real.size();
if(szz%2){
cout << -1 << "\n";
continue;
}
for(int i=0; i<szz; i+=2){
ans+=real[i+1]-real[i];
}
cout << ans << "\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... |