Submission #1173444

---

Source Code Expand

#include<iostream>
#include<random>

using namespace std;

constexpr int N=8;
mt19937 engine;

int count(int x){
  return __builtin_popcount(x);
}

int main(){
  for(int i=0;i<1000;i++){
    int D,T;
    cin>>D>>T;
    int C[N],A[N];
    for(int j=0;j<N;j++){
      cin>>C[j];
    }
    for(int j=0;j<N;j++){
      cin>>A[j];
    }
    int t=1e9,b;
    for(int i=0;i<1<<N;i++){
      int c=0;
      int rm=0;
      for(int j=0;j<N;j++){
	if(i>>j&1){
	  c+=C[j];
	  if(A[j]!=C[j]){
	    rm++;
	  }
	}
      }
      if(c==D){
	if(rm<t){
	  t=rm;
	  b=i;
	}
      }
    }
    if(t>1e8||t>=T){
      if(bernoulli_distribution(.5)(engine)){
	cout<<"pass"<<endl;
      }else{
	cout<<"change "<<uniform_int_distribution<>(1,N)(engine)<<endl;
      }
    }else{
      if(t==0){
	cout<<"sell "<<count(b);
	for(int j=0;j<N;j++){
	  if(b>>j&1){
	    cout<<' '<<j+1;
	  }
	}
	cout<<endl;
      }else{
	for(int j=0;;j++){
	  if(b>>j&1&&A[j]!=C[j]){
	    cout<<"fill "<<j+1<<endl;
	    break;
	  }
	}
      }
    }
  }
}

Submission Info

Judge Result