#define NOMINMAX #define TEST_MODE true #define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #include "bits/stdc++.h" using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i) #define rrep(i, n) for (int i = (n)-1; i >= 0; --i) #define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i) #define range(i, a, b, c) for (int i = a; \ c > 0 ? i < b : i > b; \ i += c) #define chmax(a, b) (a = (a) < (b) ? (b) : (a)) #define chmin(a, b) (a = (a) > (b) ? (b) : (a)) using ll = long long; using ull = unsigned long long; using ld = long double; #define all(a) begin(a), end(a) #define ifnot(a) if (not(a)) #define int long long #ifdef LOCAL_ENV #if TEST_MODE == true const bool test = true; #define dump(x) cerr << #x << " : " << (x) << " " #define dumpl(x) dump(x) << endl #else const bool test = false; #define dump(x) #define dumpl(x) #endif #else const bool test = false; #define dump(x) #define dumpl(x) #endif int dx[] = { 1, 0, -1, 0 }; int dy[] = { 0, 1, 0, -1 }; const int INF = (int)1 << 60; const int undefined = INF; const ll INFL = (ll)1 << 60; ll mod_n = (int)1e9 + 7; const double eps = 1e-10; typedef long double Real; // return -1, 0, 1 int sgn(const Real &r) { return (r > eps) - (r < -eps); } int sgn(const Real &a, const Real &b) { return sgn(a - b); } //..................... const int MAX = (int)2e5 + 5; vector split(const string &str, char sep) { vector v; stringstream ss(str); string buffer; while (getline(ss, buffer, sep)) { v.push_back(buffer); } return v; } string join(const vector& v, const string delim = 0) { string s; if (!v.empty()) { s += v[0]; for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) { if (delim != "") s += delim; s += v[i]; } } return s; } template int sum(InputIterator begin, InputIterator end) { return accumulate(begin, end, 0ll); } template T gcd(T a, T b) { T c; while (a != 0) { c = a; a = b%a; b = c; } return b; } template T bit_count(T N) { T cnt = 0; while (N) { if (N & 1) cnt++; N >>= 1; } return cnt; } template void print_vec(ostream& ostream, vector a) { rep(i, a.size() - 1) ostream << a[i] << " "; ostream << a.back() << endl; } ll pow_n(ll x, ll n) { ll res = 1; while (n > 0) { if (n & 1) res = res * x; x = x * x; n >>= 1; } return res; } class Solver { public: int H, W; bool grid_ng(int y, int x) { return y < 0 || y >= H || x < 0 || x >= W; } struct Point { int x, y; bool operator < (const Point& r) const { if (y != r.y) return y < r.y; return x < r.x; } }; struct Facility { string name; int productivity; int original_val; int num; int buying_val; int reinforce_val; int level; }; struct Action { string name; int facility_id; double effi; }; int N; string S; int cookie = 200; int end_fever = 0; int cookie_per_click = 1; int enclick_buying_val = 15; vector facilitys = { { "hand", 1, 150, 0 }, { "lily", 10, 2000, 0 }, { "factory", 120, 30000, 0 }, { "casino", 2000, 600000, 0 }, { "grimoire", 25000, 10000000, 0 } }; int ceiling_div(int p, int q) { int res = p / q; if (p % q != 0) res += 1; return res; } void enclick() { cout << "enhclick" << endl; if (cookie < enclick_buying_val) return; cookie -= enclick_buying_val; cookie_per_click *= 2; enclick_buying_val *= 10; throw exception(); } Action best_buy(char special) { int per = (special == 'S' ? 90 : 100); int best_id = 0; double best_effi = 0; rep(i, facilitys.size()) { auto& facility = facilitys[i]; //if (cookie >= facility.buying_val * per / 100 + 1) { int buying_val = ceiling_div(facility.buying_val * per, 100); if (cookie >= buying_val) { double effi = (double)facility.productivity / buying_val; if (effi > best_effi) { best_effi = effi; best_id = i; } } } return { "buy", best_id, best_effi}; } void buy(char special, Action& action) { int per = (special == 'S' ? 90 : 100); auto& facility = facilitys[action.facility_id]; int buying_val = ceiling_div(facility.buying_val * per, 100); cookie -= buying_val; facility.num += 1; facility.buying_val = ceiling_div(6 * facility.buying_val, 5); } Action best_reinforce(char special) { int per = (special == 'S' ? 90 : 100); int best_id = 0; double best_effi = 0; rep(i, facilitys.size()) { auto& facility = facilitys[i]; //if (cookie >= facility.buying_val * per / 100 + 1) { int reinforce_val = ceiling_div(facility.reinforce_val * per, 100); if (cookie >= reinforce_val) { double effi = (double)facility.productivity * facility.num / reinforce_val; if (effi > best_effi) { best_effi = effi; best_id = i; } } } return { "reinforce", best_id, best_effi }; } void reinforce(char special, Action& action) { int per = (special == 'S' ? 90 : 100); auto& facility = facilitys[action.facility_id]; int reinforce_val = ceiling_div(facility.reinforce_val * per, 100); cookie -= reinforce_val; facility.level += 1; facility.reinforce_val *= 10; } void sell() { for (auto& facility : facilitys) { if (facility.num != 0) { cout << "sell " << facility.name << endl; facility.num = 0; throw exception(); } } } void act(char special, Action& action) { if (action.name == "buy") buy(special, action); if (action.name == "reinforce") reinforce(special, action); cout << action.name << " " << facilitys[action.facility_id].name << endl; throw exception(); } int facility_cnt() { int res = 0; for (auto& facility : facilitys) { res += (facility.num != 0); } return res; } void solve() { //rep(i, 5) cout << facility[i].buying_val / facility[i].productivity << endl; for (auto& facility : facilitys) { facility.buying_val = facility.original_val; facility.reinforce_val = facility.original_val * 10; facility.level = 1; } cin >> N >> S; rep(i, N) { char special = 'N'; if (0 <= i - 1 && i - 1 < S.size()) { special = S[i - 1]; } int times = (i < end_fever ? 7 : 1); try { if (i == 0) enclick(); if (i > N - facilitys.size()) sell(); vector actions; actions.push_back({"", 0, 0}); if (i + 2000 < N) { actions.push_back(best_buy(special)); actions.push_back(best_reinforce(special)); sort(all(actions), [](Action& l, Action& r) {return l.effi > r.effi; }); } if (actions[0].effi == 0) { cout << "click" << endl; cookie += cookie_per_click * times; } else { act(special, actions[0]); } } catch (exception& e) {}; for (auto& facility : facilitys) { // dumpl(facility.productivity); // dumpl(facility.num); cookie += facility.productivity * facility.num * facility.level * times; } // dumpl(special); if (special == 'B') { int p = cookie * 3; int q = 100; // dump(p); dumpl(q); cookie += p / q; if (p % q != 0) cookie += 1; } if (special == 'F') end_fever = i + 18; dump(cookie); #ifndef _MSC_VER string s; cin >> s; #endif } } }; signed main() { srand((unsigned int)time(NULL)); cout << fixed << setprecision(20); auto ptr = new Solver(); ptr->solve(); delete ptr; //while (true) { // if (cin.eof() == true) break; // auto ptr = new Solver(); // ptr->solve(); // delete ptr; //} return 0; }