Submission #1174402

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
// #define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;

int n = 8, d, t;
int c[8], a[8];
const int INF = 1e7;


void InitRandom(){
    int now=time(0);
    srand(now);
}

int bitnum(int n){
    int ret = 0;
    while(n > 0){
        ret += (n & 1); n >>= 1;
    }
    return ret;
}

int cnt = -1;
int dp[1024];
int pre[1010];
vector<int> path;
vector<int> sell;
P mov;

void pass(){
    // if(rand() % 100 == 1){
    //     cout << "fill " << rand() % 8 + 1 << endl;
    // }
    // else{
        cout << "pass" << endl;
        cnt = -1;
    // }
}

void think(){
    if(cnt == -1){
        int MIN = INF, minMask = -1, minMask2 = -1;
        for(int mask = 0; mask < (1 <<8); mask++){
            for(int mask2 = 0; mask2 < (1 << 8); mask2++){
                int sum = 0;
                bool f = true;
                rep(i, 0, n){
                    if(mask & (1 << i) && mask2 & (1 << i)) f = false;
                }
                if(!f) continue;
                rep(i, 0, n){
                    if(mask & (1 << i)){
                        sum += c[i];
                    }
                    if(mask2 & (1 << i)){
                        sum += a[i];
                    }
                }
                if(sum == d && bitnum(mask) < MIN){
                    MIN = bitnum(mask);
                    minMask = mask;
                    minMask2 = mask2;
                }
            }
        }
        sell.clear();
        path.clear();        
        rep(i, 0, n){
            rep(j, 0, n){
                if(i == j) continue;
                if(a[i] == 0 && a[j] == 0) continue;
                if(a[i] != 0){
                    if(a[i] < c[j]) continue;
                    if(c[j] == d || a[i] - c[j] == d){
                        mov.fi = i;
                        mov.se = j;
                        a[j] = c[j];
                        a[i] -= c[j];
                        if(c[j] == d) sell. push_back(j);
                        else sell. push_back(i);
                    }
                }else{
                    if(a[j] < c[i]) continue;
                    if(c[i] == d || a[j] - c[i] == d){
                        a[i] = c[i];
                        a[j] -= c[i];
                        mov.fi = j;
                        mov.se = i;
                        if(c[i] == d) sell. push_back(i);
                        else sell. push_back(j);
                    }
                }
                if(sell.size() == 1){
                    break;
                    i = n;
                }
            }
        }
        if(sell.size() == 1 && t >= 2){
            cout << "move " << mov.fi + 1<< " " << mov.se + 1<< endl;
            cnt = INF;
            return ;
        }
        sell.clear();
        if(MIN == INF){
            pass();
            return;
        }
        rep(i, 0, n){
            if(minMask & (1 << i)){
                path. push_back(i);
            }
        }
        rep(i, 0, n){
            if(minMask & (1 << i) || minMask2 & (1 << i)){
                sell. push_back(i);
            } 
        }
        if(path.size() >= t){
            pass();
            return;
        }
        // if(path.size() > 5){
        //     cout << "pass" << endl;
        //     cnt = -1;
        //     return;
        // }
        cnt = 0;
        // rep(i, 0, path.size()){
        //     cout << path[i] << endl;
        // }
    }
    if(cnt < path.size()){
        cout << "fill " << path[cnt] + 1 << endl;
        cnt++;
    }else{
        cout <<  "sell " << sell.size() << " ";
        rep(i, 0, sell.size()){
            cout << sell[i] + 1;
            if(i != sell.size() - 1) cout << " ";
        }
        cout << endl;
        cnt = -1;
    }
}

signed main(){
    InitRandom();
    rep(it, 0, 1000){
        cin >> d >> t;
        rep(i, 0, n) cin >> c[i];
        rep(i, 0, n) cin >> a[i];
        if(d < 30) cout << "pass" << endl;
        else think();
    }
}

Submission Info

Judge Result