# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1074956 | raduv | Norela (info1cup18_norela) | C++17 | 19 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
const int MAXM = 24;
const int MAXN = 60;
using namespace std;
long long v[MAXM];
signed main()
{
int n, m, q, bit, i, no, mn;
long long rez, mask, cmask;
scanf("%d%d", &n, &m);
for( i = 0; i < m; i++ ){
scanf("%d", &q);
while(q--){
scanf("%d", &bit);
bit--;
v[i] |= (1 << bit);
}
}
mn = m + 1;
cmask = 0;
for( mask = 0; mask < (1 << m); mask++ ){
rez = 0;
for( i = 0; i < m; i++ ){
if(mask & (1 << i)){
rez ^= v[i];
}
}
if(__builtin_popcount(rez) == n && __builtin_popcount(mask) < mn){
mn = __builtin_popcount(mask);
cmask = mask;
}
}
printf("%d\n", mn);
for( i = 0; i < m; i++ ){
if(cmask & (1 << i))
printf("%d ", i + 1);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |