# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930681 | bachhoangxuan | Mouse (info1cup19_mouse) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "perm.h"
using namespace std;
void findPermutation(int n) {
vector<int> x(n);
iota(x.begin(),x.end(),1);
int S = query(x);
for(int i=0;i<n;i++) for(int j=0;j<n;j++){
swap(x[i],x[j]);
int d=query(x);
if(d==n) return;
else if(d<=S) swap(x[i],x[j]);
S=max(S,d);
}
}