# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
876375 | Kanon | Counting Mushrooms (IOI20_mushrooms) | C++14 | 0 ms | 0 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 "mushrooms.h"
using namespace std;
const int magic = 100;
const int bound = 226;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// generate random number between l, r : uniform_int_distribution<long long>(l, r)(rng)
// random shuffle : shuffle(.begin(), .end(), rng)
int count_mushrooms(int n) {
if (n <= bound + 1) {
int ret = 1;
for (int i = 1; i < n; i++) {
ret += use_machine({0, i}) ^ 1;
}
return ret;
}
vector<int> a(n, -1);
a[0] = 0;
vector<int> zeros = {0};
vector<int> ones;
int cnt = 1;
while (max(zeros.size(), ones.size()) < magic) {