Submission #1173968

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()) {
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t) {
	stringstream ss;
	ss << f;
	ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x)
#define debug(x)
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

int D, T;
vint C(8), A(8);

void q_fill(int a) {
	cout << "fill " << a + 1 << endl;
}

void q_move(int a, int b) {
	cout << "move " << a + 1 << " " << b + 1 << endl;
}

void q_change(int a) {
	cout << "change " << a + 1 << endl;
}

void q_pass() {
	cout << "pass" << endl;
}

void q_sell(int n, vint v) {
	cout << "sell " << n;
	rep(i, v.size()) {
		cout << " " << v[i] + 1;
	}
	cout << endl;
}

pii check(int D, int T){
	int cnt = INF;
	int state = 0;
	rep(s,1<<8){
		int cc = 0;
		int tt = 0;
		rep(j,8){
			if(s&(1<<j)){
				cc+=C[j];
				if(C[j]!=A[j]) tt++;
			}
		}
		if(cc == D && tt < cnt){
			cnt = tt;
			state = s;
		}
	}
	return pii(cnt, state);
}


void mainmain() {
	srand(time(NULL));
	int turn = 0;
	while(1) {
		if(turn++ >= 1000) break;
		cin>>D>>T;
		rep(i, 8) cin >> C[i];
		rep(i, 8) cin >> A[i];
		pii p = check(D, T);
		if(p.F == INF || D < 32) {
			bool f = false;
			rep(i,8){
				if(C[i] < 5){
					q_change(i);
					f = true;
					break;
				}
			}
			if(f) continue;
			rep(i,8){
				if(C[i]!=A[i]){
					q_fill(i);
					f = true;
					break;
				}
			}
			if(f) continue;
			q_pass();
			// int t = rand() % 5;
			// if(t == 0) {
			// 	q_pass();
			// }
			// else if(t == 1) {
			// 	q_change(rand() % 8);
			// }
			// else {
			// 	bool f = false;
			// 	rep(i, 8) {
			// 		if(C[i] != A[i]) continue;
			// 		q_fill(i);
			// 		f = true;
			// 		break;
			// 	}
			// 	if(!f) {
			// 		q_pass();
			// 	}
			// }
		}
		else {
			if(p.F == 0) {
				vint tmp;
				rep(i, 8) {
					if(p.S & (1 << i)) {
						tmp.PB(i);
					}
				}
				q_sell(tmp.size(), tmp);
			}
			else {
				rep(i, 8) {
					if(p.S & (1 << i) && C[i] != A[i]) {
						q_fill(i);
						break;
					}
				}
			}
		}
	}
}
/*
1. 85559

D  score 
25  146517
30  148750
31  142372
34  139414
35  139816
*/


signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(20);
	mainmain();
}

Submission Info

Judge Result