Submission #1235271

#TimeUsernameProblemLanguageResultExecution timeMemory
1235271clemmy14Spring cleaning (CEOI20_cleaning)C++20
0 / 100
138 ms6172 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; if(n == 2) { leaves++; } 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...