#include <bits/stdc++.h>
using namespace std;
/*<DEBUG>*/
#define tem template <typename
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
~debug(){ cerr << endl; }
tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
tem T, typename U > _op (pair<T, U> i){
return *this << "< " << i.first << " , " << i.second << " >"; }
tem T> _op (itr<T> i){
*this << "{ ";
for(auto it = i.begin; it != i.end; it++){
*this << " , " + (it==i.begin?2:0) << *it;
}
return *this << " }";
}
#else
tem T> _op (const T&) { return *this; }
#endif
};
tem T>
string _ARR_(T* arr, int sz){
string ret = "{ " + to_string(arr[0]);
for(int i = 1; i < sz; i++) ret += " , " + to_string(arr[i]);
ret += " }"; return ret;
}
#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array
const int INF = 1e9 + 7, N = 2e5 + 10;
vector<int> adj[N];
int win[N], wout[N], in[N], out[N], add[N];
int ans = 0, n, q, d, cur,fst=0, leafs = 0, par[N], nin, nout;
bool was_leaf[N], leaf[N];
void dfs(int u, int p=fst){
par[u] = p;
in[u] = out[u] = 0;
for(int v : adj[u]){
if(v != p){
dfs(v, u);
in[u] += out[v];
}
}
if(adj[u].size() == 1){
in[u] = 0;
out[u] = 1;
++leafs;
leaf[u] = 1;
}else{
out[u] = (in[u]%2 ? 1 : 2);
}
ans += in[u];
win[u] = in[u];
wout[u] = out[u];
return;
}
void solve_subtask5();
int main()
{
FAST;
cin >> n >> q;
for(int i = 0; i < n-1; ++i){
int u, v; cin >> u >> v;
--u; --v;
adj[u].pb(v);
adj[v].pb(u);
}
bool bin_tree = 1;
if(__builtin_popcount(n) != 1) bin_tree = 0;
for(int i = 0; i < n; ++i){
if(adj[i].size() > 3) bin_tree = 0;
if(adj[fst].size() == 1 && adj[i].size() != 1) fst = i;
}
if(bin_tree){
solve_subtask5();
return 0;
}
cur = n-1;
while(q--){
cin >> d;
leafs=0;
ans = 0;
for(int i = 0; i < d; ++i){
cin >> add[i];
--add[i];
++cur;
adj[add[i]].pb(cur);
adj[cur].pb(add[i]);
}
ans = 0;
dfs(fst);
cout << (leafs%2 ? -1 : ans) << '\n';
for(int i = 0; i < d; ++i){
adj[add[i]].pop_back();
}
for(; cur >= n; --cur){
adj[cur].pop_back();
}
}
return 0;
}
void solve_subtask5(){
dfs(fst);
while(q--){
cur = n-1;
cin >> d;
for(int i = 0; i < d; ++i){
++cur;
cin >> add[i];
--add[i];
if(leaf[add[i]]){
was_leaf[i] = 1;
leaf[add[i]] = 0;
--leafs;
}
++leafs;
adj[add[i]].pb(cur);
in[cur] = 0;
out[cur] = 1;
int u = add[i];
while(1){
ans -= in[u];
in[u] = out[u] = 0;
for(int v : adj[u]){
if(v != par[u]){
in[u] += out[v];
}
}
out[u] = (in[u]%2 ? 1 : 2);
ans += in[u];
if(u == fst) break;
u = par[u];
}
}
cout << (leafs%2 ? -1 : ans) << '\n';
for(int i = 0; i < d; ++i){
adj[add[i]].pop_back();
if(was_leaf[i]){
leafs++;
leaf[add[i]] = 1;
was_leaf[i] = 0;
}
leafs--;
int u = add[i];
while(1){
ans += win[u] - in[u];
in[u] = win[u];
out[u] = wout[u];
if(u == fst) break;
u = par[u];
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4920 KB |
Output is correct |
2 |
Execution timed out |
1088 ms |
6356 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
10052 KB |
Output is correct |
2 |
Correct |
29 ms |
10108 KB |
Output is correct |
3 |
Correct |
42 ms |
10792 KB |
Output is correct |
4 |
Correct |
78 ms |
13980 KB |
Output is correct |
5 |
Correct |
97 ms |
16188 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
10656 KB |
Output is correct |
2 |
Correct |
30 ms |
11076 KB |
Output is correct |
3 |
Correct |
61 ms |
18472 KB |
Output is correct |
4 |
Correct |
101 ms |
22300 KB |
Output is correct |
5 |
Correct |
55 ms |
17304 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
282 ms |
6992 KB |
Output is correct |
2 |
Correct |
201 ms |
6840 KB |
Output is correct |
3 |
Correct |
277 ms |
6304 KB |
Output is correct |
4 |
Correct |
306 ms |
6892 KB |
Output is correct |
5 |
Correct |
264 ms |
7024 KB |
Output is correct |
6 |
Correct |
335 ms |
7180 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1091 ms |
8396 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1099 ms |
10316 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4920 KB |
Output is correct |
2 |
Execution timed out |
1088 ms |
6356 KB |
Time limit exceeded |