#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define N 100005
vector<int> adj[N];
int val[N], par[N], deg[N];
int ans;
int dfs(int node, int root)
{
int flag = 0;
par[node] = root;
for (auto i : adj[node])
{
if (i != root) flag ^= dfs(i, node);
}
if (adj[node].size() == 1) flag ^= 1;
val[node] = flag;
if (flag == 0) val[node] = 2;
ans += val[node];
return flag;
}
int32_t main()
{
fastio();
int n, q;
cin>>n>>q;
for (int i = 1; i < n; i++)
{
int u, v;
cin>>u>>v;
adj[u].pb(v);
adj[v].pb(u);
}
int flag = dfs(1, 0);
for (int i = 1; i <= n; i++)
deg[i] = adj[i].size();
ans -= val[1];
//cout<<flag<<sp<<ans<<endl;
while(q--)
{
int d;
cin>>d;
vector<int> v;
for (int i = 0; i < d; i++)
{
int node;
cin>>node;
if(deg[node] != 1)
{
flag ^= 1;
int curr = node;
while(curr != 1)
{
ans -= val[curr];
val[curr] = 3 - val[curr];
ans += val[curr];
curr = par[curr];
}
}
deg[node]++;
v.pb(node);
}
if (flag) cout<<-1<<endl;
else cout<<ans + d<<endl;
for (auto node : v)
{
deg[node]--;
if(deg[node] != 1)
{
flag ^= 1;
int curr = node;
while(curr != 1)
{
ans -= val[curr];
val[curr] = 3 - val[curr];
ans += val[curr];
curr = par[curr];
}
}
}
}
cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
27 ms |
3540 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
3412 KB |
Output is correct |
2 |
Correct |
9 ms |
3412 KB |
Output is correct |
3 |
Correct |
24 ms |
7424 KB |
Output is correct |
4 |
Correct |
24 ms |
6732 KB |
Output is correct |
5 |
Correct |
31 ms |
8140 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
961 ms |
3840 KB |
Output is correct |
2 |
Correct |
939 ms |
3764 KB |
Output is correct |
3 |
Correct |
502 ms |
13136 KB |
Output is correct |
4 |
Execution timed out |
1084 ms |
12268 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1089 ms |
4052 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
5708 KB |
Output is correct |
2 |
Correct |
46 ms |
5552 KB |
Output is correct |
3 |
Correct |
29 ms |
4132 KB |
Output is correct |
4 |
Correct |
44 ms |
5452 KB |
Output is correct |
5 |
Correct |
43 ms |
5556 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
7492 KB |
Output is correct |
2 |
Execution timed out |
1090 ms |
9148 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
27 ms |
3540 KB |
Output is correct |
3 |
Correct |
9 ms |
3412 KB |
Output is correct |
4 |
Correct |
9 ms |
3412 KB |
Output is correct |
5 |
Correct |
24 ms |
7424 KB |
Output is correct |
6 |
Correct |
24 ms |
6732 KB |
Output is correct |
7 |
Correct |
31 ms |
8140 KB |
Output is correct |
8 |
Correct |
961 ms |
3840 KB |
Output is correct |
9 |
Correct |
939 ms |
3764 KB |
Output is correct |
10 |
Correct |
502 ms |
13136 KB |
Output is correct |
11 |
Execution timed out |
1084 ms |
12268 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |