Submission #1289646

#TimeUsernameProblemLanguageResultExecution timeMemory
1289646azradudukalayNorela (info1cup18_norela)C++20
0 / 100
33 ms568 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<int> b(m, 0); for(int i = 0; i < m; i++) { int k; cin >> k; for(int j = 0; j < k; j++) { int x; cin >> x; x--; b[i] |= 1 << x; } } int all = (1 << n) - 1; int en = m + 1; vector<int> ans; for(int mask = 0; mask < (1 << m); mask++) { int s = 0; vector<int> t; for(int i = 0; i < m; i++) { if(mask & (1 << i)) { s ^= b[i]; t.push_back(i + 1); } } if(s == all) { if(t.size() < en || (t.size() == en && t < ans)) { en = t.size(); ans = t; } } } cout << en << "\n"; for(int i = 0; i < ans.size(); i++) { if(i) cout << " "; cout << ans[i]; } cout << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...