Submission #1109945

#	Time	Username	Problem	Language	Result	Execution time	Memory
1109945		tibinyte	Rarest Insects (IOI22_insects)	C++17	25 / 100	732 ms	892 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int random(int st, int dr)
{
  uniform_int_distribution<int> dist(st, dr);
  return dist(rng);
}

template <typename t>
using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;

const int mod = 1e9 + 7;
struct Mint
{
  int val;
  Mint(int x = 0)
  {
    val = x % mod;
  }
  Mint(long long x)
  {
    val = x % mod;
  }
  Mint operator+(Mint oth)
  {
    return val + oth.val;
  }
  Mint operator-(Mint oth)
  {
    return val - oth.val + mod;
  }
  Mint operator*(Mint oth)
  {
    return 1ll * val * oth.val;
  }
  void operator+=(Mint oth)
  {
    val = (*this + oth).val;
  }
  void operator-=(Mint oth)
  {
    val = (*this - oth).val;
  }
  void operator*=(Mint oth)
  {
    val = (*this * oth).val;
  }
};

Mint powmod(int a, int b)
{
  if (b == 0)
  {
    return 1;
  }
  if (b % 2 == 1)
  {
    return powmod(a, b - 1) * a;
  }
  Mint p = powmod(a, b / 2);
  return p * p;
}

/*
                 .___                 __                 __           .__
  ____  ____   __| _/____     _______/  |______ ________/  |_  ______ |  |__   ___________   ____
_/ ___\/  _ \ / __ |/ __ \   /  ___/\   __\__  \\_  __ \   __\/  ___/ |  |  \_/ __ \_  __ \_/ __ \
\  \__(  <_> ) /_/ \  ___/   \___ \  |  |  / __ \|  | \/|  |  \___ \  |   Y  \  ___/|  | \/\  ___/
 \___  >____/\____ |\___  > /____  > |__| (____  /__|   |__| /____  > |___|  /\___  >__|    \___  >
     \/           \/    \/       \/            \/                 \/       \/     \/            \/
*/

int min_cardinality(int N)
{
  int n = N;
  vector<bool> out(n, false);
  function<int(int)> get = [&](int x)
  {
    int ans = 0;
    for (int i = 0; i < n; ++i)
    {
      if (out[i])
      {
        continue;
      }
      move_inside(i);
      if (press_button() == x + 1)
      {
        ans++;
        move_outside(i);
        out[i] = true;
      }
    }
    for (int i = 0; i < n; ++i)
    {
      if (!out[i])
      {
        move_outside(i);
      }
    }
    return ans;
  };
  int distincte = n - get(1);
  fill(out.begin(), out.end(), false);
  while (true)
  {
    int sum = 0;
    for (int i = 0; i < n; ++i)
    {
      sum += !out[i];
    }
    int ans = sum / distincte;
    if (get(ans) == sum - ans * distincte)
    {
      return ans;
    }
  }
  return -1;
}

/*
I cannot take this anymore
Saying everything I've said before
All these words, they make no sense
I find bliss in ignorance
Less I hear, the less you say
You'll find that out anyway
Just like before

Everything you say to me
(Takes me one step closer to the edge)
(And I'm about to break)
I need a little room to breathe
(Cause I'm one step closer to the edge)
(I'm about to break)
*/

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