답안 #1076564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076564 2024-08-26T14:45:49 Z Boas 드문 곤충 (IOI22_insects) C++17
41.41 / 100
221 ms 5920 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(rd());
  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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 5 ms 452 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 7 ms 464 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 5 ms 452 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 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 2 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 5 ms 452 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 7 ms 464 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 5 ms 452 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 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 2 ms 344 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 30 ms 612 KB Output is correct
26 Correct 44 ms 716 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 7 ms 468 KB Output is correct
29 Correct 16 ms 600 KB Output is correct
30 Correct 14 ms 480 KB Output is correct
31 Correct 68 ms 1360 KB Output is correct
32 Correct 42 ms 976 KB Output is correct
33 Correct 59 ms 828 KB Output is correct
34 Correct 34 ms 1096 KB Output is correct
35 Correct 67 ms 592 KB Output is correct
36 Correct 60 ms 712 KB Output is correct
37 Correct 39 ms 600 KB Output is correct
38 Correct 21 ms 848 KB Output is correct
39 Correct 6 ms 344 KB Output is correct
40 Correct 11 ms 600 KB Output is correct
41 Correct 6 ms 596 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 0 ms 344 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 12 ms 756 KB Output is correct
9 Partially correct 126 ms 568 KB Output is partially correct
10 Partially correct 103 ms 1100 KB Output is partially correct
11 Correct 29 ms 496 KB Output is correct
12 Correct 11 ms 512 KB Output is correct
13 Correct 28 ms 500 KB Output is correct
14 Correct 23 ms 600 KB Output is correct
15 Partially correct 221 ms 2948 KB Output is partially correct
16 Partially correct 174 ms 2412 KB Output is partially correct
17 Partially correct 192 ms 1724 KB Output is partially correct
18 Partially correct 193 ms 1556 KB Output is partially correct
19 Partially correct 200 ms 1548 KB Output is partially correct
20 Partially correct 130 ms 1492 KB Output is partially correct
21 Partially correct 88 ms 1144 KB Output is partially correct
22 Partially correct 68 ms 600 KB Output is partially correct
23 Correct 25 ms 492 KB Output is correct
24 Correct 19 ms 344 KB Output is correct
25 Correct 15 ms 500 KB Output is correct
26 Correct 11 ms 504 KB Output is correct
27 Partially correct 99 ms 848 KB Output is partially correct
28 Partially correct 69 ms 1104 KB Output is partially correct
29 Partially correct 98 ms 1616 KB Output is partially correct
30 Partially correct 79 ms 1012 KB Output is partially correct
31 Partially correct 81 ms 1004 KB Output is partially correct
32 Partially correct 86 ms 1264 KB Output is partially correct
33 Correct 20 ms 592 KB Output is correct
34 Correct 24 ms 344 KB Output is correct
35 Partially correct 97 ms 508 KB Output is partially correct
36 Partially correct 73 ms 1148 KB Output is partially correct
37 Partially correct 52 ms 1312 KB Output is partially correct
38 Partially correct 106 ms 880 KB Output is partially correct
39 Partially correct 46 ms 780 KB Output is partially correct
40 Partially correct 75 ms 848 KB Output is partially correct
41 Partially correct 86 ms 1004 KB Output is partially correct
42 Partially correct 64 ms 864 KB Output is partially correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 13 ms 520 KB Output is correct
45 Partially correct 71 ms 5920 KB Output is partially correct
46 Correct 13 ms 508 KB Output is correct
47 Correct 19 ms 856 KB Output is correct
48 Correct 14 ms 600 KB Output is correct