# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021331 | Ahmed_Solyman | Counting Mushrooms (IOI20_mushrooms) | C++14 | 7 ms | 448 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.
/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int use_machine(vector<int>x);
int count_mushrooms(int n){
if(n<=226){
int ret=1;
for(int i=1;i<n;i++){
ret+=1-use_machine({0,i});
}
return ret;
}
int ret=0,k=100;
vector<int>v[2];
v[0].push_back(0);
for(int i=1;i<=2*k-2;i++){
if(use_machine({0,i})==0)v[0].push_back(i);
else v[1].push_back(i);
}
bool typ;
vector<int>g;
if(v[0].size()>=k){
typ=0;
for(int i=0;i<k;i++)g.push_back(v[0][i]);
}
else{
typ=1;
for(int i=0;i<k;i++)g.push_back(v[1][i]);
}
auto f=[&](int l,int r){
vector<int>p;
p.push_back(g[0]);
for(int i=l;i<=r;i++){
p.push_back(i);
p.push_back(g[i-l+1]);
}
int g=use_machine(p);
if(typ)return g/2;
else return r-l+1-g/2;
};
ret=(int)v[0].size();
int st=2*k-1;
k--;
for(int i=st;i<n;i+=k){
ret+=f(i,min(i+k-1,n-1));
}
return ret;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |