Submission #1211947

#TimeUsernameProblemLanguageResultExecution timeMemory
1211947serkanrashid드문 곤충 (IOI22_insects)C++20
0 / 100
77 ms412 KiB
#include "insects.h"
#include <bits/stdc++.h>
#define endl "\n"

using namespace std;

const int MAXN = 2048;
int n;
int used[MAXN];

int min_cardinality(int N)
{
    n = N;

    int ans = 1e9;
    vector<int>v;
    for(int i = 0; i < n; i++) v.push_back(i);

    while(v.size())
    {
        for(int j = 0; j < v.size(); j++)
        {
            move_inside(v[j]);
            used[j] = 1;
        }
        int br = press_button();

        int last = -1;
        for(int j = v.size()-1; j >= 0; j--)
        {
            move_outside(v[j]);
            used[j] = 0;

            int nb = press_button();
            if(nb != br)
            {
                move_inside(v[j]);
                used[j] = 1;

                last = j;
                break;
            }
        }

        for(int j = 0; j < last; j++)
        {
            move_outside(v[j]);
            used[j] = 0;

            int nb = press_button();
            if(nb != br)
            {
                move_inside(v[j]);
                used[j] = 1;
            }
        }
        ans = br;
        for(int j = 0; j < v.size(); j++)
        {
            if(used[j])
            {
                used[j] = 0;
                move_outside(v[j]);
            }
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...