# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927760 | haxorman | Counting Mushrooms (IOI20_mushrooms) | C++14 | 65 ms | 1504 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.
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
int count_mushrooms(int n) {
vector<int> arr = {0};
for (int i = 0; i < n - 3; i += 3) {
vector<int> check = {i, i + 1, i + 2, i + 3};
int res = use_machine(check);
if (!res) {
for (int k = 0; k < 3; ++k) {
arr.push_back(arr[i]);
}
}
else if (res == 3) {
for (int k = 0; k < 3; ++k) {
arr.push_back(arr[i] ^ (k&1^1));
}
}
else if (res == 1) {
check = {i + 1, i + 3, i + 2};
res = use_machine(check);
if (!res) {
for (int k = 0; k < 3; ++k) {
arr.push_back(arr[i] ^ 1);
}
}
else if (res == 1) {
arr.push_back(arr[i]);
arr.push_back(arr[i] ^ 1);
arr.push_back(arr[i] ^ 1);
}
else {
arr.push_back(arr[i]);
arr.push_back(arr[i]);
arr.push_back(arr[i] ^ 1);
}
}
else {
check = {i, i + 1, i + 3, i + 2};
res = use_machine(check);
if (res == 1) {
for (int k = 0; k < 3; ++k) {
arr.push_back(arr[i] ^ (k&1));
}
}
else if (res == 2) {
arr.push_back(arr[i] ^ 1);
arr.push_back(arr[i]);
arr.push_back(arr[i]);
}
else {
arr.push_back(arr[i] ^ 1);
arr.push_back(arr[i] ^ 1);
arr.push_back(arr[i]);
}
}
}
while (arr.size() < n) {
arr.push_back(arr.back() ^
use_machine({(int)arr.size() - 1, (int)arr.size()}));
}
int cnt = 0;
for (int i = 0; i < arr.size(); ++i) {
cnt += !arr[i];
}
return cnt;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |