#300925 (C++11) No.5003 物理好きクリッカー

• 問題: No.5003 物理好きクリッカー
• ユーザー: ts_
• 提出日時: 2018-12-02 20:50:23
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 325 ms / 10,000 ms
• コード長: 2,313 bytes
• コンパイル時間: 1,283 ms
• 実行使用メモリ: 21,984 KB
• スコア: 144,842,025,143
• 平均クエリ数: 10000.00
• 最終ジャッジ日時: 2021-07-19 07:57:20
• 合計ジャッジ時間: 14,717 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	318 ms; 21,516 KB
testcase_01	AC	318 ms; 21,504 KB
testcase_02	AC	317 ms; 21,888 KB
testcase_03	AC	315 ms; 21,744 KB
testcase_04	AC	318 ms; 21,864 KB
testcase_05	AC	320 ms; 21,852 KB
testcase_06	AC	317 ms; 21,528 KB
testcase_07	AC	315 ms; 21,684 KB
testcase_08	AC	314 ms; 21,360 KB
testcase_09	AC	315 ms; 21,840 KB
testcase_10	AC	319 ms; 21,516 KB
testcase_11	AC	316 ms; 21,360 KB
testcase_12	AC	316 ms; 21,528 KB
testcase_13	AC	323 ms; 21,576 KB
testcase_14	AC	325 ms; 21,372 KB
testcase_15	AC	320 ms; 21,528 KB
testcase_16	AC	314 ms; 21,564 KB
testcase_17	AC	317 ms; 21,540 KB
testcase_18	AC	318 ms; 21,360 KB
testcase_19	AC	318 ms; 21,372 KB
testcase_20	AC	319 ms; 21,684 KB
testcase_21	AC	321 ms; 21,864 KB
testcase_22	AC	320 ms; 21,348 KB
testcase_23	AC	319 ms; 21,504 KB
testcase_24	AC	315 ms; 21,696 KB
testcase_25	AC	316 ms; 21,360 KB
testcase_26	AC	318 ms; 21,372 KB
testcase_27	AC	321 ms; 21,876 KB
testcase_28	AC	320 ms; 21,360 KB
testcase_29	AC	321 ms; 21,528 KB
testcase_30	AC	316 ms; 21,480 KB
testcase_31	AC	312 ms; 21,540 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

const int N=10000;
string S;

ll tot=0;
vector<string> mov={"click","buy","sell","reinforce","enhclick"};
vector<string> nam={"hand","lily","factory","casino","grimoire"};
ll bcost[5]={150,2000,30000,600000,10000000},rcost[6]={150,20000,300000,6000000,100000000,15};
ll base[5]={1,10,120,2000,25000};
int satu[5]={0,7,7,7,14};
int numfa[5],numref[6];
int feverend=0,pfac=1;
bool disc=false;
pint ans[N];
inline void nxphase(int turn){
	if(S[turn]=='B') tot+=(tot+99)/100;
	else if(S[turn]=='F') feverend=turn+20,pfac=7;
	else if(S[turn]=='S') disc=true;
	else disc=false;
	if(feverend==turn) pfac=1;
	return;
}
inline ll get_c(){
	ll ret=0;
	rep(i,5){
		ret+=(base[i]<<numref[i])*numfa[i];
	}
	return ret*pfac;
}
void init(){
	int turn=0;
	ans[turn]={0,0};++tot;++turn;
	while(numref[5]<3){
		if(feverend!=turn&&tot>=rcost[5]){
			ll tcos=rcost[5];
			if(disc) tcos=(tcos*9+9)/10;
			tot-=tcos;
			rcost[5]*=10;++numref[5];
			ans[turn]={4,0};
		}
		else{
			ans[turn]={0,0};tot+=(1ll<<numref[5]);
		}
		nxphase(turn);
		++turn;
	}
	cerr<<turn<<" "<<tot<<endl;
	FOR(i,1,5){
		while(numfa[i]<satu[i]){
			if(feverend!=turn&&tot>=bcost[i]){
				ll tcos=bcost[i];
				if(disc) tcos=(tcos*9+9)/10;
				tot-=tcos;
				bcost[i]=(bcost[i]*6+4)/5;++numfa[i];
				ans[turn]={1,i};
			}
			else{
				ans[turn]={0,0};tot+=(1ll<<numref[5])*pfac;
			}
			tot+=get_c();
			nxphase(turn);
			++turn;
			if(turn==N) break;
		}
		cerr<<turn<<" "<<tot<<endl;
		if(turn==N) break;
	}
	int cnt=0;
	while(turn<N){
		if(feverend!=turn&&turn<8990&&cnt<2&&tot>=rcost[4]){
			ll tcos=rcost[4];
			if(disc) tcos=(tcos*9+9)/10;
			tot-=tcos;
			rcost[4]*=10;++numref[4];
			ans[turn]={3,4};
			++cnt;
			cerr<<turn<<endl;
		}
		else ans[turn]={0,0};tot+=(1ll<<numref[5])*pfac;
		tot+=get_c();
		nxphase(turn);
		++turn;
	}
	cerr<<turn<<" "<<tot<<endl;
}
int main(){
    int drop;
    cin>>drop>>S;

	init();

	cerr<<tot<<endl;
	string ds;
	rep(i,N){
		if(ans[i].first==0) cout<<"click"<<endl;
		else if(ans[i].first==4) cout<<"enhclick"<<endl;
		else{
			cout<<mov[ans[i].first]<<" "<<nam[ans[i].second]<<endl;
		}
		cin>>ds;
	}
    return 0;
}