#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);(s<e?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
mt19937 rng (177013);
void solve(int n){
vector<int> v;
rep(x,1,n+1){
v.push_back(x);
}
do{
if (query(v)==n) return;
} while (next_permutation(all(v)));
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
42 ms |
384 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
5 ms |
384 KB |
Correct! Number of queries: 18 |
3 |
Correct |
7 ms |
384 KB |
Correct! Number of queries: 328 |
4 |
Correct |
47 ms |
256 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
66 ms |
256 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
6 ms |
384 KB |
Correct! Number of queries: 88 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
42 ms |
384 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
5 ms |
384 KB |
Correct! Number of queries: 18 |
3 |
Correct |
7 ms |
384 KB |
Correct! Number of queries: 328 |
4 |
Correct |
47 ms |
256 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
66 ms |
256 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
6 ms |
384 KB |
Correct! Number of queries: 88 |
7 |
Execution timed out |
3064 ms |
256 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
42 ms |
384 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
5 ms |
384 KB |
Correct! Number of queries: 18 |
3 |
Correct |
7 ms |
384 KB |
Correct! Number of queries: 328 |
4 |
Correct |
47 ms |
256 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
66 ms |
256 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
6 ms |
384 KB |
Correct! Number of queries: 88 |
7 |
Execution timed out |
3064 ms |
256 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |