# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930681 | 2024-02-20T09:22:22 Z | bachhoangxuan | Mouse (info1cup19_mouse) | C++17 | 0 ms | 0 KB |
#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); } }