| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1222007 | LeonidCuk | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 1 ms | 584 KiB |
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
vector<int>res;
void dvqa(int l,int r,string &s)
{
if(l==r)return;
int m=(l+r)/2;
for(int i=l;i<=m;i++)
{
s[i]='1';
add_element(s);
s[i]='0';
}
for(int i=l;i<=m;i++)s[i]='1';
dvqa(m+1,r,s);
for(int i=l;i<=m;i++)s[i]='0';
for(int i=m+1;i<=r;i++)s[i]='1';
dvqa(l,m,s);
for(int i=m+1;i<=r;i++)s[i]='0';
}
void dvqc(int l,int r,string &s)
{
if(l==r)
{
for(int i=0;i<s.size();i++)
{
if(s[i]=='0')res[i]=l;
}
return;
}
vector<int>kec,nuli;
int m=(l+r)/2;
for(int i=0;i<s.size();i++)
{
if(s[i]=='1')continue;
s[i]='1';
if(check_element(s))kec.push_back(i);
else nuli.push_back(i);
s[i]='0';
}
for(auto i:kec)s[i]='1';
dvqc(m+1,r,s);
for(auto i:kec)s[i]='0';
for(auto i:nuli)s[i]='1';
dvqc(l,m,s);
for(auto i:nuli)s[i]='0';
}
vector<int> restore_permutation(int n, int w, int r)
{
res.resize(n);
string s;
for(int i=0;i<n;i++)s.push_back('0');
dvqa(0,n-1,s);
compile_set();
dvqc(0,n-1,s);
vector<int>ans=res;
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... | ||||
