#include <bits/stdc++.h>
#include "grader.h"
//#include "grader.cpp"
using namespace std;
int query(vector<int> v);
void solve(int N)
{
int i;
vector<int> v;
for(i=1; i<=N; ++i) v.push_back(i);
do
{
if(N==query(v))
break;
}while(next_permutation(v.begin(),v.end()));
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
33 ms |
364 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
1 ms |
364 KB |
Correct! Number of queries: 18 |
3 |
Correct |
3 ms |
364 KB |
Correct! Number of queries: 328 |
4 |
Correct |
33 ms |
364 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
52 ms |
364 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
2 ms |
364 KB |
Correct! Number of queries: 88 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
33 ms |
364 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
1 ms |
364 KB |
Correct! Number of queries: 18 |
3 |
Correct |
3 ms |
364 KB |
Correct! Number of queries: 328 |
4 |
Correct |
33 ms |
364 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
52 ms |
364 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
2 ms |
364 KB |
Correct! Number of queries: 88 |
7 |
Runtime error |
155 ms |
364 KB |
Execution killed with signal 13 |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
33 ms |
364 KB |
Correct! Number of queries: 3487 |
2 |
Correct |
1 ms |
364 KB |
Correct! Number of queries: 18 |
3 |
Correct |
3 ms |
364 KB |
Correct! Number of queries: 328 |
4 |
Correct |
33 ms |
364 KB |
Correct! Number of queries: 3528 |
5 |
Correct |
52 ms |
364 KB |
Correct! Number of queries: 4783 |
6 |
Correct |
2 ms |
364 KB |
Correct! Number of queries: 88 |
7 |
Runtime error |
155 ms |
364 KB |
Execution killed with signal 13 |
8 |
Halted |
0 ms |
0 KB |
- |