oj.uz

답안 #247174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247174 2020-07-11T07:10:23 Z shenxy Mouse (info1cup19_mouse) C++14
5.99999 / 100
 3000 ms 384 KB 
#include "grader.h"
#include <algorithm>
#include <vector>
using namespace std;
void solve(int N) {
	vector<int> a;
	for (int i = 1; i <= N; ++i) a.push_back(i);
	while (true) {
    	if (query(a) == N) return;
    	next_permutation(a.begin(), a.end());
    }
}

Subtask #1
5.999994 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 256 KB Correct! Number of queries: 3487
2 Correct 5 ms 256 KB Correct! Number of queries: 18
3 Correct 6 ms 256 KB Correct! Number of queries: 328
4 Correct 39 ms 384 KB Correct! Number of queries: 3528
5 Correct 49 ms 384 KB Correct! Number of queries: 4783
6 Correct 5 ms 384 KB Correct! Number of queries: 88

Subtask #2
0.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 256 KB Correct! Number of queries: 3487
2 Correct 5 ms 256 KB Correct! Number of queries: 18
3 Correct 6 ms 256 KB Correct! Number of queries: 328
4 Correct 39 ms 384 KB Correct! Number of queries: 3528
5 Correct 49 ms 384 KB Correct! Number of queries: 4783
6 Correct 5 ms 384 KB Correct! Number of queries: 88
7 Execution timed out 3013 ms 256 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 256 KB Correct! Number of queries: 3487
2 Correct 5 ms 256 KB Correct! Number of queries: 18
3 Correct 6 ms 256 KB Correct! Number of queries: 328
4 Correct 39 ms 384 KB Correct! Number of queries: 3528
5 Correct 49 ms 384 KB Correct! Number of queries: 4783
6 Correct 5 ms 384 KB Correct! Number of queries: 88
7 Execution timed out 3013 ms 256 KB Time limit exceeded
8 Halted 0 ms 0 KB -