| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1052230 | TahirAliyev | Counting Mushrooms (IOI20_mushrooms) | C++17 | 5 ms | 596 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 = 140;
     
    int count_mushrooms(int n){
    	vector<int> v[2];
    	v[0] = {0};
    	int i = 1;
    	for(; i < min(3, n) && (int)max(v[0].size(), v[1].size()) < 2; i++){
    		v[use_machine({0, i})].push_back(i);
    	}
    	int t = (v[0].size() < v[1].size());
    	for(; i + 1 < n && (int)max(v[0].size(), v[1].size()) < B; i += 2){
    		int a = use_machine({i, v[t][0], i + 1, v[t][1]}); 
    		v[t ^ (a & 1)].push_back(i);
    		v[t ^ bool(a & 2)].push_back(i + 1);
    	}
    	if(i == n - 1){
    		v[use_machine({0, i})].push_back(i);
    		i++;
    	}
    	int ans = v[0].size();
    	if(i == n) return ans;
    	t = (v[0].size() < v[1].size());
    	while(i < n){
    		vector<int> tmp;
    		for(int j = 0; j < v[t].size() && i < n; j++, i++){
    			tmp.push_back(v[t][j]);
    			tmp.push_back(i);
    		}
    		if(t) ans += (use_machine(tmp) + 1) / 2;
    		else ans += (tmp.size() / 2) - (use_machine(tmp) + 1) / 2;
    	}
    	return ans;
    }
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
