| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 411618 | nxteru | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 3 ms | 804 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 "messy.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>ans;
void add(vector<int>x,string s){
if(x.size()==1)return;
vector<int>a,b;
for(int i=0;i<x.size()/2;i++)a.push_back(x[i]);
for(int i=x.size()/2;i<x.size();i++)b.push_back(x[i]);
for(auto i:a){
s[i]='1';
add_element(s);
s[i]='0';
}
for(auto i:b)s[i]='1';
add(a,s);
for(auto i:b)s[i]='0';
for(auto i:a)s[i]='1';
add(b,s);
}
void check(vector<int>x,string s,int l,int r){
if(l==r){
ans[x[0]]=l;
return;
}
int m=(l+r)/2;
vector<int>a,b;
for(auto i:x){
s[i]='1';
if(check_element(s))a.push_back(i);
else b.push_back(i);
s[i]='0';
}
for(auto i:b)s[i]='1';
check(a,s,l,m);
for(auto i:b)s[i]='0';
for(auto i:a)s[i]='1';
check(b,s,m,r);
}
vector<int> restore_permutation(int n, int w, int r) {
string s;
for(int i=0;i<n;i++)s+='0';
vector<int>x;
for(int i=0;i<n;i++)x.push_back(i);
add(x,s);
compile_set();
ans.resize(n);
check(x,s,0,n);
return ans;
}
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... | ||||
