답안 #1109942

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109942 2024-11-08T07:40:14 Z tibinyte 드문 곤충 (IOI22_insects) C++17
47.5 / 100
452 ms 936 KB
#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;
  function<int(int)> get = [&](int x)
  {
    int ans = 0;
    vector<bool> out(n, false);
    for (int i = 0; i < n; ++i)
    {
      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 ans = 1;
  int distincte = n - get(1);
  int st = 2, dr = n / distincte;
  while (st <= dr)
  {
    int mid = (st + dr) / 2;
    if (n - distincte * mid == get(mid))
    {
      ans = mid;
      st = mid + 1;
    }
    else
    {
      dr = mid - 1;
    }
  }
  return ans;
}

/*
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)
*/
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 24 ms 336 KB Output is correct
7 Correct 5 ms 336 KB Output is correct
8 Correct 16 ms 336 KB Output is correct
9 Correct 19 ms 336 KB Output is correct
10 Correct 24 ms 336 KB Output is correct
11 Correct 4 ms 336 KB Output is correct
12 Correct 16 ms 336 KB Output is correct
13 Correct 10 ms 336 KB Output is correct
14 Correct 20 ms 336 KB Output is correct
15 Correct 14 ms 336 KB Output is correct
16 Correct 17 ms 336 KB Output is correct
17 Correct 17 ms 336 KB Output is correct
18 Correct 12 ms 336 KB Output is correct
19 Correct 14 ms 336 KB Output is correct
20 Correct 10 ms 336 KB Output is correct
21 Correct 5 ms 336 KB Output is correct
22 Correct 4 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 24 ms 336 KB Output is correct
7 Correct 5 ms 336 KB Output is correct
8 Correct 16 ms 336 KB Output is correct
9 Correct 19 ms 336 KB Output is correct
10 Correct 24 ms 336 KB Output is correct
11 Correct 4 ms 336 KB Output is correct
12 Correct 16 ms 336 KB Output is correct
13 Correct 10 ms 336 KB Output is correct
14 Correct 20 ms 336 KB Output is correct
15 Correct 14 ms 336 KB Output is correct
16 Correct 17 ms 336 KB Output is correct
17 Correct 17 ms 336 KB Output is correct
18 Correct 12 ms 336 KB Output is correct
19 Correct 14 ms 336 KB Output is correct
20 Correct 10 ms 336 KB Output is correct
21 Correct 5 ms 336 KB Output is correct
22 Correct 4 ms 336 KB Output is correct
23 Correct 208 ms 336 KB Output is correct
24 Correct 12 ms 336 KB Output is correct
25 Correct 118 ms 336 KB Output is correct
26 Correct 112 ms 692 KB Output is correct
27 Correct 162 ms 336 KB Output is correct
28 Correct 18 ms 336 KB Output is correct
29 Correct 183 ms 336 KB Output is correct
30 Correct 107 ms 336 KB Output is correct
31 Correct 167 ms 336 KB Output is correct
32 Correct 137 ms 336 KB Output is correct
33 Correct 146 ms 336 KB Output is correct
34 Correct 145 ms 436 KB Output is correct
35 Correct 124 ms 508 KB Output is correct
36 Correct 125 ms 436 KB Output is correct
37 Correct 98 ms 684 KB Output is correct
38 Correct 66 ms 336 KB Output is correct
39 Correct 47 ms 436 KB Output is correct
40 Correct 34 ms 336 KB Output is correct
41 Correct 15 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Partially correct 2 ms 336 KB Output is partially correct
7 Partially correct 452 ms 928 KB Output is partially correct
8 Correct 33 ms 428 KB Output is correct
9 Partially correct 277 ms 672 KB Output is partially correct
10 Partially correct 231 ms 428 KB Output is partially correct
11 Partially correct 390 ms 336 KB Output is partially correct
12 Correct 69 ms 580 KB Output is correct
13 Partially correct 390 ms 336 KB Output is partially correct
14 Partially correct 237 ms 348 KB Output is partially correct
15 Partially correct 354 ms 924 KB Output is partially correct
16 Partially correct 331 ms 680 KB Output is partially correct
17 Partially correct 338 ms 676 KB Output is partially correct
18 Partially correct 271 ms 924 KB Output is partially correct
19 Partially correct 350 ms 928 KB Output is partially correct
20 Partially correct 297 ms 676 KB Output is partially correct
21 Partially correct 222 ms 680 KB Output is partially correct
22 Partially correct 222 ms 432 KB Output is partially correct
23 Partially correct 141 ms 436 KB Output is partially correct
24 Correct 101 ms 584 KB Output is correct
25 Correct 67 ms 336 KB Output is correct
26 Correct 26 ms 432 KB Output is correct
27 Partially correct 212 ms 672 KB Output is partially correct
28 Partially correct 211 ms 680 KB Output is partially correct
29 Partially correct 287 ms 680 KB Output is partially correct
30 Partially correct 291 ms 676 KB Output is partially correct
31 Partially correct 224 ms 936 KB Output is partially correct
32 Partially correct 214 ms 428 KB Output is partially correct
33 Partially correct 172 ms 836 KB Output is partially correct
34 Partially correct 182 ms 436 KB Output is partially correct
35 Partially correct 257 ms 436 KB Output is partially correct
36 Partially correct 252 ms 684 KB Output is partially correct
37 Partially correct 225 ms 428 KB Output is partially correct
38 Partially correct 221 ms 676 KB Output is partially correct
39 Partially correct 181 ms 684 KB Output is partially correct
40 Partially correct 166 ms 928 KB Output is partially correct
41 Partially correct 253 ms 580 KB Output is partially correct
42 Partially correct 246 ms 668 KB Output is partially correct
43 Partially correct 74 ms 336 KB Output is partially correct
44 Partially correct 321 ms 336 KB Output is partially correct
45 Partially correct 403 ms 676 KB Output is partially correct
46 Correct 68 ms 436 KB Output is correct
47 Correct 76 ms 336 KB Output is correct
48 Correct 76 ms 428 KB Output is correct