# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1051637 | 2024-08-10T08:45:06 Z | TahirAliyev | Counting Mushrooms (IOI20_mushrooms) | C++17 | 0 ms | 344 KB |
#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 = 200; int count_mushrooms(int n){ int ans = 0, cur = 0, t = 0; vector<int> id; for(int i = 0; i < n; i++) id.push_back(i); random_shuffle(all(id)); vector<int> one; while(one.size() < B && cur < n){ int l = cur, r = n - 1; while(l < r){ int mid = (l + r + 1) / 2; vector<int> v; for(int i = l; i <= mid; i++) v.push_back(id[i]); if(!use_machine(v)) l = mid; else r = mid - 1; } if(t) for(int i = cur; i <= l; i++) one.push_back(i); else ans += l - cur + 1; t ^= 1; cur = l + 1; } while(cur < n){ vector<int> v; for(int i = 0; i < one.size() && cur < n; i++, cur++){ v.push_back(id[one[i]]); v.push_back(id[cur]); } ans += (use_machine(v) + 1) / 2; } return ans; }
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 | Incorrect | 0 ms | 344 KB | Answer is not correct. |
4 | Halted | 0 ms | 0 KB | - |