oj.uz

Submission #1076563

# Submission time Handle Problem Language Result Execution time Memory
1076563 2024-08-26T14:45:04 Z Boas Rarest Insects (IOI22_insects) C++17
40.45 / 100
 228 ms 6208 KB 
#include "insects.h"

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define loop(x, i) for (int i = 0; i < x; i++)
#define rev(x, i) for (int i = (int)x - 1; i >= 0; i--)
#define ALL(x) begin(x), end(x)
#define sz(x) (int)x.size()

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vi> vvi;

int min_cardinality(int N)
{
  vi ix(N);
  iota(ALL(ix), 0);
  // std::random_device rd;
  std::mt19937 g(6942042069);
  std::shuffle(ix.begin(), ix.end(), g);
  vvi S(N);
  int iter = 1;
  S[0].pb(0);
  move_inside(ix[0]);
  for (int i = 1; i < N; i++)
  {
    move_inside(ix[i]);
    int res = press_button();
    if (res == 2)
    {
      move_outside(ix[i]);
      S[1].pb(i);
    }
    else
      S[0].pb(i);
  }
  int t = sz(S[0]);
  if (t == 1)
    return N;
  while (sz(S[iter]))
  {
    if (sz(S[iter]) < t)
      return iter;
    int curSize = 1;
    for (int i : S[iter - 1])
      move_outside(ix[i]);
    move_inside(ix[S[iter][0]]);
    vi newCurS = {S[iter][0]};
    for (int s_ix = 1; s_ix < sz(S[iter]); s_ix++)
    {
      int i = S[iter][s_ix];
      move_inside(ix[i]);
      int res = press_button();
      if (res == 2)
      {
        move_outside(ix[i]);
        S[iter + 1].pb(i);
      }
      else
      {
        curSize++;
        newCurS.pb(i);
      }
      if (curSize == t)
      {
        for (int s_ix2 = s_ix + 1; s_ix2 < sz(S[iter]); s_ix2++)
        {
          int i2 = S[iter][s_ix2];
          S[iter + 1].pb(i2);
        }
        break;
      }
    }
    if (curSize < t)
      return iter;
    S[iter] = newCurS;
    iter++;
  }
  return iter;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 448 KB Output is correct
9 Correct 6 ms 448 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 10 ms 960 KB Output is correct
15 Correct 4 ms 608 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 448 KB Output is correct
9 Correct 6 ms 448 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 10 ms 960 KB Output is correct
15 Correct 4 ms 608 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 5 ms 468 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 32 ms 740 KB Output is correct
26 Correct 40 ms 1240 KB Output is correct
27 Correct 9 ms 472 KB Output is correct
28 Correct 7 ms 724 KB Output is correct
29 Correct 14 ms 600 KB Output is correct
30 Correct 9 ms 340 KB Output is correct
31 Correct 78 ms 1028 KB Output is correct
32 Correct 59 ms 1012 KB Output is correct
33 Correct 58 ms 920 KB Output is correct
34 Correct 39 ms 888 KB Output is correct
35 Correct 39 ms 568 KB Output is correct
36 Correct 46 ms 804 KB Output is correct
37 Correct 27 ms 992 KB Output is correct
38 Correct 10 ms 344 KB Output is correct
39 Correct 13 ms 480 KB Output is correct
40 Correct 8 ms 472 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
15.45 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 9 ms 340 KB Output is correct
9 Partially correct 109 ms 808 KB Output is partially correct
10 Partially correct 93 ms 808 KB Output is partially correct
11 Correct 33 ms 856 KB Output is correct
12 Correct 24 ms 504 KB Output is correct
13 Correct 40 ms 592 KB Output is correct
14 Correct 17 ms 592 KB Output is correct
15 Partially correct 228 ms 2916 KB Output is partially correct
16 Partially correct 158 ms 1980 KB Output is partially correct
17 Partially correct 134 ms 1680 KB Output is partially correct
18 Partially correct 190 ms 1668 KB Output is partially correct
19 Partially correct 193 ms 1148 KB Output is partially correct
20 Partially correct 157 ms 1424 KB Output is partially correct
21 Partially correct 97 ms 1108 KB Output is partially correct
22 Partially correct 62 ms 1116 KB Output is partially correct
23 Correct 20 ms 488 KB Output is correct
24 Correct 11 ms 756 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 8 ms 496 KB Output is correct
27 Partially correct 70 ms 1368 KB Output is partially correct
28 Partially correct 81 ms 840 KB Output is partially correct
29 Partially correct 79 ms 1244 KB Output is partially correct
30 Partially correct 79 ms 1172 KB Output is partially correct
31 Partially correct 96 ms 600 KB Output is partially correct
32 Partially correct 78 ms 848 KB Output is partially correct
33 Correct 27 ms 588 KB Output is correct
34 Correct 29 ms 508 KB Output is correct
35 Partially correct 86 ms 880 KB Output is partially correct
36 Partially correct 89 ms 812 KB Output is partially correct
37 Partially correct 59 ms 848 KB Output is partially correct
38 Partially correct 87 ms 856 KB Output is partially correct
39 Partially correct 54 ms 592 KB Output is partially correct
40 Partially correct 51 ms 800 KB Output is partially correct
41 Partially correct 86 ms 592 KB Output is partially correct
42 Partially correct 78 ms 764 KB Output is partially correct
43 Correct 6 ms 608 KB Output is correct
44 Correct 20 ms 600 KB Output is correct
45 Partially correct 108 ms 6208 KB Output is partially correct
46 Correct 13 ms 596 KB Output is correct
47 Correct 11 ms 600 KB Output is correct
48 Correct 14 ms 344 KB Output is correct