# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
406765 | 2021-05-18T04:42:48 Z | KleindianaLexington | Mouse (info1cup19_mouse) | C++17 | 0 ms | 0 KB |
#include "grader.h" #include <bits/stdc++.h> using namespace std; bool ok[300]; void solve(int N) { memset(ok, false, sizeof(ok)); vector<int> q; for(int i = 1; i <= N; i++) { q.push_back(i); } for(int i = 0; i < N - 1; i++) { if(ok[i]) { continue; } int val = -1; int idx = -1; for(int j = i + 1; j < N; j++) { if(ok[j]) { continue; } swap(q[i], q[j]); int ret = query(q); if(ret == N) { return; } if(ret > val) { val = res; idx = j; } swap(q[i], q[j]); } swap(q[i], q[idx]); ok[i] = true; ok[idx] = true; } query(q); }