oj.uz

Submission #1089038

# Submission time Handle Problem Language Result Execution time Memory
1089038 2024-09-15T19:33:28 Z vjudge1 Izbori (COCI17_izbori) C++17
40 / 80
 201 ms 432 KB 
/* https://oj.uz/problem/view/COCI17_izbori?locale=en: WA */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

unsigned int popcnt(unsigned int x) {
  unsigned int out = 0;
  while (x) {
    ++out;
    x &= x - 1;
  }
  return out;
}

int main(void) {
  unsigned int N, M, K, i;
  unsigned int *priorities;
  unsigned int *scores;
  unsigned int best;
  (void) scanf("%u %u %u", &N, &M, &K);
  best = M - 1;
  priorities = (unsigned int *) calloc(N*M, sizeof(*priorities));
  scores = (unsigned int *) calloc(M, sizeof(*scores));
  for (i = 0; i < N*M; ++i)
    (void) scanf(" %u", &priorities[i]);
  for (i = 0; i < (1 << M)-1; ++i) {
    unsigned int j, k, l;
    memset(scores, 0, sizeof(*scores) * M);
    for (j = 0; j < N; ++j) {
      l = M;
      for (k = 0; k < M; ++k)
        if ((~i & (1<<(priorities[j*M+k]-1))) && l == M)
          l = priorities[j*M+k]-1;
      ++scores[l];
    }
    k = 0;
    for (j = 1; j < M; ++j)
      if (scores[j] > scores[k])
        k = j;
    if (i == 0)
      printf("%u\n", k + 1);
    if (k == K-1)
      best = popcnt(i);
  }
  printf("%u\n", best);
  return EXIT_SUCCESS;
}

Compilation message

izbori.cpp: In function 'int main()':
izbori.cpp:27:17: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   27 |   for (i = 0; i < (1 << M)-1; ++i) {
      |               ~~^~~~~~~~~~~~
izbori.cpp:21:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   (void) scanf("%u %u %u", &N, &M, &K);
      |          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
izbori.cpp:26:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     (void) scanf(" %u", &priorities[i]);
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
40.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 9 ms 348 KB Partially correct
2 Partially correct 9 ms 424 KB Partially correct
3 Partially correct 4 ms 348 KB Partially correct
4 Partially correct 35 ms 348 KB Partially correct
5 Partially correct 7 ms 348 KB Partially correct
6 Partially correct 4 ms 424 KB Partially correct
7 Partially correct 1 ms 344 KB Partially correct
8 Partially correct 15 ms 424 KB Partially correct
9 Partially correct 22 ms 348 KB Partially correct
10 Partially correct 1 ms 348 KB Partially correct
11 Partially correct 17 ms 424 KB Partially correct
12 Partially correct 84 ms 408 KB Partially correct
13 Partially correct 169 ms 348 KB Partially correct
14 Partially correct 79 ms 348 KB Partially correct
15 Partially correct 18 ms 424 KB Partially correct
16 Partially correct 200 ms 432 KB Partially correct
17 Partially correct 85 ms 348 KB Partially correct
18 Partially correct 187 ms 408 KB Partially correct
19 Partially correct 200 ms 420 KB Partially correct
20 Partially correct 201 ms 344 KB Partially correct