# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1051534 | 2024-08-10T07:53:00 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 int count_mushrooms(int n){ int ans = 1; for(int i = 1; i + 1 < n; i++){ ans += 2 - use_machine({i, 0, i + 1}); } if(n % 2 == 0) ans += 1 - use_machine({n - 1, 0}); return ans; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Answer is not correct. |
3 | Halted | 0 ms | 0 KB | - |