This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <vector>
#include "messy.h"
#include "bits/stdc++.h"
using namespace std;
std::vector<int> restore_permutation(int n, int w, int r) {
  //add_element("0");
  //compile_set();
  //check_element("0");
  vector<int> p(n);
  iota(p.begin(), p.end(), 0);
  string t(n, '1');
  for (int i = 0; i < n - 1; ++i) {
    t[i] = '0';
    add_element(t);
  }
  for (int i = 0; i < n; ++i) {
    t[i] = '1';
  }
  for (int i = n - 1; i > 0; --i) {
    t[i] = '0';
    add_element(t);
  }
  compile_set();
  for (int i = 0; i < n; ++i) {
    t[i] = '1';
  }
  int x = -1, y = -1;
  for (int i = 0; i < n; ++i) {
    t[i] = '0';
    if (!check_element(t)) {
      x = i;
      break;
    }
  }
  for (int i = 0; i < n; ++i) {
    t[i] = '1';
  }
  for (int i = n - 1; i >= 0; --i) {
    t[i] = '0';
    if (!check_element(t)) {
      y = i;
      break;
    }
  }
  if (x != -1) {
    assert(y != -1);
    swap(p[x], p[y]);
  }
  return p; 
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |