oj.uz

답안 #792767

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792767 2023-07-25T08:35:46 Z ymm Spring cleaning (CEOI20_cleaning) C++17
100 / 100
 154 ms 21224 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
typedef long long ll;
typedef std::pair<int,int> pii;
using namespace std;

const int N = 100'010;
vector<int> A[N];
int rt;
int cnt[N];
int height[N];
int par[N];

struct seg {
	struct node {
		int cnt;
		bool rev;
	};
	node *t;
	int l, r;

	void init(int b, int e) {
		l = b;
		r = e;
		t = new node[(r-l)*4]{};
	}

	void merge(int i, int b, int e) {
		t[i].cnt = t[2*i+1].cnt + t[2*i+2].cnt;
		t[i].cnt = t[i].rev? e-b-t[i].cnt: t[i].cnt;
	}

	void up(int l, int r, int i, int b, int e) {
		if (l <= b && e <= r) {
			t[i].cnt = e-b-t[i].cnt;
			t[i].rev = !t[i].rev;
			return;
		}
		if (l < (b+e)/2)
			up(l, r, 2*i+1, b, (b+e)/2);
		if ((b+e)/2 < r)
			up(l, r, 2*i+2, (b+e)/2, e);
		merge(i, b, e);
	}
	int up(int lst) {
		int tmp = t[0].cnt;
		up(l, lst+1, 0, l, r);
		return t[0].cnt - tmp;
	}
};

struct {
	int rt;
	int sz;
	int ch;
	seg sg;
} hv[N];

void dfs0(int v, int p)
{
	cnt[v] = 1;
	hv[v].ch = -1;
	for (int u : A[v]) {
		if (u == p)
			continue;
		dfs0(u, v);
		cnt[v] += cnt[u];
		if (hv[v].ch == -1 || cnt[u] > cnt[hv[v].ch])
			hv[v].ch = u;
	}
}

int Ans = 0;
int cntlf = 0;

void dfs1(int v, int p, int rt, int h)
{
	par[v] = p;
	height[v] = h;
	hv[v].rt = rt;
	hv[rt].sz++;
	for (int u : A[v]) {
		if (u == p)
			continue;
		dfs1(u, v, u == hv[v].ch? rt: u, h+1);
	}
	if (hv[v].rt == v) {
		hv[v].sg.init(height[v], height[v] + hv[v].sz);
		Ans += hv[v].sg.up(height[v] + hv[v].sz - 1);
	}
}

void up(int v)
{
	while (v != -1) {
		int rt = hv[v].rt;
		Ans += hv[rt].sg.up(height[v]);
		v = par[rt];
	}
}

void add(int v)
{
	A[v].push_back(-1);
	if (A[v].size() == 2)
		return;
	++cntlf;
	up(v);
}
void rem(int v)
{
	A[v].pop_back();
	if (A[v].size() == 1)
		return;
	--cntlf;
	up(v);
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	int n, q;
	cin >> n >> q;
	Loop (i,1,n) {
		int v, u;
		cin >> v >> u;
		--v; --u;
		A[v].push_back(u);
		A[u].push_back(v);
	}
	dfs0(0, -1);
	dfs1(0, -1, 0, 0);
	Loop (i,0,n) {
		if (A[i].size() != 1)
			continue;
		up(i);
		cntlf += 1;
	}
	while (q--) {
		int k;
		cin >> k;
		vector<int> a(k);
		for (int &v : a) {
			cin >> v;
			--v;
		}
		for (int v : a)
			add(v);
		if (cntlf%2 == 1)
			cout << "-1\n";
		else
			cout << Ans-1 + n-1 + k << '\n';
		for (int v : a)
			rem(v);
	}
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 37 ms 5496 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4232 KB Output is correct
2 Correct 16 ms 4240 KB Output is correct
3 Correct 63 ms 15540 KB Output is correct
4 Correct 32 ms 12228 KB Output is correct
5 Correct 45 ms 15984 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 4868 KB Output is correct
2 Correct 39 ms 4836 KB Output is correct
3 Correct 48 ms 21224 KB Output is correct
4 Correct 98 ms 20264 KB Output is correct
5 Correct 32 ms 19604 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 6312 KB Output is correct
2 Correct 18 ms 5396 KB Output is correct
3 Correct 10 ms 5200 KB Output is correct
4 Correct 11 ms 5648 KB Output is correct
5 Correct 16 ms 5936 KB Output is correct
6 Correct 32 ms 5828 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 10740 KB Output is correct
2 Correct 118 ms 10652 KB Output is correct
3 Correct 48 ms 6912 KB Output is correct
4 Correct 78 ms 10580 KB Output is correct
5 Correct 77 ms 10536 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 15280 KB Output is correct
2 Correct 109 ms 18008 KB Output is correct
3 Correct 118 ms 16884 KB Output is correct
4 Correct 108 ms 18012 KB Output is correct

Subtask #7
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 37 ms 5496 KB Output is correct
3 Correct 10 ms 4232 KB Output is correct
4 Correct 16 ms 4240 KB Output is correct
5 Correct 63 ms 15540 KB Output is correct
6 Correct 32 ms 12228 KB Output is correct
7 Correct 45 ms 15984 KB Output is correct
8 Correct 33 ms 4868 KB Output is correct
9 Correct 39 ms 4836 KB Output is correct
10 Correct 48 ms 21224 KB Output is correct
11 Correct 98 ms 20264 KB Output is correct
12 Correct 32 ms 19604 KB Output is correct
13 Correct 46 ms 6312 KB Output is correct
14 Correct 18 ms 5396 KB Output is correct
15 Correct 10 ms 5200 KB Output is correct
16 Correct 11 ms 5648 KB Output is correct
17 Correct 16 ms 5936 KB Output is correct
18 Correct 32 ms 5828 KB Output is correct
19 Correct 74 ms 10740 KB Output is correct
20 Correct 118 ms 10652 KB Output is correct
21 Correct 48 ms 6912 KB Output is correct
22 Correct 78 ms 10580 KB Output is correct
23 Correct 77 ms 10536 KB Output is correct
24 Correct 110 ms 15280 KB Output is correct
25 Correct 109 ms 18008 KB Output is correct
26 Correct 118 ms 16884 KB Output is correct
27 Correct 108 ms 18012 KB Output is correct
28 Correct 88 ms 10216 KB Output is correct
29 Correct 111 ms 17204 KB Output is correct
30 Correct 87 ms 15992 KB Output is correct
31 Correct 122 ms 20372 KB Output is correct
32 Correct 87 ms 10716 KB Output is correct
33 Correct 109 ms 14608 KB Output is correct
34 Correct 154 ms 17444 KB Output is correct
35 Correct 136 ms 17308 KB Output is correct