Submission #1010272

#TimeUsernameProblemLanguageResultExecution timeMemory
1010272aaaaaarrozUnscrambling a Messy Bug (IOI16_messy)C++17
38 / 100
2 ms604 KiB
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
bool exista(string s) {
  return check_element(s);
}
 
mt19937 rng(12345678);
 
vector<int> restore_permutation(int n, int w, int r) {
  vector<int> order(n);
  for (int i = 0; i < n; i++) {
    order[i] = i;
  }
  string s(n, '0');
  for (const auto &i : order) {
    s[i] = '1';
    add_element(s);
  }
  compile_set();
  bool ocupat[n] = {};
  vector<int> p(n);
 
  s = string(n, '0');
 
  for (const auto &i : order) {
    for (int j = 0; j < n; j++) {
      if (!ocupat[j]) {
        s[j] = '1';
        if (exista(s)) {
          p[j] = i;
          ocupat[j] = true;
          break;
        }
        s[j] = '0';
      }
    }
  }
 
  return p;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...