# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
628784 | study | Rarest Insects (IOI22_insects) | C++17 | 349 ms | 300 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
int min_cardinality(int N) {
vector<int> a(N);
for (int i=0; i<N; ++i){
a[i] = i;
}
random_shuffle(a.begin(),a.end());
bitset<2000> inside;
int nbElems = 0;
for (int i=0; i<N; ++i){
move_inside(a[i]);
int maxFreq = press_button();
if (maxFreq > 1) move_outside(a[i]);
else{
++nbElems;
inside[a[i]] = true;
}
}
if (nbElems == 1) return N;
int in = nbElems, crt = 1;
for (int iter=0; iter<N; ++iter){
vector<int> idx;
for (int i=0; i<N; ++i){
if (!inside[a[i]]) idx.emplace_back(a[i]);
}
if (idx.empty()) return crt;
// random_shuffle(idx.begin(),idx.end());
for (int i=0; i<idx.size(); ++i){
move_inside(idx[i]);
if (press_button() == crt+1){
in++;
inside[idx[i]] = true;
}
else move_outside(idx[i]);
if (in%nbElems == 0) ++crt;
}
}
return crt;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |