# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369556 | sad | Mouse (info1cup19_mouse) | C++14 | 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 "grader.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
void solve(int N)
{
vector<int>v;
for(int i=1;i<N+1;i++)v.pb(i);
int x=query(v);
for(int i=1;i<N+1;i++)
{
for(int j=i+1;j<N+1;j++)
{
swap(v[i-1],v[j-1]);
int y=query(v);
if(x!=y+2)
{
swap(v[i-1],v[j-1]);
}
}
}
query(v);
}