// incorrect/nplusone-zoooma13.cpp
#include <bits/stdc++.h>
#include "machine.h"
using namespace std;
vector <int> find_permutation(int n){
vector <int> q(n);
int x = use_machine(q)[0];
vector <int> p(n);
for(int i = 0; i < n; i++){
q[i] = 1;
auto r = use_machine(q);
p[find(r.begin() ,r.end() ,x^1) - r.begin()] = i;
q[i] = 0;
}
return p;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
440 KB |
Output is correct |
2 |
Correct |
126 ms |
440 KB |
Output is correct |
3 |
Correct |
123 ms |
592 KB |
Output is correct |
4 |
Correct |
163 ms |
676 KB |
Output is correct |
5 |
Correct |
203 ms |
696 KB |
Output is correct |
6 |
Correct |
389 ms |
412 KB |
Output is correct |
7 |
Correct |
430 ms |
596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Too many queries |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Too many queries |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Too many queries |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Too many queries |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Too many queries |
2 |
Halted |
0 ms |
0 KB |
- |