Submission #1015079

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015079		salmon	Mouse (info1cup19_mouse)	C++14	9 / 100	82 ms	408 KiB

mouse

#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

int N;
vector<int> v;

void cycle(int j){
	int num = v[j];
	
	for(int i = j; i < N - 1; i++){
		v[i] = v[i + 1];
	}
	v[N - 1] = num;
}

void solve(int N){
	
	::N = N;
	
	for(int i = 1; i <= N; i++){
		v.push_back(i);
	}
	
	set<int> used;
	
	for(int i = 0; i < N; i++){	
		for(int j = 1; j <= N; j++){
			if(used.find(j) == used.end()){
				v[i] = j;
				
				int cont = i + 1;
				for(int i = 1; i <= N; i++){
					if(i != j && used.find(i) == used.end()){
						v[cont] = i; 
						cont++;
					}
				}
				
				int soom = 0;
				int it = i;
				
				for(int i = 0; i < N - it - 1; i++){
					cycle(it + 1);
					int b = query(v);
					if(b == N) return;
					soom += b;
				}
				
				soom %= (N - it - 1);
				if(soom == 0){
					used.insert(j);
					break;
				}
			}
		}
	}
	
	while(true){
		query(v);
	}
}

• Subtask 1: 9.000004 / 13
• Subtask 2: 0 / 38
• Subtask 3: 0 / 49