# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303738 | Benq | Counting Mushrooms (IOI20_mushrooms) | C++14 | 12 ms | 512 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;
using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
#define tcT template<class T
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
// pairs
#define mp make_pair
#define f first
#define s second
// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
// helper funcs
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
#define tcTU tcT, class U
tcTU> T fstTrue(T lo, T hi, U f) {
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo)/2;
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
lo --; assert(lo <= hi); // assuming f is decreasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo+1)/2;
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
auto it = t.find(u); assert(it != end(t));
t.erase(u); } // element that doesn't exist from (multi)set
// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(vector<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);
tcT> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }
tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(vector<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
return b ? "true" : "false";
#else
return ts((int)b);
#endif
}
tcT> str ts(complex<T> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
str res = ""; F0R(i,SZ) res += char('0'+b[i]);
return res; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
tcTU> str ts(pair<T,U> p) {
#ifdef LOCAL
return "("+ts(p.f)+", "+ts(p.s)+")";
#else
return ts(p.f)+" "+ts(p.s);
#endif
}
// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) {
pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) {
pr(t); if (sizeof...(u)) pr(" "); ps(u...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
cerr << ts(t); if (sizeof...(u)) cerr << ", ";
DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
<< __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
#define dbg(...) 0
#define chk(...) 0
#endif
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
unsyncIO();
// cin.exceptions(cin.failbit);
// throws exception when do smth illegal
// ex. try to read letter into int
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
int count_mushrooms(int n) {
// std::vector<int> m;
V<vi> oops = {{0},{}};
int i = 1; // x+20000/x
while (i < n && sz(oops[0]) < 2 && sz(oops[1]) < 2) {
int col = use_machine({0,i});
oops[col].pb(i); i ++;
}
// dbg(oops[0],oops[1]);
int num = 0;
while (i <= n-5 && (sz(oops[0]) < 100 && sz(oops[1]) < 100)) {
if (sz(oops[0]) >= 3 && sz(oops[1]) >= 2) {
int x = use_machine({oops[0][0],i,oops[0][1],i+1,oops[0][2],i+2});
oops[x&1].pb(i+2); x -= x&1;
if (x == 0 || x == 4) {
oops[x/4].pb(i);
oops[x/4].pb(i+1);
i += 3;
} else {
int y = use_machine({oops[1][0],i,oops[1][1],oops[0][0],i+1,oops[0][1],i+3,oops[0][2],i+4})-1;
assert(0 <= y && y <= 7);
oops[(y&2)/2].pb(i+3);
oops[y&1].pb(i+4);
if (y&4) {
oops[0].pb(i);
oops[1].pb(i+1);
} else {
oops[1].pb(i);
oops[0].pb(i+1);
}
i += 5;
}
} else if (sz(oops[0]) >= 2 && sz(oops[1]) >= 3) {
int x = use_machine({oops[1][0],i,oops[1][1],i+1,oops[1][2],i+2});
oops[(x&1)^1].pb(i+2); x -= x&1;
if (x == 0 || x == 4) {
oops[(x/4)^1].pb(i);
oops[(x/4)^1].pb(i+1);
i += 3;
} else {
int y = use_machine({oops[0][0],i,oops[0][1],oops[1][0],i+1,oops[1][1],i+3,oops[1][2],i+4})-1;
assert(0 <= y && y <= 7);
oops[((y&2)/2)^1].pb(i+3);
oops[(y&1)^1].pb(i+4);
if (y&4) {
oops[1].pb(i);
oops[0].pb(i+1);
} else {
oops[0].pb(i);
oops[1].pb(i+1);
}
i += 5;
}
} else if (sz(oops[0]) >= 2) {
vi v = {oops[0][0],i,oops[0][1],i+1};
int x = use_machine(v);
if (x&2) oops[1].pb(i);
else oops[0].pb(i);
if (x&1) oops[1].pb(i+1);
else oops[0].pb(i+1);
i += 2;
} else {
vi v = {oops[1][0],i,oops[1][1],i+1};
int x = use_machine(v);
if (x&2) oops[0].pb(i);
else oops[1].pb(i);
if (x&1) oops[0].pb(i+1);
else oops[1].pb(i+1);
i += 2;
}
num ++;
}
int ans = sz(oops[0]);
while (i < n) {
int tri = sz(oops[0]) < sz(oops[1]);
int I = i; while (i < n && i-I < sz(oops[tri])) i ++;
vi tmp;
FOR(j,I,i) {
tmp.pb(oops[tri][j-I]);
tmp.pb(j);
}
int cur = use_machine(tmp);
if (tri == 0) {
int ones = (cur+1)/2;
ans += i-I-ones;
oops[cur&1].pb(i-1);
} else {
int zeros = (cur+1)/2;
ans += zeros;
oops[!(cur&1)].pb(i-1);
}
}
return ans;
}
// int count_mushrooms(int n) {
// // std::vector<int> m;
// vi col(n,-1); col[0] = 0;
// vi cnt = {1,0};
// int i = 1; // 2*x+20000/x
// // x = 100
// // dbg(n);
// while (i < n && cnt[0] < 100 && cnt[1] < 100) {
// col[i] = use_machine({0,i});
// // dbg("OOPS",i,col[i]);
// cnt[col[i]] ++;
// i ++;
// }
// // dbg("BAD",i,cnt[0],cnt[1]);
// // dbg("OK");
// int tri = cnt[0] < cnt[1];
// vi res; F0R(j,i) if (col[j] == tri) res.pb(j);
// while (i < n) {
// int I = i; while (i < n && i-I < sz(res)) i ++;
// vi tmp;
// FOR(j,I,i) {
// tmp.pb(res[j-I]);
// tmp.pb(j);
// }
// // dbg("HA",I,i,tmp);
// int ans = use_machine(tmp);
// if (tri == 0) {
// int ones = (ans+1)/2;
// cnt[0] += i-I-ones;
// } else {
// cnt[0] += (ans+1)/2;
// }
// }
// return cnt[0];
// }
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |