oj.uz

답안 #1015050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015050 2024-07-06T03:48:47 Z emptypringlescan Mouse (info1cup19_mouse) C++14
5.99999 / 100
 81 ms 408 KB 
#include <bits/stdc++.h>
using namespace std;
#include "grader.h"
void solve(int n){
	int perm[n];
	for(int i=0; i<n; i++) perm[i]=i+1;
	do{
		vector<int> v;
		for(int i=0; i<n; i++) v.push_back(perm[i]);
		int x=query(v);
		if(x==n) return;
	} while(next_permutation(perm,perm+n));
}

Subtask #1
5.999994 / 13.0

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

Subtask #2
0.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 344 KB Correct! Number of queries: 3487
2 Correct 1 ms 344 KB Correct! Number of queries: 18
3 Correct 2 ms 344 KB Correct! Number of queries: 328
4 Correct 20 ms 344 KB Correct! Number of queries: 3528
5 Correct 21 ms 344 KB Correct! Number of queries: 4783
6 Correct 1 ms 344 KB Correct! Number of queries: 88
7 Runtime error 81 ms 408 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 344 KB Correct! Number of queries: 3487
2 Correct 1 ms 344 KB Correct! Number of queries: 18
3 Correct 2 ms 344 KB Correct! Number of queries: 328
4 Correct 20 ms 344 KB Correct! Number of queries: 3528
5 Correct 21 ms 344 KB Correct! Number of queries: 4783
6 Correct 1 ms 344 KB Correct! Number of queries: 88
7 Runtime error 81 ms 408 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -