Submission #702694

#	Time	Username	Problem	Language	Result	Execution time	Memory
702694		boris_mihov	Rarest Insects (IOI22_insects)	C++17	0 / 100	8 ms	760 KiB

insects

#include "insects.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <set>

typedef long long llong;
const int MAXN = 2000 + 10;
const int INF  = 1e9;

int n;
int cnt;
int a[MAXN];
int perm[MAXN];
std::vector <int> diff;
std::set <int> list;
std::vector <int> tree[4*MAXN];

inline int pressButton()
{
    return press_button();
}

inline void moveInside(int idx)
{
    list.insert(perm[idx]);
    move_inside(perm[idx]);
}

inline void moveOutside(int idx)
{
    list.erase(list.find(perm[idx]));
    move_outside(perm[idx]);
}

void divide(int l, int r, int node)
{
    if (l == r)
    {
        for (const int &i : tree[node])
        {
            a[i] = a[diff[l]];
        }

        return;
    }
   
    int mid = (l + r) / 2;
    while (!tree[node].empty())
    {
        moveInside(tree[node].back());
        if (pressButton() != 1)
        {
            tree[2*node].push_back(tree[node].back());
        } else
        {
            tree[2*node + 1].push_back(tree[node].back());
        }

        moveOutside(tree[node].back());
        tree[node].pop_back();
    }

    int ptr = mid;
    if (tree[2*node + 1].size())
    {
        int mid2 = (r + mid + 1) / 2;
        while (ptr < mid2)
        {
            moveInside(diff[ptr + 1]);
            ptr++;
        }
    
        divide(mid + 1, r, 2*node + 1);
    }

    if (tree[2*node].size())
    {
        int mid2 = (l + mid) / 2;
        while (ptr > mid2)
        {
            moveOutside(diff[ptr]);
            ptr--;
        }
    
        divide(l, mid, 2*node);
    }
}

int min_cardinality(int N) 
{
    n = N;
    a[1] = ++cnt;
    diff.push_back(1);
    srand(92098359);
    std::iota(perm + 1, perm + 1 + n, 0);
    // std::random_shuffle(perm + 1, perm + 1 + n);
    moveInside(1);

    for (int i = 2 ; i <= n ; ++i)
    {
        moveInside(i);
        if (pressButton() != 1)
        {
            if (diff.size() == 1)
            {
                a[i] = cnt;
                continue;
            }

            tree[1].push_back(i);
            moveOutside(i);
            continue;
        }

        diff.push_back(i);
        a[i] = ++cnt;
    }

    int mid = (diff.size() - 1) / 2;
    int ptr = diff.size() - 1;
    while (ptr > mid)
    {
        moveOutside(diff[ptr]);
        ptr--;
    }

    divide(0, diff.size() - 1, 1);
    std::sort(a + 1, a + 1 + n);

    int curr = 1, ans = n;
    for (int i = 2 ; i <= n ; ++i)
    {
        if (a[i] == a[i - 1]) curr++;
        else
        {
            ans = std::min(ans, curr);
            curr = 1;
        }
    }

    ans = std::min(ans, curr);
    // std::cout << "ans: " << ans << '\n';
    return ans;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 75