oj.uz

답안 #1076570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076570 2024-08-26T14:47:39 Z Boas 드문 곤충 (IOI22_insects) C++17
38.12 / 100
 257 ms 5732 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;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 2 ms 408 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 2 ms 408 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 7 ms 472 KB Output is correct
24 Correct 7 ms 476 KB Output is correct
25 Correct 27 ms 784 KB Output is correct
26 Correct 35 ms 508 KB Output is correct
27 Correct 13 ms 480 KB Output is correct
28 Correct 7 ms 728 KB Output is correct
29 Correct 8 ms 476 KB Output is correct
30 Correct 10 ms 472 KB Output is correct
31 Correct 62 ms 1132 KB Output is correct
32 Correct 44 ms 900 KB Output is correct
33 Correct 46 ms 936 KB Output is correct
34 Correct 65 ms 884 KB Output is correct
35 Correct 54 ms 608 KB Output is correct
36 Correct 60 ms 1036 KB Output is correct
37 Correct 34 ms 600 KB Output is correct
38 Correct 13 ms 476 KB Output is correct
39 Correct 16 ms 592 KB Output is correct
40 Correct 8 ms 344 KB Output is correct
41 Correct 7 ms 344 KB Output is correct

Subtask #3
13.12 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 9 ms 492 KB Output is correct
8 Correct 7 ms 500 KB Output is correct
9 Partially correct 82 ms 908 KB Output is partially correct
10 Partially correct 135 ms 884 KB Output is partially correct
11 Correct 27 ms 736 KB Output is correct
12 Correct 17 ms 516 KB Output is correct
13 Correct 29 ms 492 KB Output is correct
14 Correct 16 ms 600 KB Output is correct
15 Partially correct 257 ms 2864 KB Output is partially correct
16 Partially correct 181 ms 1628 KB Output is partially correct
17 Partially correct 159 ms 2156 KB Output is partially correct
18 Partially correct 141 ms 1588 KB Output is partially correct
19 Partially correct 98 ms 1388 KB Output is partially correct
20 Partially correct 139 ms 1224 KB Output is partially correct
21 Partially correct 112 ms 1060 KB Output is partially correct
22 Partially correct 43 ms 796 KB Output is partially correct
23 Correct 20 ms 492 KB Output is correct
24 Correct 23 ms 504 KB Output is correct
25 Correct 16 ms 504 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Partially correct 83 ms 1092 KB Output is partially correct
28 Partially correct 88 ms 824 KB Output is partially correct
29 Partially correct 76 ms 984 KB Output is partially correct
30 Partially correct 115 ms 896 KB Output is partially correct
31 Partially correct 71 ms 1080 KB Output is partially correct
32 Partially correct 77 ms 852 KB Output is partially correct
33 Correct 16 ms 344 KB Output is correct
34 Correct 21 ms 520 KB Output is correct
35 Partially correct 73 ms 508 KB Output is partially correct
36 Partially correct 75 ms 852 KB Output is partially correct
37 Partially correct 65 ms 856 KB Output is partially correct
38 Partially correct 84 ms 592 KB Output is partially correct
39 Partially correct 68 ms 1032 KB Output is partially correct
40 Partially correct 53 ms 812 KB Output is partially correct
41 Partially correct 81 ms 880 KB Output is partially correct
42 Partially correct 72 ms 1132 KB Output is partially correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 21 ms 760 KB Output is correct
45 Partially correct 81 ms 5732 KB Output is partially correct
46 Correct 15 ms 500 KB Output is correct
47 Correct 10 ms 592 KB Output is correct
48 Correct 14 ms 592 KB Output is correct