#include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
const int MAX_N = 300;
int n;
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void debug(auto L, auto R) { while (L < R) cerr << *L << " \n"[L+1==R], ++L; }
void kout(){ cerr << endl; }
template<class T1, class ...T2> void kout(T1 a, T2 ...e) { cerr << a << ' ', kout(e...); }
vector<int> p{1,2,3,4,5,6,7,8,9,10,11,12,13};
int qcnt;
int query(vector<int> q) {
++qcnt;
int res = 0;
for (int i = 0;i < n;++i)
res += p[i] == q[i];
if (res == n)
DE(n, qcnt);
return res;
}
#else
#define DE(...) 0
void debug(...) {}
#include "grader.h"
#endif
random_device rd;
mt19937 gen(rd());
void solve(int N) {
n = N;
vector<int> q(n);
vector<bool> done(n);
iota(AI(q), 1);
shuffle(AI(q), gen);
int cur_same = query(q);
for (int i = 0;i < n && cur_same < n;++i) {
if (done[i]) continue;
vector<int> good;
for (int j = i+1;j < n && cur_same < n;++j) {
if (done[j]) continue;
swap(q[i], q[j]);
int v = query(q);
swap(q[i], q[j]);
if (v > cur_same) {
swap(q[i], q[j]);
cur_same = v;
good.pb(j);
continue;
}
if (v == cur_same - 2) {
done[i] = done[j] = true;
break;
}
}
if (good.size() < 2) continue;
good.pop_back();
for (int u : good)
done[u] = true;
}
DE(cur_same);
assert(cur_same == n);
}
#ifdef KEV
int main() {
solve(p.size());
}
#endif
Compilation message
mouse.cpp: In function 'void solve(int)':
mouse.cpp:25:17: warning: statement has no effect [-Wunused-value]
25 | #define DE(...) 0
| ^
mouse.cpp:63:2: note: in expansion of macro 'DE'
63 | DE(cur_same);
| ^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Correct! Number of queries: 13 |
2 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 4 |
3 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 13 |
4 |
Correct |
1 ms |
384 KB |
Correct! Number of queries: 11 |
5 |
Correct |
1 ms |
288 KB |
Correct! Number of queries: 18 |
6 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 13 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Correct! Number of queries: 13 |
2 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 4 |
3 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 13 |
4 |
Correct |
1 ms |
384 KB |
Correct! Number of queries: 11 |
5 |
Correct |
1 ms |
288 KB |
Correct! Number of queries: 18 |
6 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 13 |
7 |
Correct |
11 ms |
384 KB |
Correct! Number of queries: 800 |
8 |
Correct |
14 ms |
256 KB |
Correct! Number of queries: 800 |
9 |
Correct |
8 ms |
256 KB |
Correct! Number of queries: 600 |
10 |
Correct |
11 ms |
384 KB |
Correct! Number of queries: 800 |
11 |
Correct |
5 ms |
256 KB |
Correct! Number of queries: 600 |
12 |
Correct |
10 ms |
256 KB |
Correct! Number of queries: 700 |
13 |
Correct |
10 ms |
256 KB |
Correct! Number of queries: 600 |
14 |
Correct |
12 ms |
256 KB |
Correct! Number of queries: 700 |
15 |
Correct |
10 ms |
384 KB |
Correct! Number of queries: 700 |
16 |
Correct |
9 ms |
256 KB |
Correct! Number of queries: 700 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Correct! Number of queries: 13 |
2 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 4 |
3 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 13 |
4 |
Correct |
1 ms |
384 KB |
Correct! Number of queries: 11 |
5 |
Correct |
1 ms |
288 KB |
Correct! Number of queries: 18 |
6 |
Correct |
1 ms |
256 KB |
Correct! Number of queries: 13 |
7 |
Correct |
11 ms |
384 KB |
Correct! Number of queries: 800 |
8 |
Correct |
14 ms |
256 KB |
Correct! Number of queries: 800 |
9 |
Correct |
8 ms |
256 KB |
Correct! Number of queries: 600 |
10 |
Correct |
11 ms |
384 KB |
Correct! Number of queries: 800 |
11 |
Correct |
5 ms |
256 KB |
Correct! Number of queries: 600 |
12 |
Correct |
10 ms |
256 KB |
Correct! Number of queries: 700 |
13 |
Correct |
10 ms |
256 KB |
Correct! Number of queries: 600 |
14 |
Correct |
12 ms |
256 KB |
Correct! Number of queries: 700 |
15 |
Correct |
10 ms |
384 KB |
Correct! Number of queries: 700 |
16 |
Correct |
9 ms |
256 KB |
Correct! Number of queries: 700 |
17 |
Runtime error |
331 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |