| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1298188 | orgiloogii | Counting Mushrooms (IOI20_mushrooms) | C++20 | 0 ms | 0 KiB |
#include "mushrooms.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
//int count_mushrooms(int n) {
// std::vector<int> m;
// for (int i = 0; i < n; i++)
// m.push_back(i);
// int c1 = use_machine(m);
// m = {0, 1};
// int c2 = use_machine(m);
// return c1+c2;
//}
int count_mushrooms(int n) {
// vector <int> m;
vector <int> as, bs;
as.push_back(0);
int i = 1;
while (i < n && as.size() < 100 && bs.size() < 100) {
if (use_machine({0, i}) == 1) {
bs.push_back(i);
}
else {
as.push_back(i);
}
i++;
}
if (i == n) {
return as.size();
}
ans = as.size();
if (bs.size() == 100) {
while (i < n) {
int j = i + 1;
vector <int> m;
while (j < n && j <= i + 100) {
m.push_back(bs[j - i - 1]);
m.push_back(j);
j++;
}
int c = use_machine(m);
if (c % 2 == 1) {
ans += 1;
}
ans += c / 2;
i = j;
}
return ans;
}
while (i < n) {
int j = i + 1;
int cnt = 0;
vector <int> m;
while (j < n && j <= i + 100) {
m.push_back(as[j - i - 1]);
m.push_back(j);
j++;
cnt++;
}
int c = use_machine(m);
ans += cnt - (c / 2);
}
return ans;
}