Submission #1174997

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>

#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

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

template<class A, size_t N, class T> void Fill(A (&a)[N], const T &v){ fill( (T*)a, (T*)(a+N), v ); }

const ll INF = 0x3fffffff;


int D, T;
int C[10], A[10];
bool ok[105];

// 受け入れるか
bool rec(){
	return D > 30 || T <= 3 || ok[D];
}

// 売る
vector<int> sell(){
	vector<int> v;

	int dp[10][105], cur = D;
	Fill(dp, -1);
	dp[0][0] = 0;
	rep(k,8) rrep(i,90) if( dp[k][i] > -1 ){
		dp[k+1][i] = dp[k][i];
		if( A[k] ) dp[k+1][ i+A[k] ] = k;
	}
	int k = 8;
	while( cur ){
		//cerr << cur << " " << dp[k][cur] << "  k=" << k << endl;
		v.push_back( dp[k][cur] + 1 );
		int nexk = dp[k][cur];
		cur -= A[ dp[k][cur] ];
		k = nexk;
	}

	return v;
}

vector<int> sell_(){
	vector<int> v;
	rep(k,1<<8){
		int sum = 0;
		rep(i,8){
			if( k&(1<<i) ){
				if( A[i] == 0 ) break;
				sum += A[i];
			}
		}
		if( sum == D ){
			rep(i,8) if( k&(1<<i) ) v.push_back(i+1);
			return v;
		}
	}

	return v;
}

void solve_(){
	vector<pii> vp;
	rep(i,8) vp.emplace_back( C[i], i+1 );
	sort( all(vp) );
	if( vp[0].X > 3 ) rep(i,8){
		if( A[i] != C[i] ){
			cout << "fill " << i+1 << endl;
			return;
		}
	}
	cout << "change " << vp[0].Y << endl;
}

int main(){
	ios_base::sync_with_stdio(0);

	rep(kase,1000){
		cin >> D >> T;
		rep(i,8) cin >> C[i];
		rep(i,8) cin >> A[i];

		Fill( ok, false );
		ok[0] = true;
		rep(i,8) rrep(j,90) ok[ j + A[i] ] |= ok[j];

		if( !rec() ){
			cout << "pass" << endl;
			continue;
		}

		if( ok[D] ){
			auto v = sell();
			cout << "sell " << v.size();
			for(auto t: v) cout << " " << t;
			cout << endl;
			continue;
		}

		solve_();
	}

	return 0;
}

Submission Info

Judge Result