#include<bits/stdc++.h>
#include "messy.h"
using namespace std;
int n;
vector<int>rez;
void build(int st,int dr)
{
if (st==dr)
return ;
string ans=string(n,'0');
int i;
for(i=st;i<=dr;i++)
ans[i]='1';
int mij=(st+dr)/2;
for(i=st;i<=mij;i++){
ans[i]='0';
add_element(ans);
ans[i]='1';
}
build(st,mij);
build(mij+1,dr);
}
void solve(int st,int dr,vector<int>&v)
{
if (st==dr){
rez[v[0]]=st;
return ;
}
vector<int>vst,vdr;
string aux=string(n,'0');
for(auto it:v)
aux[it]='1';
for(auto it:v){
aux[it]='0';
if (check_element(aux))
vst.push_back(it);
else
vdr.push_back(it);
aux[it]='1';
}
int mij=(st+dr)/2;
solve(st,mij,vst);
solve(mij+1,dr,vdr);
}
vector<int> restore_permutation(int n2,int w,int r)
{
n=n2;
vector<int>aux(n);
iota(aux.begin(),aux.end(),0);
rez.resize(n);
build(0,n-1);
compile_set();
solve(0,n-1,aux);
return rez;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
n = 8 |
2 |
Correct |
1 ms |
364 KB |
n = 8 |
3 |
Correct |
1 ms |
364 KB |
n = 8 |
4 |
Correct |
1 ms |
364 KB |
n = 8 |
5 |
Correct |
1 ms |
364 KB |
n = 8 |
6 |
Correct |
1 ms |
364 KB |
n = 8 |
7 |
Correct |
1 ms |
364 KB |
n = 8 |
8 |
Correct |
1 ms |
364 KB |
n = 8 |
9 |
Correct |
1 ms |
364 KB |
n = 8 |
10 |
Correct |
1 ms |
364 KB |
n = 8 |
11 |
Correct |
1 ms |
364 KB |
n = 8 |
12 |
Correct |
1 ms |
364 KB |
n = 8 |
13 |
Correct |
1 ms |
364 KB |
n = 8 |
14 |
Correct |
1 ms |
364 KB |
n = 8 |
15 |
Correct |
1 ms |
364 KB |
n = 8 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
n = 32 |
2 |
Correct |
1 ms |
364 KB |
n = 32 |
3 |
Correct |
1 ms |
364 KB |
n = 32 |
4 |
Correct |
1 ms |
364 KB |
n = 32 |
5 |
Correct |
1 ms |
364 KB |
n = 32 |
6 |
Correct |
1 ms |
364 KB |
n = 32 |
7 |
Correct |
1 ms |
364 KB |
n = 32 |
8 |
Correct |
1 ms |
364 KB |
n = 32 |
9 |
Correct |
1 ms |
364 KB |
n = 32 |
10 |
Correct |
1 ms |
364 KB |
n = 32 |
11 |
Correct |
1 ms |
364 KB |
n = 32 |
12 |
Correct |
1 ms |
364 KB |
n = 32 |
13 |
Correct |
1 ms |
364 KB |
n = 32 |
14 |
Correct |
1 ms |
364 KB |
n = 32 |
15 |
Correct |
1 ms |
364 KB |
n = 32 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
n = 32 |
2 |
Correct |
1 ms |
364 KB |
n = 32 |
3 |
Correct |
1 ms |
364 KB |
n = 32 |
4 |
Correct |
1 ms |
364 KB |
n = 32 |
5 |
Correct |
1 ms |
364 KB |
n = 32 |
6 |
Correct |
1 ms |
364 KB |
n = 32 |
7 |
Correct |
1 ms |
364 KB |
n = 32 |
8 |
Correct |
1 ms |
364 KB |
n = 32 |
9 |
Correct |
1 ms |
364 KB |
n = 32 |
10 |
Correct |
1 ms |
364 KB |
n = 32 |
11 |
Correct |
1 ms |
364 KB |
n = 32 |
12 |
Correct |
1 ms |
364 KB |
n = 32 |
13 |
Correct |
1 ms |
364 KB |
n = 32 |
14 |
Correct |
1 ms |
364 KB |
n = 32 |
15 |
Correct |
1 ms |
364 KB |
n = 32 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
492 KB |
n = 128 |
2 |
Correct |
2 ms |
492 KB |
n = 128 |
3 |
Correct |
2 ms |
492 KB |
n = 128 |
4 |
Correct |
2 ms |
492 KB |
n = 128 |
5 |
Correct |
2 ms |
492 KB |
n = 128 |
6 |
Correct |
2 ms |
492 KB |
n = 128 |
7 |
Correct |
2 ms |
492 KB |
n = 128 |
8 |
Correct |
2 ms |
492 KB |
n = 128 |
9 |
Correct |
2 ms |
492 KB |
n = 128 |
10 |
Correct |
2 ms |
492 KB |
n = 128 |
11 |
Correct |
2 ms |
492 KB |
n = 128 |
12 |
Correct |
2 ms |
492 KB |
n = 128 |
13 |
Correct |
2 ms |
492 KB |
n = 128 |
14 |
Correct |
2 ms |
492 KB |
n = 128 |
15 |
Correct |
2 ms |
492 KB |
n = 128 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
n = 128 |
2 |
Correct |
2 ms |
492 KB |
n = 128 |
3 |
Correct |
2 ms |
492 KB |
n = 128 |
4 |
Correct |
2 ms |
492 KB |
n = 128 |
5 |
Correct |
2 ms |
492 KB |
n = 128 |
6 |
Correct |
2 ms |
492 KB |
n = 128 |
7 |
Correct |
2 ms |
492 KB |
n = 128 |
8 |
Correct |
2 ms |
640 KB |
n = 128 |
9 |
Correct |
2 ms |
492 KB |
n = 128 |
10 |
Correct |
2 ms |
492 KB |
n = 128 |
11 |
Correct |
2 ms |
492 KB |
n = 128 |
12 |
Correct |
2 ms |
492 KB |
n = 128 |
13 |
Correct |
2 ms |
492 KB |
n = 128 |
14 |
Correct |
3 ms |
492 KB |
n = 128 |
15 |
Correct |
2 ms |
492 KB |
n = 128 |