# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
629611 | flashmt | Rarest Insects (IOI22_insects) | C++17 | 63 ms | 444 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;
pair<vector<int>, vector<int>> findFirstOccurrences(vector<int> id, int maxC, int expectedSize)
{
vector<int> good, bad;
for (int i : id)
{
if (size(good) == expectedSize)
{
bad.push_back(i);
continue;
}
move_inside(i);
if (press_button() <= maxC) good.push_back(i);
else
{
move_outside(i);
bad.push_back(i);
}
}
for (int i : good)
move_outside(i);
return {good, bad};
}
int min_cardinality(int n)
{
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... |