oj.uz

Submission #315155

# Submission time Handle Problem Language Result Execution time Memory
315155 2020-10-22T03:31:59 Z yjojdkgk5bp Mouse (info1cup19_mouse) C++14
5.99999 / 100
 3000 ms 256 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n)
{
	vector<int> p;
	for(int i=1; i<=n; i++) p.push_back(i);
	do{
		int v=query(p);
		if(v==n) return;
	}while(next_permutation(p.begin(),p.end()));
}

Subtask #1
5.999994 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 256 KB Correct! Number of queries: 3487
2 Correct 0 ms 256 KB Correct! Number of queries: 18
3 Correct 4 ms 256 KB Correct! Number of queries: 328
4 Correct 31 ms 256 KB Correct! Number of queries: 3528
5 Correct 44 ms 256 KB Correct! Number of queries: 4783
6 Correct 1 ms 256 KB Correct! Number of queries: 88

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 256 KB Correct! Number of queries: 3487
2 Correct 0 ms 256 KB Correct! Number of queries: 18
3 Correct 4 ms 256 KB Correct! Number of queries: 328
4 Correct 31 ms 256 KB Correct! Number of queries: 3528
5 Correct 44 ms 256 KB Correct! Number of queries: 4783
6 Correct 1 ms 256 KB Correct! Number of queries: 88
7 Execution timed out 3084 ms 256 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 256 KB Correct! Number of queries: 3487
2 Correct 0 ms 256 KB Correct! Number of queries: 18
3 Correct 4 ms 256 KB Correct! Number of queries: 328
4 Correct 31 ms 256 KB Correct! Number of queries: 3528
5 Correct 44 ms 256 KB Correct! Number of queries: 4783
6 Correct 1 ms 256 KB Correct! Number of queries: 88
7 Execution timed out 3084 ms 256 KB Time limit exceeded
8 Halted 0 ms 0 KB -