#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int N){
vector<int> v;
for(int i = 1;i <= N;i++) v.push_back(i);
do{
int score = query(v);
if(score == N) return;
}while(next_permutation(v.begin(),v.end()));
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
256 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
5 ms |
256 KB |
Correct! Number of queries: 18 |
3 |
Correct |
9 ms |
384 KB |
Correct! Number of queries: 328 |
4 |
Correct |
51 ms |
256 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
64 ms |
256 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
6 ms |
384 KB |
Correct! Number of queries: 88 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
256 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
5 ms |
256 KB |
Correct! Number of queries: 18 |
3 |
Correct |
9 ms |
384 KB |
Correct! Number of queries: 328 |
4 |
Correct |
51 ms |
256 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
64 ms |
256 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
6 ms |
384 KB |
Correct! Number of queries: 88 |
7 |
Execution timed out |
3003 ms |
384 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
256 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
5 ms |
256 KB |
Correct! Number of queries: 18 |
3 |
Correct |
9 ms |
384 KB |
Correct! Number of queries: 328 |
4 |
Correct |
51 ms |
256 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
64 ms |
256 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
6 ms |
384 KB |
Correct! Number of queries: 88 |
7 |
Execution timed out |
3003 ms |
384 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |