oj.uz

Submission #1009273

# Submission time Handle Problem Language Result Execution time Memory
1009273 2024-06-27T10:48:40 Z oyber Rarest Insects (IOI22_insects) C++17
0 / 100
 78 ms 344 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> uniqu;
vector<bool> insects;
int N;
vector<bool> used;
vector<int> last_used;

void empty() {
  for (int i = 0; i < int(last_used.size()); i++) {
    int a = last_used[i];
    move_outside(a);
    used[a] = false;
  }
}

bool check_num(int num) {
  last_used = vector<int>(0);
  //printf("num: %d\n", num);
  for (int i = 0; i < N; i++) {
    if (!insects[i]) continue;
    //printf("insect: %d\n", insects[i]);
    move_inside(i);
    if (press_button() >= num) {
      move_outside(i);
      continue;
    }
    last_used.push_back(i);
  }

  //printf("n1: %d\n", press_button());
  bool valid = true;
  for (int i = 0; i < int(uniqu.size()); i++) {
    //printf("n2: %d\n", press_button());
    move_inside(uniqu[i]);
    //printf("n3: %d\n", press_button());
    if (press_button() != num) {
      //printf("not valid i=%d\n", uniqu[i]);
      move_outside(uniqu[i]);
      valid = false;
      break;
    }
    move_outside(uniqu[i]);
  }

  //printf("valid: %d\n", int(valid));
  return valid;
}

int min_cardinality(int n) {
  N = n;
  used.resize(N);
  insects.resize(N);
  int types = 0;
  for (int i = 0; i < N; i++) {
    move_inside(i);
    if (press_button() > 1) {
      move_outside(i);
      insects[i] = true;
      continue;
    }
    types++;
    uniqu.push_back(i);
  }

  for (int i = 0; i < int(uniqu.size()); i++) {
    move_outside(uniqu[i]);
  }

  int l = 1;
  int r = N/types+1;
  while (l < r) {
    int m = (l+r)/2;
    if (check_num(m)) {
      l = m+1;
      for (int i = 0; i < int(last_used.size()); i++) {
        insects[i] = false;
      }
    } else {
      r = m;
      for (int i = 0; i < int(last_used.size()); i++) {
        move_outside(last_used[i]);
      }
    }
  }
  return r-1;

  /*for (int i = 1; i <= N/types; i++) {
    if (!check_num(i)) {
      return i-1;
    }
  }
  return N/types;*/
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory 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 6 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Incorrect 5 ms 344 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory 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 6 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Incorrect 5 ms 344 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #3
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 1 ms 344 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Partially correct 78 ms 344 KB Output is partially correct
8 Correct 27 ms 344 KB Output is correct
9 Incorrect 57 ms 344 KB Wrong answer.
10 Halted 0 ms 0 KB -