| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 395627 | snasibov05 | 버섯 세기 (IOI20_mushrooms) | C++14 | 12 ms | 348 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"
#define pb push_back
using namespace std;
int count_mushrooms(int n) {
vector<int> a, b;
a.pb(0);
int l = 1;
int ans = 1;
while (l < n){
if (a.size() > b.size()){
vector<int> v;
int k = l;
for (int i = 0; i < a.size() && l < n; ++i) {
v.pb(l++);
v.pb(a[i]);
}
int x = use_machine(v);
if (x%2 == 0) a.pb(k);
else b.pb(k);
int y = (x + 1) / 2;
ans += (l - k) - y;
}
else{
vector<int> v;
int k = l;
for (int i = 0; i < b.size() && l < n; ++i) {
v.pb(l++);
v.pb(b[i]);
}
int x = use_machine(v);
if (x%2 == 0) b.pb(k);
else a.pb(k);
int y = (x + 1) / 2;
ans += y;
}
}
return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
