# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467528 | LucaIlie | Norela (info1cup18_norela) | C11 | 16 ms | 264 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 <stdio.h>
#define MAX_M 24
long long spell[MAX_M];
int main() {
int n, m, k, p, minUsedSpells, usedSpells, solMask, mask, i, j;
long long xor;
scanf( "%d%d", &n, &m );
for ( i = 0; i < m; i++ ) {
scanf( "%d", &k );
spell[i] = 0;
for ( j = 0; j < k; j++ ) {
scanf( "%d", &p );
spell[i] += (1 << (p - 1));
}
}
minUsedSpells = m + 1;
solMask = -1;
for ( mask = 0; mask < (1 << m); mask++ ) {
xor = 0;
usedSpells = 0;
for ( i = 0; i < m; i++ ) {
if ( ((mask >> i) & 1) == 1 ) {
xor ^= spell[i];
usedSpells++;
}
}
if ( xor == (1 << n) - 1 ) {
if ( usedSpells < minUsedSpells ) {
minUsedSpells = usedSpells;
solMask = mask;
}
}
}
printf( "%d\n", minUsedSpells );
for ( i = 0; i < m; i++ ) {
if ( ((solMask >> i) & 1) == 1 )
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... |