Submission #1173210

---

Source Code Expand

#include <numeric>
#include <map>
#include <algorithm>
#include <iostream>
#include <queue>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>

using namespace std;

void fill(int i){
  printf("fill %d\n", i + 1);
  fflush(stdout);
}

void change(int i){
  printf("change %d\n", i + 1);
  fflush(stdout);
}

void sell(int d, const vector<int> &a){
  const int n = a.size();
  vector<pair<int, int> > v(n);
  REP(i,n){
    v[i].first = a[i];
    v[i].second = i;
  }
  sort(v.rbegin(), v.rend());
  vector<int> res;
  int sum = 0;
  REP(i,n){
    if(v[i].first != 0 && sum + v[i].first <= d){
      sum += v[i].first;
      res.push_back(v[i].second);
    }
  }

  printf("sell %d", (int)res.size());
  REP(i,res.size()) printf(" %d", res[i] + 1);
  puts("");
  fflush(stdout);
}

void pass(){
  printf("pass\n");
  fflush(stdout);
}

int needT(vector<int> c, int d){
  const int n = c.size();
  sort(c.rbegin(), c.rend());
  int sum = 0;
  REP(i,n){
    if(sum + c[i] <= d){
      sum += c[i];
      if(sum == d) return i + 1;
    }
  }
  return -1;
}

int main(){
  const int n = 8;

  REP(i,1000){
    const int d = getInt();
    const int t = getInt();

    vector<int> c(n);
    vector<int> a(n);
    REP(i,n) c[i] = getInt();
    REP(i,n) a[i] = getInt();

    vector<int> need(n);
    map<int, int> cnt;

    REP(i,n){
      if(c[i] == 1 || c[i] == 2 || c[i] == 4 || c[i] == 8){
        if(cnt[c[i]] == 0)
          need[i] = 1;
        cnt[c[i]]++;
      }else if(c[i] == 10){
        if(cnt[c[i]] < 4)
          need[i] = 1;
        cnt[c[i]]++;
      }
    }

    if(accumulate(need.begin(), need.end(), 0) == n){
      const int sum = accumulate(a.begin(), a.end(), 0);

      if(sum == 0){
        if(needT(c, d) > t){
          pass();
          goto end;
        }
      }

      if(sum == d){
        sell(d, a);
      }else{
        vector<pair<int, int> > v;
        REP(i,n) if(a[i] == 0)
          v.push_back(make_pair(c[i], i));
        sort(v.rbegin(), v.rend());
        REP(i,v.size()) if(sum + v[i].first <= d){
          fill(v[i].second);
          break;
        }
      }
    }else{
      REP(i,n) if(!need[i]){
        change(i);
        break;
      }
    }

  end:;
  }

  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int getInt()’:
./Main.cpp:9:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 inline int getInt(){ int s; scanf("%d", &s); return s; }
                                            ^

Judge Result