# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021279 | 2024-07-12T16:37:17 Z | Ahmed_Solyman | Counting Mushrooms (IOI20_mushrooms) | C++14 | 1 ms | 444 KB |
/* 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=94; 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(); --k; for(int i=2*k-1;i<n;i+=k+1){ ret+=f(i,min(i+k,n-1)); } return ret; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Incorrect | 1 ms | 444 KB | Duplicate value 0 in the query array. |
7 | Halted | 0 ms | 0 KB | - |