oj.uz

Submission #1000039

# Submission time Handle Problem Language Result Execution time Memory
1000039 2024-06-16T13:50:37 Z kunzaZa183 Rarest Insects (IOI22_insects) C++17
0 / 100
 0 ms 344 KB 
#include "insects.h"

#include <bits/stdc++.h>
using namespace std;

int min_cardinality(int N) {
  vector<int> cur;
  vector<int> each(N);
  int ct = 0;
  for (int i = 0; i < N; i++) {
    cur.push_back(i);
    move_inside(i);
    int res = press_button();
    if (res == 1)
      each[i] = ct++;
    else {
      for (auto a : cur) {
        move_outside(a);
        res = press_button();
        if (res == 1) {
          each[i] = each[a];
          break;
        }
        move_inside(a);
      }
      cur.pop_back();
    }
  }
  map<int, int> mii;
  for (auto a : each) mii[a]++;
  vector<pair<int, int>> vpii;
  for (auto [a, b] : mii) vpii.emplace_back(b, a);
  sort(vpii.begin(), vpii.end());
  return find(each.begin(), each.end(), vpii.front().second) - each.begin();
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong answer.
2 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 Incorrect 0 ms 344 KB Wrong answer.
3 Halted 0 ms 0 KB -