Submission #1174078

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

#ifdef _WIN32
#include <Windows.h>
#else
#include <sys/time.h>
#endif

class TicToc
{
private:
    double getCurrTime(){
    #ifdef _WIN32
        return GetTickCount() * 1e-3;
    #else
        struct timeval tv;
        gettimeofday(&tv, NULL);
        return tv.tv_sec + tv.tv_usec * 1e-6;
    #endif
    }
    double startTime;
public:
    void tic(){
        startTime = getCurrTime();
    }
    double toc(){
        return getCurrTime() - startTime;
    }
};

unsigned xor128(){
    static unsigned x=123456789,y=362436069,z=521288629,w=88675123;
    unsigned t;
    t=(x^(x<<11));x=y;y=z;z=w; return( w=(w^(w>>19))^(t^(t>>8)) );
}

bool getTankSet(int d, const vector<int>& amount, bitset<32>& ans)
{
    int n = amount.size();
    for(int i=0; i<(1<<n); ++i){
        bitset<32> bs(i);
        int sum = 0;
        for(int j=0; j<n; ++j){
            if(bs[j]){
                if(amount[j] == 0){
                    sum = 0;
                    break;
                }
                sum += amount[j];
            }
        }
        if(sum == d){
            ans = bs;
            return true;
        }
    }
    return false;
}

void solve(int d, int t, const vector<int>& capacity, const vector<int>& amount)
{
    int n = capacity.size();
    const int dMin = 30;
    const int capacityMin = 4;

    if(dMin <= d){
        bitset<32> bs;
        if(getTankSet(d, amount, bs)){
            cout << "sell " << bs.count();
            for(int i=0; i<n; ++i){
                if(bs[i])
                    cout << ' ' << (i + 1);
            }
            cout << endl;
            return;
        }

        if(t > 1){
            for(int i=0; i<n; ++i){
                vector<int> amount2 = amount;
                amount2[i] = capacity[i];
                bitset<32> bs;
                if(getTankSet(d, amount2, bs)){
                    cout << "fill " << (i + 1) << endl;
                    return;
                }
            }
            for(int i=0; i<n; ++i){
                for(int j=0; j<n; ++j){
                    if(i == j)
                        continue;
                    vector<int> amount2 = amount;
                    int move = min(amount2[i], capacity[j] - amount2[j]);
                    amount2[i] -= move;
                    amount2[j] += move;
                    bitset<32> bs;
                    if(getTankSet(d, amount2, bs)){
                        cout << "move " << (i + 1) << ' ' << (j + 1) << endl;
                        return;
                    }
                }
            }
        }
    }

    int index = -1;
    int maxIncrement = 0;
    for(int i=0; i<n; ++i){
        if(capacityMin <= capacity[i]){
            int increment = capacity[i] - amount[i];
            if(maxIncrement < increment){
                maxIncrement = increment;
                index = i;
            }
        }
    }
    if(index != -1){
        cout << "fill " << (index + 1) << endl;
        return;
    }

    index = min_element(capacity.begin(), capacity.end()) - capacity.begin();
    if(capacity[index] < capacityMin){
        cout << "change " << (index + 1) << endl;
        return;
    }

    cout << "pass" << endl;
}

int main()
{
    const int n = 8;
    const int maxTurn = 1000;

    for(int turn=0; turn<maxTurn; ++turn){
        int d, t;
        cin >> d >> t;
        vector<int> capacity(n), amount(n);
        for(int i=0; i<n; ++i)
            cin >> capacity[i];
        for(int i=0; i<n; ++i)
            cin >> amount[i];

        solve(d, t, capacity, amount);
    }
}

Submission Info

Judge Result