# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1075031 | 2024-08-25T17:45:35 Z | raduv | Norela (info1cup18_norela) | C++17 | 14 ms | 600 KB |
#include <bits/stdc++.h> const int MAXM = 24; using namespace std; long long v[MAXM]; int main() { int n, m, q, bit, i, no, mn, mask, cmask; long long rez; scanf("%d%d", &n, &m); for( i = 0; i < m; i++ ){ scanf("%d", &q); while(q--){ scanf("%d", &bit); bit--; v[i] |= (1LL << bit); } } mn = m + 1; for( mask = 0; mask < (1 << m); mask++ ){ rez = no = 0; for( i = 0; i < m; i++ ){ if(mask & (1 << i)){ rez ^= v[i]; no++; } } if(rez == (1LL << n) - 1 && no < mn){ mn = no; cmask = mask; } } printf("%d\n", mn); for( i = 0; i < m; i++ ){ if(cmask & (1 << i)) printf("%d ", i + 1); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 600 KB | Output is correct |
2 | Correct | 14 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 600 KB | Output is correct |
4 | Correct | 12 ms | 348 KB | Output is correct |
5 | Correct | 13 ms | 436 KB | Output is correct |
6 | Incorrect | 13 ms | 344 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 600 KB | Output is correct |
2 | Correct | 14 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 600 KB | Output is correct |
4 | Correct | 12 ms | 348 KB | Output is correct |
5 | Correct | 13 ms | 436 KB | Output is correct |
6 | Incorrect | 13 ms | 344 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 600 KB | Output is correct |
2 | Correct | 14 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 600 KB | Output is correct |
4 | Correct | 12 ms | 348 KB | Output is correct |
5 | Correct | 13 ms | 436 KB | Output is correct |
6 | Incorrect | 13 ms | 344 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 600 KB | Output is correct |
2 | Correct | 14 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 600 KB | Output is correct |
4 | Correct | 12 ms | 348 KB | Output is correct |
5 | Correct | 13 ms | 436 KB | Output is correct |
6 | Incorrect | 13 ms | 344 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |