oj.uz

Submission #1081107

# Submission time Handle Problem Language Result Execution time Memory
1081107 2024-08-29T18:29:07 Z erray Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 604 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG 
  #include "/home/ioi/contests/ioi16d2/debug.h"
#else 
  #define debug(...) void(37)
#endif

#include "messy.h"

std::vector<int> restore_permutation(int N, int w, int r) {
    /*
    add_element("0");
    compile_set();
    check_element("0");
    return std::vector<int>();
    */
  {
    vector<vector<int>> sets;
    sets.emplace_back();
    for (int i = 0; i < N; ++i) sets[0].push_back(i);
    for (int l = N; l > 1; l >>= 1) {
      for (int j = 0; j * l < N; ++j) {
        for (int i = j * l + l / 2; i < (j + 1) * l; ++i) {
          string ask(N, '1');
          for (int k = j * l; k < (j + 1) * l; ++k) ask[k] = '0';
          ask[i] = '1'; 
          add_element(ask);
        }
      }
    }

  }
  debug("added");
  compile_set();
  vector<int> ans(N);
  {
    vector<vector<int>> sets;
    sets.emplace_back();
    for (int i = 0; i < N; ++i) sets[0].push_back(i);
    for (int l = N; l > 1; l >>= 1) {
      vector<vector<int>> next;
      for (int j = 0; j * l < N; ++j) {
        array<vector<int>, 2> lr;
        for (auto x : sets[j]) {
          string ask(N, '1');
          for (auto y : sets[j]) ask[y] = '0';
          ask[x] = '1';
          lr[check_element(ask)].push_back(x);  
        }
        next.push_back(lr[0]);
        next.push_back(lr[1]);
      }
      swap(next, sets);
    }
    for (int i = 0; i < N; ++i) ans[sets[i][0]] = i;
  }
  return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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