# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011319 | 2024-06-30T10:25:02 Z | lev1106 | Counting Mushrooms (IOI20_mushrooms) | C++17 | 6 ms | 344 KB |
#include <cstdio> #include <cstdlib> #include <cstdarg> #include <string> #include "mushrooms.h" #include <vector> #include <iostream> int sz = 100; int count_mushrooms(int n) { int cnt = 1, i = 0; bool cur = 0; std::vector<int> v0, v1; v0.push_back(0); for (i = 0; i <= n - 2; i++) { if (use_machine({i, i + 1})) cur ^= 1; if (!cur) cnt++, v0.push_back(i + 1); else v1.push_back(i + 1); if (std::max(v0.size(), v1.size()) >= sz + 1) { i += 2; break; } } bool sw = 0; if (v0.size() < v1.size()) swap(v0, v1), sw = 1; for (; i < n - 1; i++) { //std::cout << i << "!!!\n"; std::vector<int> v; for (int j = i; j <= std::min(i + sz, n) - 1; j++) { v.push_back(v0[j - i]); v.push_back(j); } v.push_back(v0[sz]); //for (auto j : v) std::cout << j << " "; //std::cout << " ||| " << 10 - use_machine(v) << " " << 10 - use_machine(v) / 2 << "\n"; if (!sw) cnt += v.size() / 2 - use_machine(v) / 2; else cnt += use_machine(v) / 2; i += sz - 1; } return cnt; }
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 | Correct | 2 ms | 344 KB | Output is correct |
7 | Partially correct | 4 ms | 344 KB | Output is partially correct |
8 | Partially correct | 3 ms | 344 KB | Output is partially correct |
9 | Partially correct | 4 ms | 344 KB | Output is partially correct |
10 | Partially correct | 4 ms | 344 KB | Output is partially correct |
11 | Partially correct | 6 ms | 344 KB | Output is partially correct |
12 | Partially correct | 4 ms | 344 KB | Output is partially correct |
13 | Partially correct | 3 ms | 344 KB | Output is partially correct |
14 | Partially correct | 2 ms | 344 KB | Output is partially correct |
15 | Partially correct | 6 ms | 344 KB | Output is partially correct |
16 | Partially correct | 4 ms | 344 KB | Output is partially correct |
17 | Partially correct | 2 ms | 344 KB | Output is partially correct |
18 | Partially correct | 4 ms | 344 KB | Output is partially correct |
19 | Incorrect | 4 ms | 344 KB | Answer is not correct. |
20 | Halted | 0 ms | 0 KB | - |