#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
int s[101], l[101];
int p[101];
int mat[101][101];
int pos[101];
int n;
int tp_sort(priority_queue<int> &q,int s,int *vt,int *ind,vector<int> edge[101]) {
int vis = 0;
int sign = q.top() < 0 ? -1 : 1;
while (q.size()) {
int u= q.top(); q.pop();
if (u < 0) u = -u;
vt[u] = s++;
++vis;
for (auto v : edge[u]) {
if (--ind[v]==0)
q.push(v*sign);
}
}
return vis;
}
int dfs(int x,int dst,vector<int> edge[101]) {
if (dst == x) return 1;
for (auto nxt : edge[x]) {
if (dfs(nxt, dst, edge)) return 1;
}
return 0;
}
void qry(int x,int y) {//chk pos[x]->pos[y]
//inv edge ok -> no condition
//inv edge no -> there is condition
//cycle -> there is cond.(inclusive indirect)
vector<int> edge[101];
vector<int> loc;
int ind[101] = { 0 };
int myp[101] = {};
for (int i = 1; i <= n; ++i) myp[i] = p[i];
for (int i = x; i <= y; ++i) loc.push_back(pos[i]);
for (int i = 0; i < loc.size(); ++i) {
for (int j = i; j < loc.size(); ++j) {
if (mat[loc[i]][loc[j]]) {
edge[loc[i]].push_back(loc[j]);
++ind[loc[j]];
}
}
}
//dfs chk
if (dfs(pos[x], pos[y], edge))
return;
edge[pos[y]].push_back(pos[x]);//inv edge
++ind[pos[x]];
priority_queue<int> q;
for (auto v : loc) {
if (ind[v] == 0) q.push(v);
}
if (y - x + 1 == tp_sort(q,x, myp, ind, edge)) {
int i;
for (printf("query"), i = 1; i <= n; ++i) printf(" %d",myp[i]);
printf("\n"); fflush(stdout);
scanf("%d",&i);
if (i) return;
}
//cycle chk
mat[pos[x]][pos[y]] = 1;
}
int main() {
int i;
for (scanf("%d", &n), i = 1; i <= n; ++i) {
scanf("%d", p + i);
pos[p[i]] = i;
}
for (int range = 1; range < n; ++range) {
for (i = 1; i + range <= n; ++i) qry(i,i+range);
}
vector<int> edge[101];
priority_queue<int> q;
int ind[101] = { 0 };
for (i = 1; i <= n; ++i) {
for (int j = 1; j <i; ++j) {
if (mat[i][j]) {
edge[i].push_back(j);
++ind[j];
}
}
}
for (i = 1; i <= n; ++i) {
if (ind[i] == 0) q.push(-i);
}
tp_sort(q, 1, s, ind, edge);
for (i = 1; i <= n; ++i) ind[i] = 0;
for (i = 1; i <= n; ++i) {
edge[i].clear();
for (int j = n; j >i; --j) {
//for(int j=n;j>0;--j){
if (mat[i][j]) {
edge[i].push_back(j);
++ind[j];
}
}
}
for (i = 1; i <= n; ++i) {
if (ind[i] == 0) q.push(i);
}
tp_sort(q, 1, l, ind, edge);
for (printf("end\n"), i = 1; i <= n; ++i) printf("%d ",s[i]);
for (printf("\n"), i = 1; i <= n; ++i) printf("%d ", l[i]);
fflush(stdout);
return 0;
}
Compilation message
zagonetka.cpp: In function 'void qry(int, int)':
zagonetka.cpp:43:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < loc.size(); ++i) {
~~^~~~~~~~~~~~
zagonetka.cpp:44:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = i; j < loc.size(); ++j) {
~~^~~~~~~~~~~~
zagonetka.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&i);
~~~~~^~~~~~~~~
zagonetka.cpp: In function 'int main()':
zagonetka.cpp:75:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for (scanf("%d", &n), i = 1; i <= n; ++i) {
~~~~~~~~~~~~~~~^~~~~~~
zagonetka.cpp:76:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", p + i);
~~~~~^~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
316 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
248 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
16 ms |
248 KB |
Output is correct |
| 2 |
Incorrect |
39 ms |
252 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
102 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
