| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1055047 | pcc | 버섯 세기 (IOI20_mushrooms) | C++17 | 1 ms | 600 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;
const int B = 100;
int count_mushrooms(int n) {
if(n<=B){
int ans = 1;
for(int i = 1;i<n;i++){
int re = use_machine(vector<int>({0,i}));
if(!re)ans++;
}
return ans;
}
vector<int> v[2];
v[0].push_back(0);
int nxt = 1;
for(int i = 1;max(v[0].size(),v[1].size())<B;i++){
int re = use_machine(vector<int>({i*2-1,0,i*2}));
if(re == 0){
v[0].push_back(i*2-1);
v[0].push_back(i*2);
}
else if(re == 2){
v[1].push_back(i*2-1);
v[1].push_back(i*2);
}
else{
re = use_machine(vector<int>({0,i*2-1}));
if(re == 0){
v[0].push_back(i*2-1);
v[1].push_back(i*2);
}
else{
v[1].push_back(i*2-1);
v[0].push_back(i*2);
}
}
nxt = i*2+1;
}
int dir = (v[0].size()<v[1].size());
int cnt[2] = {v[0].size(),v[1].size()};
for(int i = nxt;i<n;i+=v[dir].size()+1){
vector<int> vv;
for(int j = i;j<min(n,i+(int)v[dir].size()+1);j++)vv.push_back(j);
vector<int> req;
for(int j = 0;j<vv.size();j++){
req.push_back(v[dir][j]);
req.push_back(vv[j]);
}
int re = use_machine(req);
if(re&1)re++;
re>>=1;
cnt[dir^1] += re;
cnt[dir] += vv.size()-re;
}
return cnt[0];
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
