#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vii vector<pii>
#define siz(x) (int)x.size()
#define pb push_back
#define rep(i,x) for(int i=0; i<x; i++)
#define rep1(i,x) for(int i=1; i<=x; i++)
using namespace std;
const int inf = 1e9, maxn = 1e5+5, mod = 1e9+7;
int n,q,ileparzystych,ilelisci,korzen = 1;
int liscie[maxn];
bool parzyste[maxn];
int parent[maxn];
int aktsiz[maxn];
vi graf[maxn];
void DFS(int v, int p){
parent[v] = p;
if(siz(graf[v])==1){liscie[v] = 1;ilelisci++;}
for(auto u:graf[v])if(u!=p){
DFS(u,v);
liscie[v]+=liscie[u];
}
parzyste[v] = !(liscie[v]%2);
if(parzyste[v] && v!=korzen)ileparzystych++;
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>q;
rep(i,n-1){
int a,b;
cin>>a>>b;
graf[a].pb(b);
graf[b].pb(a);
aktsiz[a]++;
aktsiz[b]++;
}
DFS(korzen,0);
rep(i,q){
int d;
cin>>d;
vi a(d);
int dojeden = 0;
rep(j,d){
cin>>a[j];
int x = a[j];
if(aktsiz[x] > 1)ilelisci++;
if(aktsiz[x] > 1)
while(x!=korzen){
parzyste[x] = !parzyste[x];
if(parzyste[x])ileparzystych++;
else ileparzystych--;
x = parent[x];
}
aktsiz[x]++;
}
if((ilelisci)&1)cout<<-1<<'\n';
else cout<<n-1+d+ileparzystych<<'\n';
rep(j,d){
int x = a[j];
if(aktsiz[x] > 1)ilelisci--;
if(aktsiz[x] > 1)
while(x!=korzen){
parzyste[x] = !parzyste[x];
if(parzyste[x])ileparzystych++;
else ileparzystych--;
x = parent[x];
}
aktsiz[x]--;
}
}
}
Compilation message
cleaning.cpp: In function 'int32_t main()':
cleaning.cpp:48:13: warning: unused variable 'dojeden' [-Wunused-variable]
48 | int dojeden = 0;
| ^~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4696 KB |
Output is correct |
2 |
Incorrect |
25 ms |
5540 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
5464 KB |
Output is correct |
2 |
Correct |
6 ms |
5720 KB |
Output is correct |
3 |
Correct |
17 ms |
9108 KB |
Output is correct |
4 |
Correct |
18 ms |
8400 KB |
Output is correct |
5 |
Correct |
22 ms |
9680 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
744 ms |
5724 KB |
Output is correct |
2 |
Correct |
745 ms |
5720 KB |
Output is correct |
3 |
Correct |
393 ms |
14416 KB |
Output is correct |
4 |
Execution timed out |
1031 ms |
14168 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1064 ms |
5980 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
7892 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
54 ms |
9296 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4696 KB |
Output is correct |
2 |
Incorrect |
25 ms |
5540 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |