Submission #1174365

---

Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;
 
int main()
{
  srand((unsigned)time(NULL));
  
  int D, T, C[8], A[8];
 
  for(int Z = 0; Z < 1000; Z++) {
    cin >> D >> T;
    for(int i = 0; i < 8; i++) cin >> C[i];
    for(int i = 0; i < 8; i++) cin >> A[i];
 
    vector< pair< int, int > > vs;
    vector< pair< int, int > > create;
    
    for(int i = 0; i < (1 << 8); i++) {
      int sum = 0, sum2 = 0;

      
      for(int j = 0; j < 8; j++) {
        if((i >> j) & 1) {
          sum2 += C[j];
        }
      }
      
      create.emplace_back(sum2, i);

      bool flag = false;
      for(int j = 0; j < 8; j++) {
        if((i >> j) & 1) {
          if(A[j] == 0) flag = true;
          sum += A[j];
        }
      }
      if(!flag && sum == D) vs.emplace_back(__builtin_popcount(i), i);
    }
    
    if(vs.empty()) {
      sort(begin(create), end(create)); 
      auto get = lower_bound(begin(create), end(create), make_pair(D, -1));
      if(get == end(create) || get->first != D) {

        bool flag = false;
        if(T > 60) {
          vector< int > qs(11, 0);
          int mosted = 0;
          for(int i = 0; i < 8; i++) qs[C[i]]++;

          vector< int > ssss;
          for(int i = 0; i < 8; i++) {
            if(qs[C[i]]>1) ssss.push_back(i);
          }

          if(!ssss.empty())  {
            cout << "change " << ssss[rand() % ssss.size()] + 1 << endl;
            flag = true;
        
          }
        } else {
          for(int i = 0; i < 8; i++) {
            if(A[i] == 0) {
              cout << "fill " << i + 1 << endl;
              flag = true;
              break;
            }
          }
        }

        if(!flag) cout << "pass" << endl;
        continue;
      }
 
      int needSmallest = 114514;
      int qs = 0;
      while(get != end(create) && get->first == D) {
        int proc = 0;
        for(int i = 0; i < 8; i++) {
          if(((get->second) >> i) & 1 && A[i] != C[i]) {
            ++proc;
          }
        }
        if(needSmallest > proc) {
          needSmallest = proc;
          qs = get->second;
        }
        ++get;
      }
 
      for(int i = 0; i < 8; i++) {
        if((qs >> i) & 1 && A[i] != C[i]) {
          cout << "fill " << i + 1 << endl;
          break;
        }
      }
    } else {
      auto p = *max_element(begin(vs), end(vs));
      cout << "sell ";
      vector< int > st;
      for(int i = 0; i < 8; i++) {
        if(A[i] == 0) continue;
        if((p.second >> i) & 1) st.push_back(i + 1);
      }
      cout << st.size();
      for(int v : st) cout << " " << v;
      cout << endl;
    }
  }
}

Submission Info

Judge Result