| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1058432 | 2024-08-14T09:58:04 Z | SalihSahin | Rarest Insects (IOI22_insects) | C++17 | 119 ms | 932 KB |
#include<bits/stdc++.h>
#include "insects.h"
#define pb push_back
using namespace std;
/*
static inline constexpr int kMaxQueries = 40000;
static int N;
// Insect types are compressed to colors in the range [0, N).
static std::vector<int> color;
static std::vector<bool> in_box;
static std::vector<int> color_occurrences;
static std::multiset<int> max_occurrences;
static std::vector<int> op_counter(3, 0);
static inline void protocol_violation(std::string message) {
printf("Protocol Violation: %s\n", message.c_str());
exit(0);
}
void move_inside(int i) {
if (i < 0 || i >= N) {
protocol_violation("invalid parameter");
}
++op_counter[0];
if (op_counter[0] > kMaxQueries) {
protocol_violation("too many calls");
}
if (!in_box[i]) {
in_box[i] = true;
max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
++color_occurrences[color[i]];
max_occurrences.insert(color_occurrences[color[i]]);
}
}
void move_outside(int i) {
if (i < 0 || i >= N) {
protocol_violation("invalid parameter");
}
++op_counter[1];
if (op_counter[1] > kMaxQueries) {
protocol_violation("too many calls");
}
if (in_box[i]) {
in_box[i] = false;
max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
--color_occurrences[color[i]];
max_occurrences.insert(color_occurrences[color[i]]);
}
}
int press_button() {
++op_counter[2];
if (op_counter[2] > kMaxQueries) {
protocol_violation("too many calls");
}
return *(max_occurrences.rbegin());
}
*/
int min_cardinality(int N) {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> cik;
int colcnt = 0;
for(int i = 0; i < N; i++){
move_inside(i);
colcnt++;
int val = press_button();
if(val == 2){
move_outside(i);
colcnt--;
}
else cik.pb(i);
}
for(auto itr: cik){
move_outside(itr);
}
cik.clear();
vector<int> rem, nrem;
for(int i = 0; i < N; i++){
rem.pb(i);
}
int ans = 0;
for(int i = 10; i >= 0; i--){
int val = (1 << i);
vector<int> out;
int cnt = 0;
for(auto it: rem){
cnt++;
move_inside(it);
int check = press_button();
if(check > ans + val){
move_outside(it);
out.pb(it);
cnt--;
}
else nrem.pb(it);
}
if(cnt == colcnt * val){
ans += val;
rem = out;
}
else{
for(auto itr: nrem) move_outside(itr);
rem = nrem;
}
nrem.clear();
}
return ans;
}
/*
int main() {
assert(1 == scanf("%d", &N));
color.resize(N);
in_box.assign(N, false);
std::map<int, int> type_to_color;
for (int i = 0; i < N; ++i) {
int Ti;
assert(1 == scanf("%d", &Ti));
if (type_to_color.find(Ti) == type_to_color.end()) {
int new_color = type_to_color.size();
type_to_color[Ti] = new_color;
max_occurrences.insert(0);
}
color[i] = type_to_color[Ti];
}
color_occurrences.assign(type_to_color.size(), 0);
int answer = min_cardinality(N);
int Q = *std::max_element(op_counter.begin(), op_counter.end());
printf("%d\n", answer);
printf("%d\n", Q);
return 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 | 376 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 | 9 ms | 344 KB | Output is correct |
| 8 | Correct | 8 ms | 344 KB | Output is correct |
| 9 | Correct | 8 ms | 344 KB | Output is correct |
| 10 | Correct | 4 ms | 344 KB | Output is correct |
| 11 | Correct | 10 ms | 344 KB | Output is correct |
| 12 | Correct | 6 ms | 344 KB | Output is correct |
| 13 | Correct | 10 ms | 344 KB | Output is correct |
| 14 | Correct | 6 ms | 344 KB | Output is correct |
| 15 | Correct | 7 ms | 344 KB | Output is correct |
| 16 | Correct | 9 ms | 344 KB | Output is correct |
| 17 | Correct | 9 ms | 344 KB | Output is correct |
| 18 | Correct | 9 ms | 344 KB | Output is correct |
| 19 | Correct | 7 ms | 344 KB | Output is correct |
| 20 | Correct | 9 ms | 344 KB | Output is correct |
| 21 | Correct | 13 ms | 344 KB | Output is correct |
| 22 | Correct | 13 ms | 344 KB | Output is correct |
| # | 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 | 376 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 | 9 ms | 344 KB | Output is correct |
| 8 | Correct | 8 ms | 344 KB | Output is correct |
| 9 | Correct | 8 ms | 344 KB | Output is correct |
| 10 | Correct | 4 ms | 344 KB | Output is correct |
| 11 | Correct | 10 ms | 344 KB | Output is correct |
| 12 | Correct | 6 ms | 344 KB | Output is correct |
| 13 | Correct | 10 ms | 344 KB | Output is correct |
| 14 | Correct | 6 ms | 344 KB | Output is correct |
| 15 | Correct | 7 ms | 344 KB | Output is correct |
| 16 | Correct | 9 ms | 344 KB | Output is correct |
| 17 | Correct | 9 ms | 344 KB | Output is correct |
| 18 | Correct | 9 ms | 344 KB | Output is correct |
| 19 | Correct | 7 ms | 344 KB | Output is correct |
| 20 | Correct | 9 ms | 344 KB | Output is correct |
| 21 | Correct | 13 ms | 344 KB | Output is correct |
| 22 | Correct | 13 ms | 344 KB | Output is correct |
| 23 | Correct | 14 ms | 436 KB | Output is correct |
| 24 | Correct | 70 ms | 344 KB | Output is correct |
| 25 | Correct | 34 ms | 440 KB | Output is correct |
| 26 | Correct | 45 ms | 344 KB | Output is correct |
| 27 | Correct | 19 ms | 344 KB | Output is correct |
| 28 | Correct | 40 ms | 696 KB | Output is correct |
| 29 | Correct | 33 ms | 600 KB | Output is correct |
| 30 | Correct | 37 ms | 344 KB | Output is correct |
| 31 | Correct | 26 ms | 344 KB | Output is correct |
| 32 | Correct | 32 ms | 600 KB | Output is correct |
| 33 | Correct | 29 ms | 344 KB | Output is correct |
| 34 | Correct | 32 ms | 344 KB | Output is correct |
| 35 | Correct | 31 ms | 344 KB | Output is correct |
| 36 | Correct | 33 ms | 436 KB | Output is correct |
| 37 | Correct | 58 ms | 592 KB | Output is correct |
| 38 | Correct | 58 ms | 696 KB | Output is correct |
| 39 | Correct | 57 ms | 420 KB | Output is correct |
| 40 | Correct | 56 ms | 344 KB | Output is correct |
| 41 | Correct | 66 ms | 596 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 344 KB | Output is correct |
| 2 | Partially correct | 0 ms | 344 KB | Output is partially correct |
| 3 | Partially correct | 0 ms | 344 KB | Output is partially correct |
| 4 | Partially correct | 0 ms | 344 KB | Output is partially correct |
| 5 | Partially correct | 0 ms | 344 KB | Output is partially correct |
| 6 | Partially correct | 1 ms | 344 KB | Output is partially correct |
| 7 | Correct | 24 ms | 428 KB | Output is correct |
| 8 | Partially correct | 110 ms | 928 KB | Output is partially correct |
| 9 | Partially correct | 61 ms | 436 KB | Output is partially correct |
| 10 | Partially correct | 84 ms | 568 KB | Output is partially correct |
| 11 | Partially correct | 21 ms | 592 KB | Output is partially correct |
| 12 | Partially correct | 73 ms | 932 KB | Output is partially correct |
| 13 | Partially correct | 42 ms | 452 KB | Output is partially correct |
| 14 | Partially correct | 75 ms | 628 KB | Output is partially correct |
| 15 | Partially correct | 54 ms | 600 KB | Output is partially correct |
| 16 | Partially correct | 70 ms | 852 KB | Output is partially correct |
| 17 | Partially correct | 55 ms | 436 KB | Output is partially correct |
| 18 | Partially correct | 46 ms | 676 KB | Output is partially correct |
| 19 | Partially correct | 71 ms | 668 KB | Output is partially correct |
| 20 | Partially correct | 61 ms | 444 KB | Output is partially correct |
| 21 | Partially correct | 83 ms | 680 KB | Output is partially correct |
| 22 | Partially correct | 103 ms | 684 KB | Output is partially correct |
| 23 | Partially correct | 103 ms | 664 KB | Output is partially correct |
| 24 | Partially correct | 119 ms | 436 KB | Output is partially correct |
| 25 | Partially correct | 113 ms | 840 KB | Output is partially correct |
| 26 | Partially correct | 119 ms | 672 KB | Output is partially correct |
| 27 | Partially correct | 63 ms | 432 KB | Output is partially correct |
| 28 | Partially correct | 62 ms | 644 KB | Output is partially correct |
| 29 | Partially correct | 47 ms | 812 KB | Output is partially correct |
| 30 | Partially correct | 59 ms | 580 KB | Output is partially correct |
| 31 | Partially correct | 81 ms | 684 KB | Output is partially correct |
| 32 | Partially correct | 80 ms | 580 KB | Output is partially correct |
| 33 | Partially correct | 88 ms | 680 KB | Output is partially correct |
| 34 | Partially correct | 96 ms | 436 KB | Output is partially correct |
| 35 | Partially correct | 80 ms | 688 KB | Output is partially correct |
| 36 | Partially correct | 72 ms | 672 KB | Output is partially correct |
| 37 | Partially correct | 71 ms | 672 KB | Output is partially correct |
| 38 | Partially correct | 81 ms | 660 KB | Output is partially correct |
| 39 | Partially correct | 65 ms | 932 KB | Output is partially correct |
| 40 | Partially correct | 70 ms | 668 KB | Output is partially correct |
| 41 | Partially correct | 58 ms | 680 KB | Output is partially correct |
| 42 | Partially correct | 64 ms | 568 KB | Output is partially correct |
| 43 | Partially correct | 9 ms | 596 KB | Output is partially correct |
| 44 | Partially correct | 30 ms | 344 KB | Output is partially correct |
| 45 | Partially correct | 51 ms | 688 KB | Output is partially correct |
| 46 | Partially correct | 94 ms | 676 KB | Output is partially correct |
| 47 | Partially correct | 97 ms | 580 KB | Output is partially correct |
| 48 | Partially correct | 85 ms | 688 KB | Output is partially correct |