oj.uz

Submission #944721

# Submission time Handle Problem Language Result Execution time Memory
944721 2024-03-13T04:10:41 Z nguyentunglam Rarest Insects (IOI22_insects) C++17
0 / 100
 1 ms 344 KB 
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;

const int NN = 1e5 + 10;

bool in[NN];

int min_cardinality(int n) {
  int type = 0;
  vector<int> candidate;
  for(int i = 0; i < n; i++) {
    move_inside(i);
    if (press_button() == 1) {
      ++type;
      in[i] = 1;
    }
    else {
      move_outside(i);
      candidate.push_back(i);
    }
  }

  int l = 2, r = n / type, ans = 1;
  int cur = 1;
//  cout << type << endl;

  while (l <= r) {
    int mid = (l + r + 1) / 2;
    cout << candidate.size() << endl;
    assert(cur <= mid);
    int last = cur;
    for(auto &i : candidate) {
      move_inside(i);
      int nxt = press_button();
      if (nxt > mid) {
        move_outside(i);
        in[i] = 0;
      }
      else {
        cur = nxt;
        in[i] = 1;
      }
    }
    int total = 0;
    for(int i = 0; i < n; i++) total += in[i];
    vector<int> _candidate;

    if (cur == mid && mid * type == total) {
      for(auto &i : candidate) if (!in[i]) _candidate.push_back(i);
      l = mid + 1;
      ans = mid;
    }
    else {
      for(auto &i : candidate) if (in[i]) {
        _candidate.push_back(i);
        move_outside(i);
        in[i] = 0;
      }
      r = mid - 1;
      cur = last;
    }
    candidate = _candidate;
  }
  return ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Secret mismatch (possible tampering with the output)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Secret mismatch (possible tampering with the output)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Secret mismatch (possible tampering with the output)
2 Halted 0 ms 0 KB -