| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1051764 | TahirAliyev | Counting Mushrooms (IOI20_mushrooms) | C++17 | 7 ms | 852 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>
using namespace std;
#define pii pair<int, int>
#define ll long long
#define all(v) v.begin(), v.end()
#define oo 1e9
const int B = 100;
int count_mushrooms(int n){
	vector<int> id;
	for(int i = 0; i < n; i++) id.push_back(i);
	random_shuffle(id.begin() + 1, id.end());
	vector<int> one, zer = {0};
	int i = 1;
	for(; i < n && (int)max(zer.size(), one.size()) < B && i < n; i++){
		if(use_machine({0, id[i]})) one.push_back(i);
		else zer.push_back(i);
	}
	int ans = zer.size();
	if(i == n) return ans;
	int t = 1;
	if(zer.size() > one.size()){
		swap(zer, one);
		t = 0;
	} 
	while(i < n){
		vector<int> v;
		for(int j = 0; j < one.size() && i < n; j++, i++){
			v.push_back(id[one[j]]);
			v.push_back(id[i]);
		}
		if(t) ans += (use_machine(v) + 1) / 2;
		else ans += (v.size() / 2) - (use_machine(v) + 1) / 2;
	}
	return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
