# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315469 | daniel920712 | Mouse (info1cup19_mouse) | C++14 | 4 ms | 768 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 < int > how;
vector < int > ans;
bool have[500]={0};
bool have2[500]={0};
void solve(int N)
{
int a,b,c,now,i,j,k;
how.clear();
for(i=0;i<N;i++)
{
how.push_back(i+1);
have[i+1]=0;
have2[i]=0;
}
for(i=0;i<N;i++)
{
//printf("aa\n");
if(have2[i]) continue;
for(j=1;j<=N;j++)
{
//printf("\n");
if(!have[j])
{
how[i]=j;
now=0;
for(k=1;k<=N;k++)
{
if(!have[k]&&k!=j)
{
how[i+now+1]=k;
now++;
}
}
a=query(how);
if(a==N) return;
for(k=i+1;k<N;k++)
{
swap(how[i],how[k]);
b=query(how);
swap(how[i],how[k]);
if(b==N) return;
if(a-b==2)
{
have2[k]=1;
have[how[i]]=1;
have[how[k]]=1;
break;
}
}
if(a-b==2) break;
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |