# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757709 | boris_mihov | Rarest Insects (IOI22_insects) | C++17 | 70 ms | 428 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 "insects.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <random>
#include <cassert>
#include <vector>
typedef long long llong;
const int MAXN = 2000 + 10;
const int INF = 1e9;
int n, d;
int perm[MAXN];
bool isInside[MAXN];
std::vector <int> inside;
std::vector <int> toRemove;
std::vector <int> lastlyAdded;
void moveInside(int idx)
{
assert(!isInside[idx]);
move_inside(perm[idx]);
}
void moveOutside(int idx)
{
move_outside(perm[idx]);
}
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... |