oj.uz

답안 #868239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868239 2023-10-30T23:09:40 Z Hakiers Spring cleaning (CEOI20_cleaning) C++17
100 / 100
 222 ms 27604 KB 
#include <bits/stdc++.h>
using namespace std;
const int BASE = 1 << 17;
vector<int> G[BASE];
int dp[BASE];
int sajz[BASE];
int LAZY[BASE << 1];
int TREE[BASE << 1][2];
int path_end[BASE];
int pre[BASE];
int parent[BASE];
int depth[BASE];
int tajm;
int n, q;

void push(int v, int l, int r){
	
	if(!LAZY[v]) return;
	LAZY[l] ^= LAZY[v];
	LAZY[r] ^= LAZY[v];
	
	swap(TREE[l][0], TREE[l][1]);
	swap(TREE[r][0], TREE[r][1]);
	LAZY[v] = 0;
}

void add(int a, int b, int v, int l, int r, int x){
	if(b < l || r < a) return;
	else if(l <= a && b <= r){
		TREE[v][x] = 1;
	}
	else{
		int mid = (a+b)/2;
		push(v, 2*v, 2*v+1);
		add(a, mid, 2*v, l, r, x);
		add(mid+1, b, 2*v + 1, l, r, x);
		TREE[v][0] = TREE[2*v][0] + TREE[2*v+1][0];
		TREE[v][1] = TREE[2*v][1] + TREE[2*v+1][1];
	}
}

void update(int a, int b, int v, int l, int r, int x){
	if(b < l || r < a) return;
	else if(l <= a && b <= r){
		swap(TREE[v][0], TREE[v][1]);
		LAZY[v] ^= x;
	}
	else{
		int mid = (a+b)/2;
		push(v, 2*v, 2*v+1);
		update(a, mid, 2*v, l, r, x);
		update(mid +1, b, 2*v+1, l, r, x);
		TREE[v][0] = TREE[2*v][0] + TREE[2*v+1][0];
		TREE[v][1] = TREE[2*v][1] + TREE[2*v+1][1];
	}
}

pair<int, int> query(int a, int b, int v, int l, int r){
	if(b < l || r < a) return {0, 0};
	else if(l <= a && b <= r){
		return {TREE[v][0], TREE[v][1]};
	}
	else{
		int mid = (a+b)/2;
		push(v, 2*v, 2*v+1);
		pair<int, int> p1 = query(a, mid, 2*v, l, r);
		pair<int, int> p2 = query(mid+1, b, 2*v+1, l, r);
		
		return {p1.first+p2.first, p1.second+p2.second};
	}
}

void dfs_size(int v, int p){
	sajz[v] = 1;
	for(auto u : G[v]){
		if(u == p) continue;
		dfs_size(u, v);
		sajz[v] += sajz[u];
	}
}


void hld(int v, int p){
	pre[v] = ++tajm;
	parent[v] = p;
	depth[v] = depth[p] + 1;
	int maxpath = 0;
	for(auto u : G[v])
		if(u != p && sajz[u] > sajz[maxpath]) maxpath = u;
		
	
	if(maxpath){
		path_end[maxpath] = path_end[v];
		hld(maxpath, v);
	}
	
	for(auto u : G[v]){
		if(u == p || u == maxpath) continue;
		path_end[u] = u;
		hld(u, v);
	}
}

void dfs_dp(int v, int p){
	if(G[v].size() == 1)
		dp[v] = 1;
		
	for(auto u : G[v]){
		if(u == p) continue;
		dfs_dp(u, v);
		dp[v] += dp[u];
	}
	
	add(0, BASE-1, 1, pre[v], pre[v], (dp[v]&1));
}


void no(){
	cout << "-1\n";
}

void yes(int howadd){
	//pair<int, int> query2 = query(0, BASE-1, 1, pre[1]+1, BASE-1);
	pair<int, int> query2 = {TREE[1][0] - 1, TREE[1][1]};
	howadd += query2.first *2;
	howadd += query2.second;
	
	cout << howadd << "\n";
}

void zmien(int u, int v){

	if(depth[u] < depth[v]) swap(u, v);
	
	while(path_end[u] != path_end[v]){
		update(0, BASE-1, 1, pre[path_end[u]], pre[u], 1);
		u = parent[path_end[u]];
	}
	
	update(0, BASE-1, 1, pre[v], pre[u], 1);

}

void solve(){
	multiset<int> nodes;
	set<int> nodesS;
	vector<int> zmiany;
	int D;
	cin >> D;
	
	for(int i = 1; i <= D; i++){
		int v;
		cin >> v;
		nodes.insert(v);
		nodesS.insert(v);
	}
	
	int howadd = 0;
	for(auto v : nodesS){
		int countv = nodes.count(v);
		howadd += countv;
		if(G[v].size() == 1 && !(countv&1)){
			//cout << "v:" << v << "count" << countv << endl;
			zmien(1, v);
			zmiany.push_back(v);
		}
		else if(G[v].size() > 1 && countv&1){
			zmien(1, v);
			zmiany.push_back(v);
		}
	}
	
	pair<int, int> query1 = query(0, BASE-1, 1, pre[1], pre[1]);
	
	if(!query1.first) no();
	else yes(howadd);
	
	for(auto v : zmiany)
		zmien(1, v);
	
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> q;
	for(int i = 1; i < n; i++){
		int a, b;
		cin >> a >> b;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	
	dfs_size(1, 1);
	hld(1, 1);
	dfs_dp(1, 1);
	
	while(q--)
		solve();

}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 133 ms 8776 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 11352 KB Output is correct
2 Correct 31 ms 11424 KB Output is correct
3 Correct 43 ms 13004 KB Output is correct
4 Correct 81 ms 17740 KB Output is correct
5 Correct 101 ms 19556 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 12112 KB Output is correct
2 Correct 32 ms 12116 KB Output is correct
3 Correct 61 ms 20204 KB Output is correct
4 Correct 113 ms 26192 KB Output is correct
5 Correct 60 ms 18724 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 9264 KB Output is correct
2 Correct 43 ms 9244 KB Output is correct
3 Correct 15 ms 8536 KB Output is correct
4 Correct 13 ms 9052 KB Output is correct
5 Correct 16 ms 9308 KB Output is correct
6 Correct 62 ms 9688 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 10916 KB Output is correct
2 Correct 194 ms 10944 KB Output is correct
3 Correct 157 ms 10320 KB Output is correct
4 Correct 191 ms 12176 KB Output is correct
5 Correct 222 ms 12120 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 12800 KB Output is correct
2 Correct 126 ms 17472 KB Output is correct
3 Correct 175 ms 16724 KB Output is correct
4 Correct 158 ms 18000 KB Output is correct

Subtask #7
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 133 ms 8776 KB Output is correct
3 Correct 30 ms 11352 KB Output is correct
4 Correct 31 ms 11424 KB Output is correct
5 Correct 43 ms 13004 KB Output is correct
6 Correct 81 ms 17740 KB Output is correct
7 Correct 101 ms 19556 KB Output is correct
8 Correct 32 ms 12112 KB Output is correct
9 Correct 32 ms 12116 KB Output is correct
10 Correct 61 ms 20204 KB Output is correct
11 Correct 113 ms 26192 KB Output is correct
12 Correct 60 ms 18724 KB Output is correct
13 Correct 63 ms 9264 KB Output is correct
14 Correct 43 ms 9244 KB Output is correct
15 Correct 15 ms 8536 KB Output is correct
16 Correct 13 ms 9052 KB Output is correct
17 Correct 16 ms 9308 KB Output is correct
18 Correct 62 ms 9688 KB Output is correct
19 Correct 133 ms 10916 KB Output is correct
20 Correct 194 ms 10944 KB Output is correct
21 Correct 157 ms 10320 KB Output is correct
22 Correct 191 ms 12176 KB Output is correct
23 Correct 222 ms 12120 KB Output is correct
24 Correct 180 ms 12800 KB Output is correct
25 Correct 126 ms 17472 KB Output is correct
26 Correct 175 ms 16724 KB Output is correct
27 Correct 158 ms 18000 KB Output is correct
28 Correct 145 ms 12172 KB Output is correct
29 Correct 138 ms 16628 KB Output is correct
30 Correct 91 ms 20928 KB Output is correct
31 Correct 117 ms 27604 KB Output is correct
32 Correct 199 ms 12112 KB Output is correct
33 Correct 144 ms 15696 KB Output is correct
34 Correct 159 ms 17492 KB Output is correct
35 Correct 171 ms 17572 KB Output is correct