제출 #1235265

#제출 시각아이디문제언어결과실행 시간메모리
1235265clemmy14Spring cleaning (CEOI20_cleaning)C++20
0 / 100
132 ms6204 KiB
#include<bits/stdc++.h>
using namespace std;

vector<vector<int>> adj;

signed main() {
    int n, q; cin >> n >> q;
    adj = vector<vector<int>>(n+1);
    for(int i=1; i<n; i++) {
        int a, b; cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    while(q--) {
        int d; cin >> d;
        map<int, int> m;
        for(int i=0; i<d; i++) {
            int a; cin >> a;
            m[a]++;
        }
        int leaves=n-1, ans=0;
        for(auto x : m) {
            leaves--;
            leaves+=x.second;
            if(x.second%2 == 1) ans++;
            ans+=x.second;
        }
        ans+=n-1-m.size();
        if(leaves%2 == 1) cout << "-1\n";
        else cout << ans << '\n';
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...