| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 776075 | 2023-07-07T09:21:38 Z | boris_mihov | 버섯 세기 (IOI20_mushrooms) | C++17 | 8 ms | 476 KB |
#include "mushrooms.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <random>
#include <vector>
typedef long long llong;
const int BUCKET_SIZE = 100;
const int MAXN = 100000 + 10;
const int INF = 1e9;
int min[MAXN];
int max[MAXN];
std::vector <int> order;
std::mt19937 rng(69420);
int count_mushrooms(int n)
{
order.resize(n);
std::iota(order.begin(), order.end(), 0);
std::shuffle(order.begin() + 1, order.end(), rng);
int ptr = 1;
std::vector <int> a, b;
a.push_back(order[0]);
while (ptr < n && a.size() < BUCKET_SIZE && b.size() < BUCKET_SIZE)
{
std::vector <int> curr;
if (ptr + 1 == n || (a.size() <= 1 && b.size() <= 1))
{
curr.push_back(order[0]);
curr.push_back(order[ptr]);
int res = use_machine(curr);
if (res == 0)
{
a.push_back(order[ptr]);
} else
{
b.push_back(order[ptr]);
}
ptr++;
} else
{
if (a.size() >= 2)
{
curr.push_back(a[0]);
curr.push_back(order[ptr]);
curr.push_back(a[1]);
curr.push_back(order[ptr + 1]);
int res = use_machine(curr);
if (res & 1) b.push_back(order[ptr + 1]);
else a.push_back(order[ptr + 1]);
if (res & 2) b.push_back(order[ptr]);
else a.push_back(order[ptr]);
ptr += 2;
} else
{
curr.push_back(b[0]);
curr.push_back(order[ptr]);
curr.push_back(b[1]);
curr.push_back(order[ptr + 1]);
int res = use_machine(curr);
if (res & 1) a.push_back(order[ptr + 1]);
else b.push_back(order[ptr + 1]);
if (res & 2) a.push_back(order[ptr]);
else b.push_back(order[ptr]);
ptr += 2;
}
}
}
if (ptr == n)
{
return a.size();
}
int ans = a.size();
if (a.size() >= BUCKET_SIZE)
{
std::vector <int> next;
while (ptr < n)
{
if (next.size() == a.size())
{
std::vector <int> toAsk;
for (int i = 0 ; i < a.size() ; ++i)
{
toAsk.push_back(a[i]);
toAsk.push_back(next[i]);
}
int res = use_machine(toAsk);
bool decr = false;
if (res & 1)
{
ans--;
res--;
} else
{
a.push_back(toAsk.back());
decr = true;
}
ans -= res >> 1;
ans += a.size() - decr;
next.clear();
} else
{
next.push_back(order[ptr++]);
}
}
if (next.size())
{
std::vector <int> toAsk;
for (int i = 0 ; i < next.size() ; ++i)
{
toAsk.push_back(a[i]);
toAsk.push_back(next[i]);
}
int res = use_machine(toAsk);
if (res & 1)
{
ans--;
res--;
}
ans -= res >> 1;
ans += next.size();
}
return ans;
} else
{
assert(b.size() >= BUCKET_SIZE);
std::vector <int> next;
while (ptr < n)
{
if (next.size() == b.size())
{
std::vector <int> toAsk;
for (int i = 0 ; i < b.size() ; ++i)
{
toAsk.push_back(b[i]);
toAsk.push_back(next[i]);
}
int res = use_machine(toAsk);
if (res & 1)
{
ans++;
res--;
} else
{
b.push_back(toAsk.back());
}
ans += res >> 1;
next.clear();
} else
{
next.push_back(order[ptr++]);
}
}
if (next.size())
{
std::vector <int> toAsk;
for (int i = 0 ; i < next.size() ; ++i)
{
toAsk.push_back(b[i]);
toAsk.push_back(next[i]);
}
int res = use_machine(toAsk);
if (res & 1)
{
ans++;
res--;
}
ans += res >> 1;
}
return ans;
}
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 208 KB | Output is correct |
| 2 | Correct | 0 ms | 208 KB | Output is correct |
| 3 | Correct | 0 ms | 208 KB | Output is correct |
| 4 | Correct | 0 ms | 208 KB | Output is correct |
| 5 | Correct | 1 ms | 208 KB | Output is correct |
| 6 | Correct | 1 ms | 208 KB | Output is correct |
| 7 | Correct | 5 ms | 396 KB | Output is correct |
| 8 | Correct | 5 ms | 336 KB | Output is correct |
| 9 | Correct | 7 ms | 336 KB | Output is correct |
| 10 | Correct | 7 ms | 400 KB | Output is correct |
| 11 | Partially correct | 5 ms | 408 KB | Output is partially correct |
| 12 | Correct | 6 ms | 408 KB | Output is correct |
| 13 | Correct | 7 ms | 336 KB | Output is correct |
| 14 | Correct | 4 ms | 336 KB | Output is correct |
| 15 | Partially correct | 6 ms | 336 KB | Output is partially correct |
| 16 | Partially correct | 6 ms | 336 KB | Output is partially correct |
| 17 | Correct | 4 ms | 476 KB | Output is correct |
| 18 | Correct | 5 ms | 392 KB | Output is correct |
| 19 | Partially correct | 6 ms | 388 KB | Output is partially correct |
| 20 | Correct | 6 ms | 396 KB | Output is correct |
| 21 | Correct | 5 ms | 408 KB | Output is correct |
| 22 | Partially correct | 6 ms | 404 KB | Output is partially correct |
| 23 | Correct | 5 ms | 404 KB | Output is correct |
| 24 | Correct | 3 ms | 336 KB | Output is correct |
| 25 | Partially correct | 5 ms | 336 KB | Output is partially correct |
| 26 | Partially correct | 6 ms | 336 KB | Output is partially correct |
| 27 | Partially correct | 5 ms | 336 KB | Output is partially correct |
| 28 | Partially correct | 6 ms | 400 KB | Output is partially correct |
| 29 | Partially correct | 7 ms | 404 KB | Output is partially correct |
| 30 | Partially correct | 6 ms | 400 KB | Output is partially correct |
| 31 | Partially correct | 6 ms | 336 KB | Output is partially correct |
| 32 | Partially correct | 7 ms | 396 KB | Output is partially correct |
| 33 | Partially correct | 6 ms | 400 KB | Output is partially correct |
| 34 | Partially correct | 6 ms | 336 KB | Output is partially correct |
| 35 | Partially correct | 7 ms | 404 KB | Output is partially correct |
| 36 | Partially correct | 5 ms | 412 KB | Output is partially correct |
| 37 | Partially correct | 6 ms | 408 KB | Output is partially correct |
| 38 | Partially correct | 7 ms | 412 KB | Output is partially correct |
| 39 | Partially correct | 5 ms | 336 KB | Output is partially correct |
| 40 | Partially correct | 7 ms | 412 KB | Output is partially correct |
| 41 | Partially correct | 5 ms | 336 KB | Output is partially correct |
| 42 | Partially correct | 8 ms | 412 KB | Output is partially correct |
| 43 | Partially correct | 5 ms | 336 KB | Output is partially correct |
| 44 | Partially correct | 6 ms | 404 KB | Output is partially correct |
| 45 | Partially correct | 6 ms | 404 KB | Output is partially correct |
| 46 | Partially correct | 6 ms | 336 KB | Output is partially correct |
| 47 | Partially correct | 7 ms | 408 KB | Output is partially correct |
| 48 | Partially correct | 7 ms | 404 KB | Output is partially correct |
| 49 | Partially correct | 6 ms | 336 KB | Output is partially correct |
| 50 | Partially correct | 6 ms | 336 KB | Output is partially correct |
| 51 | Partially correct | 7 ms | 336 KB | Output is partially correct |
| 52 | Partially correct | 5 ms | 336 KB | Output is partially correct |
| 53 | Partially correct | 5 ms | 336 KB | Output is partially correct |
| 54 | Partially correct | 6 ms | 396 KB | Output is partially correct |
| 55 | Partially correct | 6 ms | 420 KB | Output is partially correct |
| 56 | Partially correct | 6 ms | 404 KB | Output is partially correct |
| 57 | Partially correct | 6 ms | 404 KB | Output is partially correct |
| 58 | Partially correct | 7 ms | 404 KB | Output is partially correct |
| 59 | Partially correct | 6 ms | 400 KB | Output is partially correct |
| 60 | Partially correct | 7 ms | 336 KB | Output is partially correct |
| 61 | Partially correct | 6 ms | 396 KB | Output is partially correct |
| 62 | Correct | 0 ms | 208 KB | Output is correct |
| 63 | Correct | 0 ms | 208 KB | Output is correct |
| 64 | Correct | 0 ms | 208 KB | Output is correct |
| 65 | Correct | 0 ms | 208 KB | Output is correct |
| 66 | Correct | 0 ms | 208 KB | Output is correct |
| 67 | Correct | 0 ms | 208 KB | Output is correct |
| 68 | Correct | 0 ms | 208 KB | Output is correct |
| 69 | Correct | 0 ms | 208 KB | Output is correct |
| 70 | Correct | 0 ms | 208 KB | Output is correct |
| 71 | Correct | 0 ms | 208 KB | Output is correct |
| 72 | Correct | 0 ms | 208 KB | Output is correct |
| 73 | Correct | 0 ms | 208 KB | Output is correct |
| 74 | Correct | 0 ms | 208 KB | Output is correct |
| 75 | Correct | 0 ms | 208 KB | Output is correct |
| 76 | Correct | 0 ms | 208 KB | Output is correct |
| 77 | Correct | 0 ms | 208 KB | Output is correct |
| 78 | Correct | 0 ms | 208 KB | Output is correct |
| 79 | Correct | 0 ms | 208 KB | Output is correct |
| 80 | Correct | 0 ms | 208 KB | Output is correct |
| 81 | Correct | 1 ms | 208 KB | Output is correct |
| 82 | Correct | 0 ms | 208 KB | Output is correct |
| 83 | Correct | 0 ms | 208 KB | Output is correct |
| 84 | Correct | 0 ms | 208 KB | Output is correct |
| 85 | Correct | 0 ms | 208 KB | Output is correct |
| 86 | Correct | 0 ms | 208 KB | Output is correct |
| 87 | Correct | 0 ms | 208 KB | Output is correct |
| 88 | Correct | 1 ms | 208 KB | Output is correct |
| 89 | Correct | 0 ms | 208 KB | Output is correct |
| 90 | Correct | 0 ms | 208 KB | Output is correct |
| 91 | Correct | 0 ms | 208 KB | Output is correct |