Submission #1015064

#TimeUsernameProblemLanguageResultExecution timeMemory
1015064emptypringlescanMouse (info1cup19_mouse)C++17
32.05 / 100
90 ms420 KiB
#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]);
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...