# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315113 | daniel920712 | 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include "grader.h"
using namespace std;
vector < vector < int > > all;
vector < int > con;
vector < int > how;
int cmp(vector < int > a, vector < int > b)
{
int N=a.size(),con=0;
for(i=0;i<N;i++) if(a[i]==b[i]) con++;
return con;
}
void solve(int N)
{
how.clear();
int i,now=0,x,ok=1,t=0;
for(i=0;i<N;i++) how.push_back(i+1);
while(t!=N)
{
for(i=0;i<N;i++) how[i]=i+1;
do
{
ok=1;
x=0;
for(auto i:all)
{
if(cmp(i,how)!=con[x]) ok=0;
x++;
}
if(ok)
{
t=query(how);
con.push_back(t);
all.push_back(how);
break;
}
}while(next_permutation(how.begin(),how.end())!=0);
}
}