답안 #247357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
247357	2020-07-11T08:57:24 Z	errorgorn	Mouse (info1cup19_mouse)	C++14	20.4253 / 100	3000 ms	384 KB

mouse

#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
 
#define ll long long
#define fi first
#define se second 
 
#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);(s<e?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
mt19937 rng (266875);

void solve(int n){
	vector<int> v;
	
	rep(x,1,n+1){
		v.push_back(x);
	}
	
	int curr=query(v);
	
	while (curr!=n){
		int i,j;
		
		do{
			i=rng()%n,j=rng()%n;
		} while (i==j);
		
		swap(v[i],v[j]);
		int temp=query(v);
		if (temp<curr){
			swap(v[i],v[j]);
		}
		else{
			curr=temp;
		}
	}
}

Subtask #1

9.000004 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Correct! Number of queries: 66
2	Correct	4 ms	256 KB	Correct! Number of queries: 4
3	Correct	5 ms	384 KB	Correct! Number of queries: 33
4	Correct	5 ms	256 KB	Correct! Number of queries: 38
5	Correct	5 ms	256 KB	Correct! Number of queries: 20
6	Correct	5 ms	256 KB	Correct! Number of queries: 16

Subtask #2

11.42527 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Correct! Number of queries: 66
2	Correct	4 ms	256 KB	Correct! Number of queries: 4
3	Correct	5 ms	384 KB	Correct! Number of queries: 33
4	Correct	5 ms	256 KB	Correct! Number of queries: 38
5	Correct	5 ms	256 KB	Correct! Number of queries: 20
6	Correct	5 ms	256 KB	Correct! Number of queries: 16
7	Correct	81 ms	256 KB	Correct! Number of queries: 6200
8	Correct	62 ms	256 KB	Correct! Number of queries: 4400
9	Correct	57 ms	256 KB	Correct! Number of queries: 3500
10	Correct	51 ms	256 KB	Correct! Number of queries: 4200
11	Correct	41 ms	384 KB	Correct! Number of queries: 3600
12	Correct	62 ms	256 KB	Correct! Number of queries: 3900
13	Correct	52 ms	256 KB	Correct! Number of queries: 3100
14	Correct	53 ms	256 KB	Correct! Number of queries: 3800
15	Correct	63 ms	256 KB	Correct! Number of queries: 4800
16	Correct	80 ms	384 KB	Correct! Number of queries: 5100

Subtask #3

0.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Correct! Number of queries: 66
2	Correct	4 ms	256 KB	Correct! Number of queries: 4
3	Correct	5 ms	384 KB	Correct! Number of queries: 33
4	Correct	5 ms	256 KB	Correct! Number of queries: 38
5	Correct	5 ms	256 KB	Correct! Number of queries: 20
6	Correct	5 ms	256 KB	Correct! Number of queries: 16
7	Correct	81 ms	256 KB	Correct! Number of queries: 6200
8	Correct	62 ms	256 KB	Correct! Number of queries: 4400
9	Correct	57 ms	256 KB	Correct! Number of queries: 3500
10	Correct	51 ms	256 KB	Correct! Number of queries: 4200
11	Correct	41 ms	384 KB	Correct! Number of queries: 3600
12	Correct	62 ms	256 KB	Correct! Number of queries: 3900
13	Correct	52 ms	256 KB	Correct! Number of queries: 3100
14	Correct	53 ms	256 KB	Correct! Number of queries: 3800
15	Correct	63 ms	256 KB	Correct! Number of queries: 4800
16	Correct	80 ms	384 KB	Correct! Number of queries: 5100
17	Execution timed out	3084 ms	384 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-