제출 #1228176

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1228176		Turkhuu	Spring cleaning (CEOI20_cleaning)	C++20	28 / 100	1096 ms	14484 KiB

cleaning

#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ROF(i, a, b) for (auto i = (a); i >= (b); i--)
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
bool seen[N];
int par[N], sz[N], even = 0;
vector<int> ch[N];
void dfs(int x) {
    if ((int)ch[x].size() + (x != 1) == 1) sz[x] = 1;
    for (int y : ch[x]) {
        ch[y].erase(find(ch[y].begin(), ch[y].end(), par[y] = x));
        dfs(y);
        sz[x] += sz[y];
    }
    if (sz[x] % 2 == 0) even++;
}
void add(int x, int z) {
    for (int y = x; y; y = par[y]) {
        even += sz[y] % 2 == 0 ? -1 : 1;
        sz[y] += z;
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;
    FOR(i, 1, n - 1) {
        int a, b;
        cin >> a >> b;
        ch[a].push_back(b);
        ch[b].push_back(a);
    }
    dfs(1);
    while (q--) {
        int D;
        cin >> D;
        vector<int> a(D);
        for (auto& x : a) {
            cin >> x;
            add(x, 1);
            if (!seen[x] && ch[x].size() + (x != 1) == 1)
                add(x, -1), seen[x] = 1;
        }
        cout << (sz[1] % 2 ? -1 : n - 1 + D + even - 1) << "\n";
        for (int x : a) {
            add(x, -1);
            if (seen[x] && ch[x].size() + (x != 1) == 1)
                add(x, 1), seen[x] = 0;
        }
    }
    return 6/22;
}

• Subtask 1: 0 / 0
• Subtask 2: 9 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 16
• Subtask 5: 19 / 19
• Subtask 6: 0 / 17
• Subtask 7: 0 / 30