oj.uz

Submission #960052

# Submission time Handle Problem Language Result Execution time Memory
960052 2024-04-09T15:03:12 Z LucaLucaM Unscrambling a Messy Bug (IOI16_messy) C++17
49 / 100
 1 ms 440 KB 
#include <vector>
#include "messy.h"
#include <random>
#include <algorithm>

bool exista(std::string s) {
  return check_element(s);
}

std::mt19937 rng(12345678);

std::vector<int> restore_permutation(int n, int w, int r) {
  std::vector<int> order(n);
  for (int i = 0; i < n; i++) {
    order[i] = i;
  }
  std::shuffle(order.begin(), order.end(), rng);
  std::string s(n, '0');
  for (const auto &i : order) {
    s[i] = '1';
    add_element(s);
  }
  compile_set();
  bool ocupat[n] = {};
  std::vector<int> p(n);

  s = std::string(n, '0');

  for (const auto &i : order) {
    for (int j = 0; j < n; j++) {
      if (!ocupat[j]) {
        s[j] = '1';
        if (exista(s)) {
          p[j] = i;
          ocupat[j] = true;
          break;
        }
        s[j] = '0';
      }
    }
  }

  return p;
}

/**

4 16 16
2 1 3 0

**/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 436 KB n = 8
2 Correct 0 ms 344 KB n = 8
3 Correct 0 ms 344 KB n = 8
4 Correct 1 ms 348 KB n = 8
5 Correct 0 ms 344 KB n = 8
6 Correct 1 ms 348 KB n = 8
7 Correct 0 ms 348 KB n = 8
8 Correct 0 ms 348 KB n = 8
9 Correct 0 ms 344 KB n = 8
10 Correct 0 ms 348 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 0 ms 348 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 0 ms 440 KB n = 8
15 Correct 0 ms 348 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 32
2 Correct 1 ms 348 KB n = 32
3 Correct 0 ms 344 KB n = 32
4 Correct 0 ms 348 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 0 ms 348 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 1 ms 348 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 1 ms 348 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 0 ms 348 KB n = 32
14 Correct 0 ms 348 KB n = 32
15 Correct 0 ms 348 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 32
2 Correct 0 ms 348 KB n = 32
3 Correct 0 ms 348 KB n = 32
4 Correct 0 ms 348 KB n = 32
5 Correct 0 ms 376 KB n = 32
6 Correct 1 ms 348 KB n = 32
7 Correct 1 ms 440 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 0 ms 348 KB n = 32
10 Correct 1 ms 348 KB n = 32
11 Correct 0 ms 344 KB n = 32
12 Correct 0 ms 348 KB n = 32
13 Correct 1 ms 344 KB n = 32
14 Correct 1 ms 348 KB n = 32
15 Correct 0 ms 440 KB n = 32

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB grader returned WA
2 Halted 0 ms 0 KB -