Submission #1174382

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define WIN_WIDTH	 (1900)
#define WIN_HEIGHT (900)
#define REP(i, s, n) for(int i = s; i < n; ++i)
#define rep(i, n)		 REP(i, 0, n)
#define SORT(c)			 sort((c).begin(), (c).end())
#define IINF	INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false

typedef long long				ll;
typedef pair <int, int> ii;

vector <vector <ii> >		p(500, vector <ii>(9));
vector <string>					s(50);
vector <vector <bool> > used(50, vector <bool>(50, false));
vector <vector <bool> > used_now(50, vector <bool>(50));
int cnt;
int num;

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

int d, t;
vector <int> c(8), a(8);

int itr;
void in() {
	itr++;
	cin >> d >> t;
	rep(i, 8) cin >> c[i];
	rep(i, 8) cin >> a[i];
}

void sell(vector<int> sells){
	cout << "sell " << sells.size();
	rep(j, sells.size()) cout << " " << sells[j] + 1;
	cout << endl;
}

int is_emp(){
	rep(i, 8) if(c[i] != a[i]) return i;
	return -1;
}


int main() {
	srand((unsigned) time(NULL));
	itr = 0;
	bool cFlag = false;

	while(itr < 998) {
		in();
		int	 mini		 = 9;
		vector <int> minv;

		rep(i, 256) {
			int tmp	 = i;
			int sums = 0;
			rep(j, 8) {
				if(tmp % 2 == 1) sums += c[j];
				tmp /= 2;
			}
			if(sums == d) {
				tmp = i;
				vector <int> used;
				int cnt = 0;
				rep(j, 8) {
					if(tmp % 2 == 1) {
						used.push_back(j);
						if(c[j] != a[j]) cnt++;
					}
					tmp /= 2;
				}
				if(mini > cnt) {
					mini = cnt;
					minv = used;
				}
			}
		}
		if(mini != 9) cFlag = false;
		if(mini == 9) {
			if(d < 10){
				cout << "pass" << endl;
				cFlag = false;
			}
			else if(!cFlag) {
				int min_c = c[0];
				int min_c_num = 0;
				rep(i, 8){
					if(min_c > c[i]){
						min_c = c[i];
						min_c_num = i;
					}
				}
				cout << "change " << min_c_num + 1 << endl;
				cFlag = true;
			}
			else{
				cout << "pass" << endl;
				cFlag = false;
			}
		}
		else if(mini >= t) {
			bool noempty = true;
			int max_c = 0;
			int max_c_num = 0;
			rep(i, 8) if(c[i] != a[i]) {
				noempty = false;
				if(max_c < c[i]){
					max_c = c[i];
					max_c_num = i;
				}
			}
			if(noempty) cout << "pass" << endl;
			else cout << "fill " << max_c_num + 1 << endl;
		}
		else if(itr + mini < 1000) {
			rep(i, minv.size()) {
				if(c[minv[i]] != a[minv[i]]) {
					cout << "fill " << minv[i] + 1 << endl;
					in();
				}
			}

			if(t > 1) {
				if(is_emp() == -1) sell(minv);
				else{
					rep(j, 8){
						if(t == 1) break;
						if(c[j] != a[j]){
							cout << "fill " << j + 1 << endl;
							in();
						}
					}
					sell(minv);
				}
			}
			else {
				sell(minv);
			}
		}
		else cout << "pass" << endl;
	}

	while(itr < 1000){
		in();
		cout << "pass" <<endl;
	}

	return 0;
}

Submission Info

Judge Result