제출 #1081107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1081107		erray	Unscrambling a Messy Bug (IOI16_messy)	C++17	100 / 100	2 ms	604 KiB

messy

#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 / 20
• Subtask 2: 18 / 18
• Subtask 3: 11 / 11
• Subtask 4: 21 / 21
• Subtask 5: 30 / 30