| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1033338 | happy_node | Counting Mushrooms (IOI20_mushrooms) | C++17 | 2 ms | 344 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;
int count_mushrooms(int N) {
	vector<int> posA, posB;
	posA.push_back(0);
 
	int ans=posA.size();
	for(int i=1;i<N;i++) {
		if(posA.size()>posB.size()) {
			int s=posA.size();
			vector<int> qry;
			for(int j=i;j<min(N,i+s);j++) {
				qry.push_back(posA[j-i]);
				qry.push_back(j);
			}	
			int w=use_machine(qry);
			if(w&1) posB.push_back(qry.back());
			else posA.push_back(qry.back());
			w=(w+1)/2;
			ans+=(qry.size()/2-w);
			i+=s-1;
			if(w==qry.size()/2) {
				for(int j=1;j+1<qry.size();j+=2) {
					posA.push_back(qry[j]);
				}
			} else if(w==0) {
				for(int j=1;j+1<qry.size();j+=2) {
					posB.push_back(qry[j]);
				}
			}
		} else {
			int s=posB.size();
			vector<int> qry;
			for(int j=i;j<min(N,i+s);j++) {
				qry.push_back(posB[j-i]);
				qry.push_back(j);
			}	
			int w=use_machine(qry);
			if(w&1) posA.push_back(qry.back());
			else posB.push_back(qry.back());
			w=(w+1)/2;
			if(w==qry.size()/2) {
				for(int j=1;j+1<qry.size();j+=2) {
					posA.push_back(qry[j]);
				}
			} else if(w==0) {
				for(int j=1;j+1<qry.size();j+=2) {
					posB.push_back(qry[j]);
				}
			}
			
			ans+=w;
			i+=s-1;
		}
	}
 
	return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
