oj.uz

Submission #859155

# Submission time Handle Problem Language Result Execution time Memory
859155 2023-10-09T20:57:13 Z vjudge1 Rarest Insects (IOI22_insects) C++17
55 / 100
 92 ms 1184 KB 
#include "insects.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(x) x.begin(), x.end()
 
const int N = 2e3+3, inf = INT_MAX;
 
mt19937 rng((time(nullptr)) + (chrono::steady_clock::now().time_since_epoch().count()) + ((uint64_t) new char));
 
int n, m, ans;
vector<int> v;
bitset<N> vis;
 
int min_cardinality(int N) {
  // move_inside(i);
  // move_outside(i);
  // press_button(i);
 
  n = N;
  v.resize(n);
  for (int i = 0; i < n; i++) v[i] = i;
  shuffle(all(v), rng);
 
  // Busco los primeros
  m = 0;
  for (int i = 0; i < n; i++) {
    int x = v[i];
    move_inside(x);
    vis[x] = 1;
    m++;
 
    if (press_button() > 1) {
      move_outside(x);
      vis[x] = 0;
      m--;
    }
  }
 
  if (m == 1) return n;
 
  int l = 1;
  int r = n/m;
  vector<int> to_remove;
  int taken = m;
  while (l < r) {
    shuffle(all(v), rng);
    int mid = (l+r+1)>>1;
 
    for (int i = 0; i < n && taken + (n-i) >= m*mid && taken < m*mid; i++) {
      int x = v[i];
      if (vis[x]) continue;
 
      move_inside(x);
      taken++;
      vis[x] = 1;
 
      if (press_button() > mid) {
        move_outside(x);
        taken--;
        vis[x] = 0;
      }
      else {
        to_remove.push_back(x);
      }
    }
 
    if (taken != m*mid) {
      for (int& x : to_remove) {
        move_outside(x);
        taken--;
        vis[x] = 0;
      }
      to_remove.clear();
    }
 
    if (taken == m*mid) l = mid;
    else r = mid-1;
  }
  return l;
}

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 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 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 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 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 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 16 ms 600 KB Output is correct
26 Correct 22 ms 940 KB Output is correct
27 Correct 38 ms 600 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 35 ms 600 KB Output is correct
30 Correct 26 ms 444 KB Output is correct
31 Correct 18 ms 600 KB Output is correct
32 Correct 29 ms 440 KB Output is correct
33 Correct 19 ms 1108 KB Output is correct
34 Correct 13 ms 856 KB Output is correct
35 Correct 16 ms 604 KB Output is correct
36 Correct 18 ms 600 KB Output is correct
37 Correct 16 ms 856 KB Output is correct
38 Correct 15 ms 600 KB Output is correct
39 Correct 10 ms 344 KB Output is correct
40 Correct 7 ms 600 KB Output is correct
41 Correct 4 ms 344 KB Output is correct

Subtask #3
30.0 / 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 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 0 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 25 ms 592 KB Output is correct
10 Partially correct 51 ms 440 KB Output is partially correct
11 Partially correct 92 ms 428 KB Output is partially correct
12 Correct 13 ms 344 KB Output is correct
13 Partially correct 92 ms 848 KB Output is partially correct
14 Partially correct 54 ms 592 KB Output is partially correct
15 Partially correct 42 ms 688 KB Output is partially correct
16 Partially correct 34 ms 956 KB Output is partially correct
17 Partially correct 43 ms 856 KB Output is partially correct
18 Partially correct 37 ms 1184 KB Output is partially correct
19 Partially correct 35 ms 596 KB Output is partially correct
20 Partially correct 39 ms 852 KB Output is partially correct
21 Partially correct 43 ms 696 KB Output is partially correct
22 Partially correct 36 ms 684 KB Output is partially correct
23 Partially correct 33 ms 596 KB Output is partially correct
24 Correct 22 ms 436 KB Output is correct
25 Correct 12 ms 692 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 23 ms 696 KB Output is correct
28 Correct 30 ms 436 KB Output is correct
29 Correct 21 ms 852 KB Output is correct
30 Correct 22 ms 428 KB Output is correct
31 Partially correct 49 ms 696 KB Output is partially correct
32 Partially correct 48 ms 436 KB Output is partially correct
33 Partially correct 39 ms 852 KB Output is partially correct
34 Partially correct 45 ms 696 KB Output is partially correct
35 Correct 26 ms 848 KB Output is correct
36 Correct 25 ms 588 KB Output is correct
37 Partially correct 48 ms 852 KB Output is partially correct
38 Partially correct 51 ms 756 KB Output is partially correct
39 Correct 32 ms 600 KB Output is correct
40 Correct 26 ms 344 KB Output is correct
41 Correct 23 ms 596 KB Output is correct
42 Correct 22 ms 1108 KB Output is correct
43 Partially correct 15 ms 344 KB Output is partially correct
44 Partially correct 77 ms 440 KB Output is partially correct
45 Correct 18 ms 592 KB Output is correct
46 Correct 9 ms 344 KB Output is correct
47 Correct 11 ms 344 KB Output is correct
48 Correct 11 ms 596 KB Output is correct