oj.uz

Submission #315231

# Submission time Handle Problem Language Result Execution time Memory
315231 2020-10-22T05:04:36 Z thtsshz_bgwrswh Mouse (info1cup19_mouse) C++17
35.3333 / 100
 3000 ms 288 KB 
#pragma GCC optimize("Ofast")
#include "grader.h"
#include<stdio.h>
#include<algorithm>
#include<assert.h>
using namespace std;
int num[500];
bool check[500],wrong[500];
void solve(int n){
	int i,j;
	for(i=0;i<n;i++)
		wrong[i]=check[i]=0;
	vector<int> vec(n);
	for(i=0;i<n;i++)
		vec[i]=i+1;
	random_shuffle(vec.begin(),vec.end());
	int now=query(vec);
	if(now==n)
		return;
	while(1){
		for(i=0;i<n;i++){
			for(j=i+1;j<n;j++){
				if(check[i]||check[j])
					continue;
				swap(vec[i],vec[j]);
				int v=query(vec);
				if(v==n)
					return;
				if(v==now+2){
					now+=2;
					check[i]=check[j]=1;
					break;
				}
				else if(v==now+1)
					now++;	
				else
					swap(vec[i],vec[j]);
			}
		}
	}
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Correct! Number of queries: 16
2 Correct 0 ms 256 KB Correct! Number of queries: 4
3 Correct 1 ms 256 KB Correct! Number of queries: 10
4 Correct 1 ms 256 KB Correct! Number of queries: 22
5 Correct 1 ms 256 KB Correct! Number of queries: 22
6 Correct 1 ms 256 KB Correct! Number of queries: 15

Subtask #2
22.333322 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Correct! Number of queries: 16
2 Correct 0 ms 256 KB Correct! Number of queries: 4
3 Correct 1 ms 256 KB Correct! Number of queries: 10
4 Correct 1 ms 256 KB Correct! Number of queries: 22
5 Correct 1 ms 256 KB Correct! Number of queries: 22
6 Correct 1 ms 256 KB Correct! Number of queries: 15
7 Correct 17 ms 288 KB Correct! Number of queries: 1200
8 Correct 16 ms 256 KB Correct! Number of queries: 1200
9 Correct 14 ms 256 KB Correct! Number of queries: 1100
10 Correct 17 ms 256 KB Correct! Number of queries: 1200
11 Correct 11 ms 256 KB Correct! Number of queries: 800
12 Correct 17 ms 256 KB Correct! Number of queries: 1200
13 Correct 13 ms 256 KB Correct! Number of queries: 1000
14 Correct 20 ms 256 KB Correct! Number of queries: 1200
15 Correct 15 ms 256 KB Correct! Number of queries: 1200
16 Correct 20 ms 256 KB Correct! Number of queries: 1100

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Correct! Number of queries: 16
2 Correct 0 ms 256 KB Correct! Number of queries: 4
3 Correct 1 ms 256 KB Correct! Number of queries: 10
4 Correct 1 ms 256 KB Correct! Number of queries: 22
5 Correct 1 ms 256 KB Correct! Number of queries: 22
6 Correct 1 ms 256 KB Correct! Number of queries: 15
7 Correct 17 ms 288 KB Correct! Number of queries: 1200
8 Correct 16 ms 256 KB Correct! Number of queries: 1200
9 Correct 14 ms 256 KB Correct! Number of queries: 1100
10 Correct 17 ms 256 KB Correct! Number of queries: 1200
11 Correct 11 ms 256 KB Correct! Number of queries: 800
12 Correct 17 ms 256 KB Correct! Number of queries: 1200
13 Correct 13 ms 256 KB Correct! Number of queries: 1000
14 Correct 20 ms 256 KB Correct! Number of queries: 1200
15 Correct 15 ms 256 KB Correct! Number of queries: 1200
16 Correct 20 ms 256 KB Correct! Number of queries: 1100
17 Execution timed out 3074 ms 256 KB Time limit exceeded
18 Halted 0 ms 0 KB -