# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
884764 | weajink | Counting Mushrooms (IOI20_mushrooms) | C++17 | 7 ms | 1072 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>
using namespace std;
typedef long long ll;
#ifdef LOCAL
#define debug(...) __VA_ARGS__
#else
#define debug(...) {}
#endif
int znajdz_czarny(int n){
int p = 1;
int k = n;
int s;
while (p < k){
s = (p+k)/2;
vector<int> zap;
for (int i = 0; i <= s; i++) zap.push_back(i);
if (!use_machine(zap)) p = s+1;
else{
k = s;
}
}
s = (p+k)/2;
return s;
}
int count_mushrooms(int n){
vector<int> znane[2];
znane[0].push_back(0);
int czarny = znajdz_czarny(n);
if (czarny == n) return n;
znane[1].push_back(czarny);
int wartosc[n];
for (int i = 0; i < n; i++) wartosc[i] = i;
swap(wartosc[1],wartosc[czarny]);
int ile[2];
ile[0] = 1;
ile[1] = 1;
int akt = 2;
while (akt < n){
bool better = (znane[0].size()<znane[1].size());
int pt = 0;
vector<int> zap;
for (; akt < n && pt < znane[better].size();akt++, pt++){
zap.push_back(znane[better][pt]);
zap.push_back(wartosc[akt]);
}
int wy = use_machine(zap);
if (wy%2) znane[!better].push_back(wartosc[akt-1]);
else znane[better].push_back(wartosc[akt-1]);
ile[better] += pt-(wy+1)/2;
ile[!better] += (wy+1)/2;
}
return ile[0];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |