#include<bits/stdc++.h>
#include "messy.h"
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e3 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
vector<int> P;
vector<int> vc[maxN][maxN];
string s;
int n;
void Prepair(int l, int r)
{
if(l == r)
return;
int mid = (l + r) / 2;
for(int i=l; i<=r; i++)
s[i] = '0';
for(int i=l; i<=mid; i++)
{
s[i] = '1';
//cout << s << '\n';
add_element(s);
s[i] = '0';
}
for(int i=l; i<=r; i++)
s[i] = '1';
Prepair(l, mid);
Prepair(mid + 1, r);
}
void DnC(int l, int r)
{
//cout << s;exit(0);
if(l == r)
return;
int mid = (l + r) / 2;
for(int i=0; i<n; i++)
{
if(s[i] == '0')
{
//cout << s << '\n';
s[i] = '1';
if(check_element(s))
{
// cerr << s << "\n";
vc[l][mid].pb(i);
}
else
vc[mid + 1][r].pb(i);
s[i] = '0';
}
}
// cerr << vc[l][mid].size() << " " << vc[mid + 1][r].size() << '\n';
for(int i : vc[mid + 1][r])
s[i] = '1';
DnC(l, mid);
for(int i : vc[mid + 1][r])
s[i] = '0';
for(int i : vc[l][mid])
s[i] = '1';
DnC(mid + 1, r);
for(int i : vc[l][mid])
s[i] = '0';
}
vector<int> restore_permutation(int _n, int w, int r)
{
n = _n;
P.resize(n);
for(int i=0; i<n; i++)
vc[0][n - 1].pb(i);
for(int i=0; i<n; i++)
s += '1';
Prepair(0, n - 1);
compile_set();
for(int i=0; i<n; i++)
s[i] = '0';
DnC(0, n - 1);
// cout << vc[0][0].size();exit(0);
for(int i=0; i<n; i++)
{
//cout << i << " ";
P[vc[i][i][0]] = i;
}
return P;
}
/*void Solve()
{
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
24020 KB |
n = 8 |
2 |
Correct |
16 ms |
24016 KB |
n = 8 |
3 |
Correct |
15 ms |
24020 KB |
n = 8 |
4 |
Correct |
14 ms |
23948 KB |
n = 8 |
5 |
Correct |
13 ms |
24024 KB |
n = 8 |
6 |
Correct |
12 ms |
24032 KB |
n = 8 |
7 |
Correct |
14 ms |
23956 KB |
n = 8 |
8 |
Correct |
12 ms |
24020 KB |
n = 8 |
9 |
Correct |
15 ms |
24020 KB |
n = 8 |
10 |
Correct |
18 ms |
23968 KB |
n = 8 |
11 |
Correct |
15 ms |
24020 KB |
n = 8 |
12 |
Correct |
12 ms |
24020 KB |
n = 8 |
13 |
Correct |
13 ms |
23956 KB |
n = 8 |
14 |
Correct |
13 ms |
24028 KB |
n = 8 |
15 |
Correct |
14 ms |
23920 KB |
n = 8 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
24032 KB |
n = 32 |
2 |
Correct |
13 ms |
23964 KB |
n = 32 |
3 |
Correct |
16 ms |
24028 KB |
n = 32 |
4 |
Correct |
13 ms |
23988 KB |
n = 32 |
5 |
Correct |
17 ms |
24028 KB |
n = 32 |
6 |
Correct |
16 ms |
24072 KB |
n = 32 |
7 |
Correct |
15 ms |
24016 KB |
n = 32 |
8 |
Correct |
15 ms |
24052 KB |
n = 32 |
9 |
Correct |
16 ms |
23924 KB |
n = 32 |
10 |
Correct |
12 ms |
24008 KB |
n = 32 |
11 |
Correct |
12 ms |
24024 KB |
n = 32 |
12 |
Correct |
12 ms |
24024 KB |
n = 32 |
13 |
Correct |
11 ms |
23984 KB |
n = 32 |
14 |
Correct |
11 ms |
24024 KB |
n = 32 |
15 |
Correct |
15 ms |
24028 KB |
n = 32 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
24020 KB |
n = 32 |
2 |
Correct |
14 ms |
23956 KB |
n = 32 |
3 |
Correct |
14 ms |
24032 KB |
n = 32 |
4 |
Correct |
16 ms |
24056 KB |
n = 32 |
5 |
Correct |
12 ms |
24020 KB |
n = 32 |
6 |
Correct |
13 ms |
24024 KB |
n = 32 |
7 |
Correct |
12 ms |
24020 KB |
n = 32 |
8 |
Correct |
12 ms |
24028 KB |
n = 32 |
9 |
Correct |
12 ms |
24020 KB |
n = 32 |
10 |
Correct |
15 ms |
24020 KB |
n = 32 |
11 |
Correct |
13 ms |
24020 KB |
n = 32 |
12 |
Correct |
13 ms |
24012 KB |
n = 32 |
13 |
Correct |
16 ms |
24024 KB |
n = 32 |
14 |
Correct |
12 ms |
24020 KB |
n = 32 |
15 |
Correct |
14 ms |
24008 KB |
n = 32 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
24148 KB |
n = 128 |
2 |
Correct |
15 ms |
24228 KB |
n = 128 |
3 |
Correct |
16 ms |
24148 KB |
n = 128 |
4 |
Correct |
14 ms |
24276 KB |
n = 128 |
5 |
Correct |
14 ms |
24156 KB |
n = 128 |
6 |
Correct |
15 ms |
24120 KB |
n = 128 |
7 |
Correct |
17 ms |
24216 KB |
n = 128 |
8 |
Correct |
14 ms |
24148 KB |
n = 128 |
9 |
Correct |
18 ms |
24216 KB |
n = 128 |
10 |
Correct |
14 ms |
24184 KB |
n = 128 |
11 |
Correct |
14 ms |
24148 KB |
n = 128 |
12 |
Correct |
16 ms |
24148 KB |
n = 128 |
13 |
Correct |
13 ms |
24148 KB |
n = 128 |
14 |
Correct |
14 ms |
24160 KB |
n = 128 |
15 |
Correct |
14 ms |
24148 KB |
n = 128 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
24148 KB |
n = 128 |
2 |
Correct |
13 ms |
24148 KB |
n = 128 |
3 |
Correct |
13 ms |
24148 KB |
n = 128 |
4 |
Correct |
14 ms |
24148 KB |
n = 128 |
5 |
Correct |
15 ms |
24148 KB |
n = 128 |
6 |
Correct |
15 ms |
24164 KB |
n = 128 |
7 |
Correct |
14 ms |
24172 KB |
n = 128 |
8 |
Correct |
14 ms |
24148 KB |
n = 128 |
9 |
Correct |
13 ms |
24228 KB |
n = 128 |
10 |
Correct |
16 ms |
24148 KB |
n = 128 |
11 |
Correct |
14 ms |
24200 KB |
n = 128 |
12 |
Correct |
13 ms |
24148 KB |
n = 128 |
13 |
Correct |
13 ms |
24148 KB |
n = 128 |
14 |
Correct |
14 ms |
24160 KB |
n = 128 |
15 |
Correct |
16 ms |
24112 KB |
n = 128 |