Submission #315473

#	Time	Username	Problem	Language	Result	Execution time	Memory
315473		daniel920712	Mouse (info1cup19_mouse)	C++14	0 / 100	3075 ms	256 KiB

mouse

#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};
set < int > all;
void solve(int N)
{
    int a,b,c,now,i,j,k,ok;
    for(i=0;i<N;i++) how.push_back(i+1);
    for(i=0;i<N;i++)
    {
        for(j=1;j<=N;j++)
        {
            if(!have[j])
            {
                how[i]=j;
                now=0;
                for(k=1;k<=N;k++)
                {
                    if(!have[j]&&k!=j)
                    {
                        how[i+now+1]=k;
                        now++;
                    }
                }
            }
            a=query(how);
            if(a==N) return;

            if(i==0)
            {
                ok=1;
                for(j=i+1;j<N;j++)
                {
                    swap(how[i],how[j]);
                    b=query(how);
                    swap(how[i],how[j]);
                    if(b==N) return;
                    if(a>b) continue;
                    else
                    {
                        ok=0;
                        break;
                    }
                }
                if(ok)
                {
                    have[how[i]]=1;
                    break;
                }
            }
            else
            {
                swap(how[i],how[0]);
                b=query(how);
                swap(how[i],how[0]);
                if(b==N) return;
                if(b-a==2)
                {
                    have[how[i]]=1;
                    break;
                }
            }



        }
    }
}

Compilation message (stderr)

mouse.cpp: In function 'void solve(int)':
mouse.cpp:14:13: warning: unused variable 'c' [-Wunused-variable]
   14 |     int a,b,c,now,i,j,k,ok;
      |             ^

• Subtask 1: 0 / 13
• Subtask 2: 0 / 38
• Subtask 3: 0 / 49