Submission #627856

# Submission time Handle Problem Language Result Execution time Memory
627856 2022-08-13T00:12:44 Z Fischer Rarest Insects (IOI22_insects) C++17
53.16 / 100
155 ms 336 KB
#include <bits/stdc++.h>
#include "insects.h"
using namespace std;

const int maxn = 2010;
int in[maxn];
vector<bool> memo;
int n, c;
int base;

void put(int x) {
  move_inside(x);
  //memo[x] = 1;
}

void pop(int x) {
  move_outside(x);
  //memo[x] = 0;
}

map<vector<bool>, int> mapMemo;
bool last[maxn];
int push() {
  return press_button();
  
  if (mapMemo.count(memo)) return mapMemo[memo];

  for (int i = 0; i < n; ++i) {
    if (last[i] != (in[i] != 0)) {
      if (last[i]) move_outside(i);
      else move_inside(i);
      last[i] ^= 1;
    } 
  }

  return mapMemo[memo] = press_button();
}

bool p(int x) {  
  int len = base;
  for (int i = 0; i < n; ++i) {
    if (in[i] == -1) continue;
    if (len == x * c) break;
    put(i);
    in[i] = 1;
    if (push() > x) {
      pop(i);
      in[i] = 0;
    } else {
      len += 1;
    }
  }

  if (len == x * c) {
    for (int i = 0; i < n; ++i) {
      if (in[i] == 1) {
        in[i] = -1;
        base += 1;
      }
    }
  } else {
    for (int i = 0; i < n; ++i) {
      if (in[i] == 1) {
        pop(i);
        in[i] = 0;
      }
    }
  }

  return len == x * c;
}

int min_cardinality(int N) {
  n = N;
  memo.assign(n, 0);
  c = 0;  
  for (int i=0; i<N; ++i) {
      put(i);
      in[i] = -1;
      if (push() == 1) c += 1;
      else pop(i), in[i] = 0; 
  }
  base = c;

  if (c == 1) return N;
  if (c == N) return 1;

  int lo = 1, hi = N / c+1;
  while (hi-lo>1) {
    int mid = (lo + hi) / 2;
    if (p(mid)) lo = mid;
    else hi = mid;
  }

  return lo;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 9 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 14 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 4 ms 312 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 3 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 9 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 14 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 4 ms 312 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 3 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 10 ms 208 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 24 ms 208 KB Output is correct
26 Correct 42 ms 208 KB Output is correct
27 Correct 71 ms 208 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 37 ms 208 KB Output is correct
30 Correct 58 ms 208 KB Output is correct
31 Correct 19 ms 208 KB Output is correct
32 Correct 23 ms 208 KB Output is correct
33 Correct 28 ms 208 KB Output is correct
34 Correct 26 ms 208 KB Output is correct
35 Correct 24 ms 208 KB Output is correct
36 Correct 28 ms 312 KB Output is correct
37 Correct 28 ms 208 KB Output is correct
38 Correct 30 ms 208 KB Output is correct
39 Correct 23 ms 208 KB Output is correct
40 Correct 16 ms 208 KB Output is correct
41 Correct 8 ms 308 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 19 ms 208 KB Output is correct
8 Correct 11 ms 208 KB Output is correct
9 Correct 42 ms 336 KB Output is correct
10 Partially correct 64 ms 208 KB Output is partially correct
11 Partially correct 154 ms 208 KB Output is partially correct
12 Correct 27 ms 208 KB Output is correct
13 Partially correct 155 ms 208 KB Output is partially correct
14 Partially correct 84 ms 208 KB Output is partially correct
15 Correct 25 ms 312 KB Output is correct
16 Correct 45 ms 208 KB Output is correct
17 Correct 44 ms 208 KB Output is correct
18 Correct 60 ms 304 KB Output is correct
19 Correct 51 ms 208 KB Output is correct
20 Partially correct 60 ms 208 KB Output is partially correct
21 Partially correct 58 ms 208 KB Output is partially correct
22 Partially correct 97 ms 208 KB Output is partially correct
23 Partially correct 68 ms 208 KB Output is partially correct
24 Correct 47 ms 208 KB Output is correct
25 Correct 30 ms 304 KB Output is correct
26 Correct 21 ms 208 KB Output is correct
27 Correct 56 ms 308 KB Output is correct
28 Correct 33 ms 208 KB Output is correct
29 Correct 46 ms 308 KB Output is correct
30 Correct 33 ms 208 KB Output is correct
31 Partially correct 55 ms 300 KB Output is partially correct
32 Partially correct 65 ms 288 KB Output is partially correct
33 Partially correct 45 ms 288 KB Output is partially correct
34 Partially correct 71 ms 308 KB Output is partially correct
35 Partially correct 30 ms 208 KB Output is partially correct
36 Correct 38 ms 208 KB Output is correct
37 Partially correct 56 ms 292 KB Output is partially correct
38 Partially correct 75 ms 288 KB Output is partially correct
39 Correct 37 ms 312 KB Output is correct
40 Correct 31 ms 208 KB Output is correct
41 Correct 33 ms 208 KB Output is correct
42 Partially correct 45 ms 208 KB Output is partially correct
43 Partially correct 30 ms 208 KB Output is partially correct
44 Partially correct 148 ms 208 KB Output is partially correct
45 Correct 43 ms 208 KB Output is correct
46 Correct 19 ms 208 KB Output is correct
47 Correct 31 ms 208 KB Output is correct
48 Correct 13 ms 208 KB Output is correct