| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 316598 | nafis_shifat | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 3 ms | 512 KiB |
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 <bits/stdc++.h>
#include "messy.h"
using namespace std;
vector<int> res;
int N;
void add(int l,int r) {
if(l == r) return;
string s;
for(int i = 0; i < N; i++) {
if(i >= l && i <= r) s+='0';
else s+='1';
}
int mid = l + r >> 1;
for(int i = l; i <= mid; i++) {
s[i] = '1';
add_element(s);
s[i] = '0';
}
add(l,mid);
add(mid + 1, r);
}
void check(int l,int r,vector<int> v) {
if(l == r) {
res[l] = v[0];
return;
}
string s;
for(int i = 0; i < N; i++) s += '1';
for(int i : v) s[i] = '0';
int mid = l + r >> 1;
vector<int> left,right;
for(int i : v) {
s[i] = '1';
if(check_element(s)) left.push_back(i);
else right.push_back(i);
s[i] = '0';
}
check(l,mid,left);
check(mid+1,r,right);
}
vector<int> restore_permutation(int n, int w, int r) {
N = n;
add(0,n-1);
compile_set();
vector<int> tmp(n);
iota(tmp.begin(),tmp.end(),0);
res.resize(n);
check(0,n-1,tmp);
vector<int> fr(n);
for(int i = 0; i < N; i++) {
fr[res[i]] = i;
}
return fr;
}
Compilation message (stderr)
| # | 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... | ||||
