| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 711790 | mseebacher | Counting Mushrooms (IOI20_mushrooms) | C++17 | 119 ms | 208 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 "mushrooms.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int count_mushrooms(int n){
vector<int> a(2);
a[0] = 0;
a[1] = 1;
if(n == 1) return 1;
int ans = 1;
if(n % 2 == 0) ans += use_machine(a) == 1 ? 0 : 1;
a.assign(3,0);
int i = (n%2==0) ? 2 : 1;
for(;i<n-1;i+=2){
a[0] = i;
a[2] = i+1;
int x = use_machine(a);
if(x == 0) ans+=2;
if(x == 1) ans++;
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||