/**
* author: wxhtzdy
* created: 01.07.2022 07:54:35
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
auto Ask = [&](vector<int> q) {
cout << "query ";
for (int i = 0; i < n; i++) {
cout << q[i] << " ";
}
cout << endl;
int x;
cin >> x;
return x;
};
vector<vector<bool>> f(n, vector<bool>(n, true));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j && p[i] < p[j]) {
f[i][j] = false;
}
}
}
auto Valid = [&]() {
vector<vector<int>> g(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j && f[i][j]) {
g[i].push_back(j);
}
}
}
vector<int> in(n);
for (int i = 0; i < n; i++) {
for (int j : g[i]) {
in[j] += 1;
}
}
vector<int> que;
for (int i = 0; i < n; i++) {
if (in[i] == 0) {
que.push_back(i);
}
}
for (int b = 0; b < (int) que.size(); b++) {
int i = que[b];
for (int j : g[i]) {
in[j] -= 1;
if (in[j] == 0) {
que.push_back(j);
}
}
}
reverse(que.begin(), que.end());
vector<int> q(n);
for (int i = 0; i < n; i++) {
q[que[i]] = i + 1;
}
return Ask(q);
};
vector<vector<bool>> save(n, vector<bool>(n));
for (int it = 0; it < n * (n - 1) / 2; it++) {
vector<vector<int>> g(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j && f[i][j]) {
g[i].push_back(j);
}
}
}
pair<int, int> p = {-1, -1};
for (int i = 0; i < n; i++) {
vector<int> que(1, i);
vector<bool> was(n);
vector<bool> ok(n, true);
was[i] = true;
for (int b = 0; b < (int) que.size(); b++) {
int x = que[b];
for (int j : g[x]) {
if (!was[j]) {
was[j] = true;
que.push_back(j);
}
if (x != i) {
ok[j] = false;
}
}
}
bool found = false;
for (int j = 0; j < n; j++) {
if (i != j && ok[j] && f[i][j]) {
if (!save[i][j]) {
p = make_pair(i, j);
save[i][j] = true;
found = true;
break;
}
}
}
if (found) {
break;
}
}
if (p.first == -1) {
break;
}
swap(f[p.first][p.second], f[p.second][p.first]);
if (Valid()) {
f[p.first][p.second] = f[p.second][p.first] = false;
} else {
swap(f[p.first][p.second], f[p.second][p.first]);
}
}
vector<pair<int, int>> c;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j && f[i][j]) {
c.emplace_back(i, j);
}
}
}
cout << "end" << endl;
vector<vector<int>> g(n);
for (int i = 0; i < (int) c.size(); i++) {
g[c[i].first].push_back(c[i].second);
}
vector<vector<int>> path(n);
vector<vector<int>> par(n);
for (int i = 0; i < n; i++) {
vector<int> que(1, i);
vector<int> in(n);
for (int j = 0; j < n; j++) {
for (int p : g[j]) {
in[p] += 1;
}
}
for (int b = 0; b < (int) que.size(); b++) {
int x = que[b];
par[x].push_back(i);
for (int j : g[x]) {
in[j] -= 1;
if (in[j] == 0) {
que.push_back(j);
}
}
}
path[i] = que;
}
{
vector<int> ans(n, -1);
function<void(vector<int>, int, int)> Dfs = [&](vector<int> v, int L, int R) {
if (v.empty()) {
return;
}
set<int> alive;
for (int j : v) {
alive.insert(j);
}
int i = *min_element(v.begin(), v.end());
set<int> ch;
for (int j : path[i]) {
if (alive.find(j) != alive.end()) {
ch.insert(j);
}
}
ans[i] = L + (int) ch.size() - 1;
vector<int> vl;
for (int j = 1; j < (int) path[i].size(); j++) {
if (alive.find(path[i][j]) != alive.end()) {
vl.push_back(path[i][j]);
}
}
vector<int> vr;
for (int j = 0; j < (int) v.size(); j++) {
if (ch.find(v[j]) == ch.end()) {
vr.push_back(v[j]);
}
}
Dfs(vl, L, ans[i] - 1);
Dfs(vr, ans[i] + 1, R);
};
vector<int> v(n);
iota(v.begin(), v.end(), 0);
Dfs(v, 1, n);
vector<int> nans(n);
iota(nans.begin(), nans.end(), 0);
do {
bool ok = true;
for (int i = 0; i < n; i++) {
for (int j : g[i]) {
if (nans[i] < nans[j]) {
ok = false;
}
}
}
if (ok) {
break;
}
} while (next_permutation(nans.begin(), nans.end()));
for (int i = 0; i < n; i++) {
assert(ans[i] == nans[i] + 1);
}
for (int i = 0; i < n; i++) {
cout << ans[i] << " ";
}
cout << endl;
}
{
vector<int> ans(n, -1);
function<void(vector<int>, int, int)> Dfs = [&](vector<int> v, int L, int R) {
if (v.empty()) {
return;
}
set<int> alive;
for (int j : v) {
alive.insert(j);
}
int i = *min_element(v.begin(), v.end());
set<int> pr;
for (int j : par[i]) {
if (alive.find(j) != alive.end()) {
pr.insert(j);
}
}
ans[i] = R - (int) pr.size() + 1;
vector<int> vl;
for (int j = 0; j < (int) par[i].size(); j++) {
if (par[i][j] != i && alive.find(par[i][j]) != alive.end()) {
vl.push_back(par[i][j]);
}
}
vector<int> vr;
for (int j = 0; j < (int) v.size(); j++) {
if (pr.find(v[j]) == pr.end()) {
vr.push_back(v[j]);
}
}
Dfs(vl, ans[i] + 1, R);
Dfs(vr, L, ans[i] - 1);
};
vector<int> v(n);
iota(v.begin(), v.end(), 0);
Dfs(v, 1, n);
for (int i = 0; i < n; i++) {
cout << ans[i] << " ";
}
cout << endl;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Runtime error |
1 ms |
464 KB |
Execution killed with signal 6 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
336 KB |
Output is correct |
| 2 |
Execution timed out |
3100 ms |
336 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3090 ms |
372 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3094 ms |
504 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
