Submission #1173199

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstdint>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

using int64 = int64_t;

constexpr int64 MOD = 1000000007;

int N = 8;
int D, T;
int C[8], A[8];

int pending = -1, memo = -1;

int main() {
    for (int _ = 0; _ < 1000; ++_) {
        cin >> D >> T;
        for (int j = 0; j < N; ++j) { cin >> C[j]; }
        for (int j = 0; j < N; ++j) { cin >> A[j]; }

        // not efficient
        if (5*D <= T) { cout << "pass" << endl; }

        if (memo == -1) {
            int min_time = MOD;
            for (int j = 0; j < (1 << N); ++j) {
                int acc = 0, time = 0;
                for (int k = 0; k < N; ++k) {
                    if (j & (1 << k)) {
                        ++time;
                        acc += C[j];
                    }
                }
                if (acc == D && time < min_time) {
                    min_time = time;
                    memo = pending = j;
                }
            }
            if (min_time > T) { // give up
                cout << "pass" << endl;
                continue;
            }

        }

        if (pending == 0) {
            cout << "sell";
            for (int j = 0; j < N; ++j) {
                if (memo & (1 << j)) {
                    cout << " " << (j+1);
                }
            }
            cout << endl;
            memo = -1;
        } else {
            for (int j = 0; j < N; ++j) {
                if (pending & (1 << j)) {
                    cout << "fill " << (j+1) << endl;
                    pending ^= 1 << j;
                }
            }
        }
    }

    return 0;
}

Submission Info

Judge Result