# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1018908 | NintsiChkhaidze | Counting Mushrooms (IOI20_mushrooms) | C++17 | 6 ms | 704 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 "mushrooms.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
vector <int> v[3];
int count_mushrooms(int n) {
v[0].pb(0);
int bl = 2*log2(n);
for (int i = 1; i <= min(bl,n - 1); i++){
vector <int> k; k.pb(0); k.pb(i);
int res = use_machine(k);
if (!res) v[0].pb(i);
else v[1].pb(i);
}
int ans = (int)v[0].size();
int id = bl + 1;
while (id < n){
int m = max(v[0].size(),v[1].size()),d;
vector <int> vec;
if (m == v[0].size()){
vec = v[0];
d = 0;
}else{
vec = v[1];
d = 1;
}
vector <int> k;
int len = 0;
for (int i = id; i <= min(n - 1,id + m - 1); i++){
++len;
k.pb(i);
k.pb(vec[i - id]);
}
int s = use_machine(k);
int ls = s % 2;
s -= ls;
int sum = s/2 + ls;
if (d) ans += sum;
else ans += (len - sum);
if (!ls) v[d].pb(id);
else v[!d].pb(id);
id += m;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |