oj.uz

Submission #614576

# Submission time Handle Problem Language Result Execution time Memory
614576 2022-07-31T04:00:07 Z brucecccccc Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 468 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

int n;
vector<int> ans;

void set_element(int l, int r) {
  if (l == r) return;

  int m = (l + r) / 2;

  string x(n, '0');
  for (int i = 0; i < n; i++)
    if (i < l || i > r) x[i] = '1';

  for (int i = l; i <= m; i++) {
    string k = x;
    k[i] = '1';
    add_element(k);
  }

  set_element(l, m);
  set_element(m+1, r);
}

void get(int l, int r, vector<bool> pos) {
  if (l == r) {
    int val;
    for (int i = 0; i < n; i++)
      if (pos[i]) val = i;
    ans[val] = l;
    return;
  }

  vector<bool> left(n, false), right(n, false);
  string x(n, '0');
  for (int i = 0; i < n; i++)
    if (!pos[i]) x[i] = '1';
  
  for (int i = 0; i < n; i++) {
    if (pos[i]) {
      string j = x;
      j[i] = '1';
      if (check_element(j)) left[i] = true;
      else right[i] = true;
    }
  }
  int m = (l + r) / 2;
  get(l, m, left);
  get(m+1, r, right);
}

vector<int> restore_permutation(int N, int w, int r) {
  n = N;
  ans.resize(n);

  vector<bool> pos(n, true);

  set_element(0, n-1);
  compile_set();
  get(0, n-1, pos);

  return ans;
}

Compilation message

messy.cpp: In function 'void get(int, int, std::vector<bool>)':
messy.cpp:33:12: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |     ans[val] = l;
      |            ^

Subtask #1
20.0 / 20.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 128
2 Correct 2 ms 424 KB n = 128
3 Correct 2 ms 428 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 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 2 ms 468 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 3 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 2 ms 468 KB n = 128
4 Correct 2 ms 428 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 2 ms 404 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 2 ms 432 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 2 ms 432 KB n = 128
14 Correct 3 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128