# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800527 | FEDIKUS | Counting Mushrooms (IOI20_mushrooms) | C++17 | 1 ms | 208 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;
const int maxn=20010;
int count_mushrooms(int n) {
vector<int> aovi;
vector<int> bovi;
int w=100;
int ret=0;
for(int i=1;i<n;i++){
if(aovi.size()>=w){
vector<int> tmp;
for(int j=i;j<min(i+w,n);j++){
tmp.push_back(aovi[j-i]);
tmp.push_back(j);
}
int klkb=use_machine(tmp);
klkb=klkb/2+(klkb&1);
int klka=tmp.size()/2-klkb;
ret+=klka;
i+=w-1;
continue;
}
if(bovi.size()>=w){
vector<int> tmp;
for(int j=i;j<min(i+w,n);j++){
tmp.push_back(bovi[j-i]);
tmp.push_back(j);
}
int klka=use_machine(tmp);
klka=klka/2+(klka&1);
ret+=klka;
i+=w-1;
continue;
}
if(use_machine({0,i})==0) aovi.push_back(i);
else bovi.push_back(i);
ret=aovi.size();
if(aovi.size()>=w || bovi.size()>=w) break;
}
return ret+1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |