Submission #1174853

---

Source Code Expand

#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};


class Timer{
	private:
		chrono::high_resolution_clock::time_point start_time;
		chrono::high_resolution_clock::time_point elapsed;

	public:
		Timer(){}
		void start() { start_time = chrono::system_clock::now();}
		double get_elapsed(){ 
			elapsed = chrono::system_clock::now();
			return chrono::duration_cast<std::chrono::seconds>(elapsed-start_time).count();
		}
};

mt19937 mt;   
uniform_real_distribution<double> rnd(0.0,1.0);

// Problem Specific Parameter:
const int MAX_TURN=1000;
int rest=MAX_TURN;	
int D,T;
vector<int> C,A;
const int CMAX=80;

vector<int> cap[CMAX+1];
vector<int> con[CMAX+1];


void Input(){
	cin >> D >> T;
	for(auto &elem:C) cin >> elem;
	for(auto &elem:A) cin >> elem;
	rest--;
}

void Check(){
	rep(i,CMAX+1) cap[i].clear(),con[i].clear();
	
	rep(mask,1<<8){
		int sum=0;
		rep(i,8) if(mask&(1<<i)) sum+=C[i];
		cap[sum].emplace_back(mask);
	}

	rep(mask,1<<8){
		int sum=0;
		rep(i,8) if(mask&(1<<i)) sum+=A[i];
		con[sum].emplace_back(mask);
	}

}

bool Fill(){
	int cmax=0,idx=-1,cnt=0;
	rep(i,8) if(A[i]==0) cnt++;
	rep(i,8) if(A[i]==0 and chmax(cmax,C[i])) idx=i+1;

	if(cnt>=3 or cmax>=5){
		cout << "fill " << idx << endl;
		return true;
	}
	return false;
}

bool Sell(){
	if(con[D].empty()) return false;
	const int mask=con[D][0];
	vector<int> ans;
	rep(i,8) if(mask&(1<<i)) ans.emplace_back(i+1);
	cout <<  "sell" << " " << int(ans.size());
	for(const auto &elem:ans) cout << " " << elem;
	cout << endl;
	return true;
}

const int threshold=25;

void Action(int rest){
	const int total=accumulate(begin(C),end(C),0);
	
	if(rest<10 and Sell()) return;

	if(rest>=10 and total<52){
		const int idx=min_element(begin(C),end(C))-begin(C)+1;
		cout << "change " << idx << endl;
		return;
	}

	if(Fill()) return;
	if(D>threshold and Sell()) return;

	if(D>threshold+5 and !cap[D].empty()){
		int need=8,tar=-1;
		
		for(const auto &mask:cap[D]){
			int cnt=0;
			rep(i,8) if((mask&(1<<i)) and A[i]==0) cnt++;
			if(chmin(need,cnt)) tar=mask;
		}

		if(need+1<=T and T<=rest){
			rep(i,8){
				if((tar&(1<<i)) and A[i]==0){
					const int idx=i+1;
					cout << "fill " << idx << endl;
					Input();
				} 
			}
		}

		Check();
		if(Sell()) return;
	}




	cout << "pass" << endl;
	return;
}



int main(void){
	C=A=vector<int>(8);

	while(rest){
		Input();
		Check();
		Action(rest);
	}

	return 0;
}

Submission Info

Judge Result