oj.uz

Submission #1075050

# Submission time Handle Problem Language Result Execution time Memory
1075050 2024-08-25T17:56:00 Z matthew Norela (info1cup18_norela) C++17
100 / 100
 342 ms 596 KB 
#include <stdio.h>
#include <vector>

const int MAXM = 24;

std::vector<int> v[MAXM];

int res;

int popcount(int a) {
  int cnt = 0;
  while(a > 0) {
    cnt++;
    a &= a - 1;
  }
  return cnt;
}

void bkt(int pos, int m, int n, long long mask, int op) {
  if(pos >= m) {
    if(mask == (1LL << n) - 1 && popcount(op) <= popcount(res)) {
      res = op;
    }
  } else {
    int i;

    bkt(pos + 1, m, n, mask, op);

    op |= (1 << pos);
    for(i = 0; i < (int)v[pos].size(); i++) {
      mask ^= (1LL << (v[pos][i] - 1));
    }

    bkt(pos + 1, m, n, mask, op);
  }
}

int main() {
  #ifdef LOCAL
freopen("input.txt", "r", stdin);
  #endif

  int n, m, i, x, j, a, cnt;

  scanf("%d%d", &n, &m);
  for(i = 0; i < m; i++) {
    scanf("%d", &x);
    for(j = 0; j < x; j++) {
      scanf("%d", &a);
      v[i].push_back(a);
    }
  }

  res = (1 << m) - 1;
  bkt(0, m, n, 0, 0);
  
  x = popcount(res);
  printf("%d\n", x);
  cnt = 0;
  for(i = 0; i < x; i++) {
    while(!(res & 1)) {
      res >>= 1;
      cnt++;
    }
    printf("%d ", cnt + 1);
    res >>= 1;
    cnt++;
  }
  printf("\n");

  return 0;
}

Compilation message

norela.cpp: In function 'int main()':
norela.cpp:45:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |   scanf("%d%d", &n, &m);
      |   ~~~~~^~~~~~~~~~~~~~~~
norela.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     scanf("%d", &x);
      |     ~~~~~^~~~~~~~~~
norela.cpp:49:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |       scanf("%d", &a);
      |       ~~~~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 4 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 388 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 4 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 388 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 20 ms 348 KB Output is correct
8 Correct 35 ms 348 KB Output is correct
9 Correct 37 ms 348 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 30 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 4 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 388 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 20 ms 348 KB Output is correct
8 Correct 35 ms 348 KB Output is correct
9 Correct 37 ms 348 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 30 ms 348 KB Output is correct
12 Correct 46 ms 424 KB Output is correct
13 Correct 91 ms 348 KB Output is correct
14 Correct 85 ms 596 KB Output is correct
15 Correct 88 ms 348 KB Output is correct
16 Correct 80 ms 348 KB Output is correct
17 Correct 84 ms 348 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 4 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 388 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 20 ms 348 KB Output is correct
8 Correct 35 ms 348 KB Output is correct
9 Correct 37 ms 348 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 30 ms 348 KB Output is correct
12 Correct 46 ms 424 KB Output is correct
13 Correct 91 ms 348 KB Output is correct
14 Correct 85 ms 596 KB Output is correct
15 Correct 88 ms 348 KB Output is correct
16 Correct 80 ms 348 KB Output is correct
17 Correct 84 ms 348 KB Output is correct
18 Correct 192 ms 400 KB Output is correct
19 Correct 182 ms 344 KB Output is correct
20 Correct 278 ms 344 KB Output is correct
21 Correct 325 ms 348 KB Output is correct
22 Correct 342 ms 344 KB Output is correct
23 Correct 300 ms 408 KB Output is correct