oj.uz

답안 #1076554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076554 2024-08-26T14:42:59 Z Boas 드문 곤충 (IOI22_insects) C++17
25 / 100
 251 ms 2804 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 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 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 4 ms 344 KB Output is correct
14 Correct 11 ms 600 KB Output is correct
15 Correct 7 ms 600 KB Output is correct
16 Correct 5 ms 448 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 4 ms 436 KB Output is correct
20 Correct 4 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 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 4 ms 344 KB Output is correct
14 Correct 11 ms 600 KB Output is correct
15 Correct 7 ms 600 KB Output is correct
16 Correct 5 ms 448 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 4 ms 436 KB Output is correct
20 Correct 4 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 4 ms 600 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 45 ms 592 KB Output is correct
26 Correct 45 ms 600 KB Output is correct
27 Correct 6 ms 464 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 24 ms 600 KB Output is correct
30 Correct 11 ms 600 KB Output is correct
31 Correct 80 ms 1096 KB Output is correct
32 Correct 79 ms 736 KB Output is correct
33 Correct 105 ms 848 KB Output is correct
34 Correct 63 ms 1036 KB Output is correct
35 Correct 53 ms 528 KB Output is correct
36 Correct 43 ms 784 KB Output is correct
37 Correct 31 ms 456 KB Output is correct
38 Correct 15 ms 600 KB Output is correct
39 Correct 8 ms 964 KB Output is correct
40 Correct 8 ms 600 KB Output is correct
41 Correct 7 ms 600 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 344 KB Output is correct
7 Correct 15 ms 500 KB Output is correct
8 Correct 12 ms 500 KB Output is correct
9 Partially correct 99 ms 1408 KB Output is partially correct
10 Partially correct 114 ms 1104 KB Output is partially correct
11 Correct 21 ms 496 KB Output is correct
12 Correct 22 ms 724 KB Output is correct
13 Correct 25 ms 500 KB Output is correct
14 Correct 17 ms 344 KB Output is correct
15 Partially correct 213 ms 2804 KB Output is partially correct
16 Partially correct 193 ms 2004 KB Output is partially correct
17 Partially correct 157 ms 1492 KB Output is partially correct
18 Partially correct 186 ms 1816 KB Output is partially correct
19 Partially correct 169 ms 1648 KB Output is partially correct
20 Partially correct 169 ms 1360 KB Output is partially correct
21 Partially correct 100 ms 780 KB Output is partially correct
22 Partially correct 90 ms 756 KB Output is partially correct
23 Correct 23 ms 600 KB Output is correct
24 Correct 25 ms 600 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 9 ms 476 KB Output is correct
27 Partially correct 78 ms 1016 KB Output is partially correct
28 Correct 25 ms 492 KB Output is correct
29 Partially correct 143 ms 1048 KB Output is partially correct
30 Incorrect 251 ms 1080 KB Too many queries.
31 Halted 0 ms 0 KB -