oj.uz

Submission #727232

# Submission time Handle Problem Language Result Execution time Memory
727232 2023-04-20T09:16:15 Z Alex_tz307 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

void divideAdd(int l, int r, string hint) {
  if (l == r) {
    return;
  }

  int mid = (l + r) / 2;

  for (int i = l; i <= mid; ++i) {
    hint[i] = '1';
    add_element(hint);
    hint[i] = '0';
  }

  for (int i = mid + 1; i <= r; ++i) {
    hint[i] = '1';
  }

  divideAdd(l, mid, hint);

  for (int i = mid + 1; i <= r; ++i) {
    hint[i] = '0';
  }

  for (int i = l; i <= mid; ++i) {
    hint[i] = '1';
  }

  divideAdd(mid + 1, r, hint);
}

vector<int> perm;

void divideRestore(int l, int r, string hint, const vector<int> &pos) {
  if (l == r) {
    perm[pos[0]] = l;
    return;
  }

  vector<int> left, right;

  for (const int &p : pos) {
    hint[p] = '1';

    if ((int)left.size() == (r - l + 1) / 2) {
      right.emplace_back(p);
    } else if ((int)right.size() == (r - l + 1) / 2 || check_element(hint)) {
      left.emplace_back(p);
    } else {
      right.emplace_back(p);
    }

    hint[p] = '0';
  }

  int mid = (l + r) / 2;

  for (const int &p : right) {
    hint[p] = '1';
  }

  divideRestore(l, mid, hint, left);

  for (const int &p : right) {
    hint[p] = '0';
  }

  for (const int &p : left) {
    hint[p] = '1';
  }

  divideRestore(mid + 1, r, hint, right);
}

vector<int> restore_permutation(int n, int w, int r) {
  divideAdd(0, n - 1, string(n, '0'));

  compile_set();

  vector<int> pos(n);
  iota(pos.begin(), pos.end(), 0);
  random_shuffle(pos.begin(), pos.end());

  perm.resize(n);
  divideRestore(0, n - 1, string(n, '0'), pos);

  return perm;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 1 ms 428 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 428 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 1 ms 428 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 424 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 420 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 1 ms 428 KB n = 128