結果

問題 No.5003 物理好きクリッカー
ユーザー naimonon77naimonon77
提出日時 2019-09-29 21:42:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 9,389 bytes
コンパイル時間 2,858 ms
実行使用メモリ 21,984 KB
スコア 0
平均クエリ数 14.97
最終ジャッジ日時 2021-07-19 10:46:27
合計ジャッジ時間 22,017 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge10
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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

#define WARA
#ifdef WARA

#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<string> split(const string& str, char sep)
{
	vector<string> v;
	stringstream ss(str);
	string buffer;
	while (getline(ss, buffer, sep))
	{
		v.push_back(buffer);
	}
	return v;
}

string join(const vector<string>& 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;
}

string operator * (const string& s, const int& n) {
	string res = "";
	rep(i, n) res += s;
	return res;
}

template <class InputIterator>
int sum(InputIterator begin, InputIterator end)
{
	return accumulate(begin, end, 0ll);
}

template<typename T>
T gcd(T a, T b)
{
	T c;
	while (a != 0) {
		c = a; a = b % a;  b = c;
	}
	return b;
}

template<typename T>
T bit_count(T N) {
	T cnt = 0;
	while (N) {
		if (N & 1) cnt++;
		N >>= 1;
	}
	return cnt;
}

template<typename T>
void print_vec(ostream& ostream, vector<T> 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 = 0;
	int end_fever = 0;
	int cookie_per_click = 1;
	int enclick_buying_val = 15;
	vector<Facility> 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;
				}
			}
		}
		if (cookie >= enclick_buying_val) {
			double effi = (double)cookie_per_click / enclick_buying_val;
			if (effi > best_effi) {
				best_effi = effi;
				best_id = -1;
			}
		}
		return { "reinforce", best_id, best_effi };
	}

	void output(string s) {
#ifndef LOCAL_ENV
		cout << s << endl;
#endif
	}

	void output(string s, string& s2) {
#ifndef LOCAL_ENV
		cout << s << " " << s2 << endl;
#endif
	}

	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.productivity *= 2;
		facility.reinforce_val *= 10;
	}

	void sell() {
		for (auto& facility : facilitys) {
			if (facility.num != 0) {
				cout << "sell " << facility.name << endl;
				// output("sell", facility.name);
				facility.num = 0;
				throw exception();
			}
		}
	}

	void act(char special, Action& action) {
		if (action.facility_id == -1) {
			enclick();
		}
		else {
			if (action.name == "buy") buy(special, action);
			if (action.name == "reinforce") reinforce(special, action);
			//cout << action.name << " "
			//	<< facilitys[action.facility_id].name << endl;
			output(action.name, facilitys[action.facility_id].name);
		}
		throw exception();
	}

	int facility_cnt() {
		int res = 0;
		for (auto& facility : facilitys) {
			res += (facility.num != 0);
		}
		return res;
	}

	void make_S() {
		S = "N"s * 10000;
		string specials = "BFS";
		for (auto& c : specials) {
			int cur = rand() % 200;
			S[cur] = c;
			while (true) {
				while (true) {
					int next = cur + 100 + rand() % 100;
					if (next >= S.size()) goto label1;
					if (S[next] == 'N') {
						cur = next;
						break;
					}
					else continue;
				}
				S[cur] = c;
			}
		label1:;
		}
		dumpl(S);
	}

	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;
#ifdef LOCAL_ENV
		make_S();
#else
		cin >> S;
#endif
		rep(i, N) {
			//if (i < 0) {
			//	dump(cookie); dumpl(enclick_buying_val);
			//}
			char special = 'N';
			if (0 <= i - 1 && i - 1 < S.size()) {
				special = S[i - 1];
			}
			int times = (i < end_fever ? 7 : 1);

			//dumpl(enclick_buying_val);
			if (i == N - 100) {
				for (auto& f : facilitys) {
					dump(f.name);  dump(f.buying_val); dump(f.reinforce_val);  dump(f.productivity); dumpl(f.num);
				}
			}

			try {
				//if (i == 0) enclick();
				//if (cookie >= enclick_buying_val && 
				//	enclick_buying_val <= 150) {
				//	enclick();
				//}
				if (i > N - facilitys.size() - 1) {
					sell();
				}
				vector<Action> actions;
				actions.push_back({ "", 0, 0 });
				int a = 2000;
				if (i + a < 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; });
				}
				double turn = 1 / (actions[0].effi + 1e-7);
				int turn2 = N - i;
				auto facility = facilitys[actions[0].facility_id];
				auto buying_val = facility.buying_val;
				auto selling_val = buying_val * 0.25 * facility.num;
				bool f = (turn + selling_val > turn2);
				if (actions[0].effi == 0 || f) {
					output("click");
					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 * times;
			}

			// dumpl(special);
			if (special == 'B') {
				//int p = cookie * 1;
				//int q = 100;
				//// dump(p); dumpl(q);
				//cookie += p / q;
				//if (p % q != 0) cookie += 1;
				cookie += ceiling_div(cookie, 100);
			}
			if (special == 'F') end_fever = i + 21;
			if (i % 100 == 0) dumpl(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;
}
0