/**
* 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);
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];
for (int j : g[x]) {
in[j] -= 1;
if (in[j] == 0) {
que.push_back(j);
}
}
}
path[i] = que;
}
vector<vector<bool>> ls(n, vector<bool>(n));
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
bool ok = true;
for (int p = 0; p < min(path[i].size(), path[j].size()); p++) {
if (path[i][p] != path[j][p]) {
ok = (path[i][p] < path[j][p]);
break;
}
}
ls[i][j] = ok;
ls[j][i] = !ok;
}
}
{
vector<int> ans(n, -1);
vector<int> in(n);
for (int i = 0; i < n; i++) {
for (int j : g[i]) {
in[j] += 1;
}
}
vector<bool> alive(n);
for (int i = 0; i < n; i++) {
alive[i] = (in[i] == 0);
}
vector<int> order;
while (true) {
vector<int> ver;
for (int i = 0; i < n; i++) {
if (alive[i]) {
ver.push_back(i);
}
}
if (ver.empty()) {
break;
}
int x = -1;
for (int i = 0; i < (int) ver.size(); i++) {
bool ok = true;
for (int j = 0; j < (int) ver.size(); j++) {
if (i != j && !ls[ver[j]][ver[i]]) {
ok = false;
}
}
if (ok) {
x = ver[i];
break;
}
}
assert(x != -1);
order.push_back(x);
alive[x] = false;
for (int j : g[x]) {
in[j] -= 1;
if (in[j] == 0) {
alive[j] = true;
}
}
}
reverse(order.begin(), order.end());
for (int i = 0; i < n; i++) {
ans[order[i]] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << " ";
}
cout << endl;
}
{
vector<int> ans(n, -1);
vector<int> in(n);
for (int i = 0; i < n; i++) {
for (int j : g[i]) {
in[j] += 1;
}
}
vector<bool> alive(n);
for (int i = 0; i < n; i++) {
alive[i] = (in[i] == 0);
}
vector<int> order;
while (true) {
vector<int> ver;
for (int i = 0; i < n; i++) {
if (alive[i]) {
ver.push_back(i);
}
}
if (ver.empty()) {
break;
}
int x = -1;
for (int i = 0; i < (int) ver.size(); i++) {
bool ok = true;
for (int j = 0; j < (int) ver.size(); j++) {
if (i != j && ls[ver[j]][ver[i]]) {
ok = false;
}
}
if (ok) {
x = ver[i];
break;
}
}
assert(x != -1);
order.push_back(x);
alive[x] = false;
for (int j : g[x]) {
in[j] -= 1;
if (in[j] == 0) {
alive[j] = true;
}
}
}
reverse(order.begin(), order.end());
for (int i = 0; i < n; i++) {
ans[order[i]] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << " ";
}
cout << endl;
}
return 0;
}
Compilation message
zagonetka.cpp: In function 'int main()':
zagonetka.cpp:163:25: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
163 | for (int p = 0; p < min(path[i].size(), path[j].size()); p++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
36 ms |
312 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
208 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
598 ms |
396 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
