Submission #1015064

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1015064	2024-07-06T04:01:19 Z	emptypringlescan	Mouse (info1cup19_mouse)	C++17	32.046 / 100	90 ms	420 KB

mouse

#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;
	vector<int> adj[n];
	vector<int> v;
	for(int i=0; i<n; i++) v.push_back(perm[i]);
	int x=query(v);
	int done[n];
	memset(done,0,sizeof(done));
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			swap(v[i],v[j]);
			int y=query(v);
			if(y==n) return;
			if(y>x){
				x=y;
				continue;
			}
			swap(v[i],v[j]);
		}
	}
}

Subtask #1

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Correct! Number of queries: 15
2	Correct	0 ms	344 KB	Correct! Number of queries: 9
3	Correct	0 ms	344 KB	Correct! Number of queries: 31
4	Correct	0 ms	344 KB	Correct! Number of queries: 29
5	Correct	0 ms	344 KB	Correct! Number of queries: 21
6	Correct	0 ms	344 KB	Correct! Number of queries: 43

Subtask #2

19.04598 / 38.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Correct! Number of queries: 15
2	Correct	0 ms	344 KB	Correct! Number of queries: 9
3	Correct	0 ms	344 KB	Correct! Number of queries: 31
4	Correct	0 ms	344 KB	Correct! Number of queries: 29
5	Correct	0 ms	344 KB	Correct! Number of queries: 21
6	Correct	0 ms	344 KB	Correct! Number of queries: 43
7	Correct	21 ms	344 KB	Correct! Number of queries: 2200
8	Correct	18 ms	344 KB	Correct! Number of queries: 2200
9	Correct	20 ms	340 KB	Correct! Number of queries: 2000
10	Correct	24 ms	344 KB	Correct! Number of queries: 2300
11	Correct	10 ms	344 KB	Correct! Number of queries: 1500
12	Correct	17 ms	344 KB	Correct! Number of queries: 2000
13	Correct	12 ms	344 KB	Correct! Number of queries: 1800
14	Correct	14 ms	344 KB	Correct! Number of queries: 2000
15	Correct	21 ms	344 KB	Correct! Number of queries: 2200
16	Correct	21 ms	344 KB	Correct! Number of queries: 2000

Subtask #3

0.0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Correct! Number of queries: 15
2	Correct	0 ms	344 KB	Correct! Number of queries: 9
3	Correct	0 ms	344 KB	Correct! Number of queries: 31
4	Correct	0 ms	344 KB	Correct! Number of queries: 29
5	Correct	0 ms	344 KB	Correct! Number of queries: 21
6	Correct	0 ms	344 KB	Correct! Number of queries: 43
7	Correct	21 ms	344 KB	Correct! Number of queries: 2200
8	Correct	18 ms	344 KB	Correct! Number of queries: 2200
9	Correct	20 ms	340 KB	Correct! Number of queries: 2000
10	Correct	24 ms	344 KB	Correct! Number of queries: 2300
11	Correct	10 ms	344 KB	Correct! Number of queries: 1500
12	Correct	17 ms	344 KB	Correct! Number of queries: 2000
13	Correct	12 ms	344 KB	Correct! Number of queries: 1800
14	Correct	14 ms	344 KB	Correct! Number of queries: 2000
15	Correct	21 ms	344 KB	Correct! Number of queries: 2200
16	Correct	21 ms	344 KB	Correct! Number of queries: 2000
17	Runtime error	90 ms	420 KB	Execution killed with signal 13
18	Halted	0 ms	0 KB	-