結果

問題 No.5003 物理好きクリッカー
ユーザー naimonon77naimonon77
提出日時 2018-12-12 15:02:26
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 351 ms / 10,000 ms
コード長 4,754 bytes
コンパイル時間 1,726 ms
実行使用メモリ 21,984 KB
スコア 0
平均クエリ数 10000.00
最終ジャッジ日時 2021-07-19 09:22:04
合計ジャッジ時間 15,623 ms
ジャッジサーバーID
（参考情報） 		judge10 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 323 ms
21,852 KB
testcase_01 AC 326 ms
21,372 KB
testcase_02 AC 324 ms
21,504 KB
testcase_03 AC 321 ms
21,864 KB
testcase_04 AC 329 ms
21,384 KB
testcase_05 AC 327 ms
21,348 KB
testcase_06 AC 346 ms
21,348 KB
testcase_07 AC 327 ms
21,516 KB
testcase_08 AC 348 ms
21,876 KB
testcase_09 AC 349 ms
21,864 KB
testcase_10 AC 351 ms
21,348 KB
testcase_11 AC 326 ms
21,516 KB
testcase_12 AC 327 ms
21,492 KB
testcase_13 AC 329 ms
21,876 KB
testcase_14 AC 326 ms
21,864 KB
testcase_15 AC 346 ms
21,888 KB
testcase_16 AC 346 ms
21,852 KB
testcase_17 AC 323 ms
21,852 KB
testcase_18 AC 324 ms
21,348 KB
testcase_19 AC 325 ms
21,528 KB
testcase_20 AC 327 ms
21,492 KB
testcase_21 AC 349 ms
21,888 KB
testcase_22 AC 329 ms
21,948 KB
testcase_23 AC 329 ms
21,840 KB
testcase_24 AC 347 ms
21,840 KB
testcase_25 AC 348 ms
21,528 KB
testcase_26 AC 323 ms
21,372 KB
testcase_27 AC 330 ms
21,528 KB
testcase_28 AC 348 ms
21,528 KB
testcase_29 AC 348 ms
21,828 KB
testcase_30 AC 326 ms
21,852 KB
testcase_31 AC 322 ms
21,852 KB
権限があれば一括ダウンロードができます

ソースコード

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

#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<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;
}

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 buying_val;
		int num;
	};

	int N;
	string S;
	int cookie = 200;
	int end_fever = 0;
	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 buy(char special) {
		int per = (special == 'S' ? 90 : 100);
		for (auto& facility : facilitys) {
			//if (cookie >= facility.buying_val * per / 100 + 1) {
			if (ceiling_div(facility.buying_val * per, 100)) {
				cookie -= facility.buying_val;
				facility.num += 1;
				{
					int p = 6 * facility.buying_val;
					int q = 5;
					facility.buying_val = p / q;
					if (p % q != 0) facility.buying_val += 1;
				}
				cout << "buy " << facility.name << endl;
				throw exception();
			}
		}
		return;
	}

	void solve() {
		//rep(i, 5) cout << facility[i].buying_val / facility[i].productivity << endl;
		cin >> N >> S;
		rep(i, N) {
			char special = 'N';
			if (0 <= i - 1 && i - 1 < S.size()) {
				special = S[i - 1];
			}
			if (special == 'F') end_fever = i + 20;
			try { 
				buy(special); 
				cout << "click" << endl;
				cookie += 1;
			} 
			catch (exception& e) {};
			for (auto& facility : facilitys) {
				// dumpl(facility.productivity);
				// dumpl(facility.num);
				cookie += facility.productivity * facility.num;
			}

			// 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;
			}
			dumpl(cookie);
			string s; cin >> s;
		}
	}
};

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