# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753602 | tolbi | Counting Mushrooms (IOI20_mushrooms) | C++17 | 10 ms | 640 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.
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "mushrooms.h"
int count_mushrooms(int n) {
int sqv = 80;
vector<int> zeros={0};
vector<int> ones;
vector<int> ar(n-1);
iota(ar.begin(), ar.end(), 1);
while (max(zeros.size(), ones.size())<sqv && ar.size()>0){
if (ar.size()==1 || max(zeros.size(), ones.size())<=1){
if (use_machine({0,ar.back()})){
ones.push_back(ar.back());
}
else {
zeros.push_back(ar.back());
}
ar.pop_back();
continue;
}
int x = ar.back();
ar.pop_back();
int y = ar.back();
ar.pop_back();
if (zeros.size()>=2){
int kk = use_machine({zeros[0],x,zeros.back(),y});
if (kk&1) ones.push_back(y);
else zeros.push_back(y);
if (kk&2) ones.push_back(x);
else zeros.push_back(x);
}
else {
int kk = use_machine({ones[0],x,ones.back(),y});
if (kk&1) zeros.push_back(y);
else ones.push_back(y);
if (kk&2) zeros.push_back(x);
else ones.push_back(x);
}
}
int ans = 0;
while (ar.size()>0){
if (zeros.size()>ones.size()){
vector<int> ask;
for (int i = 0; i < zeros.size(); i++){
ask.push_back(zeros[i]);
ask.push_back(ar.back());
ar.pop_back();
if (ar.size()==0) break;
}
int kk = use_machine(ask);
ans+=ask.size()/2-(kk+1)/2;
if (kk&1) ones.push_back(ask.back());
else zeros.push_back(ask.back()),ans--;
}
else {
vector<int> ask;
for (int i = 0; i < ones.size(); i++){
ask.push_back(ones[i]);
ask.push_back(ar.back());
ar.pop_back();
if (ar.size()==0) break;
}
int kk = use_machine(ask);
ans+=(kk+1)/2;
if (kk&1) zeros.push_back(ask.back()),ans--;
else ones.push_back(ask.back());
}
}
return zeros.size()+ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |