TopCoder SRM 568 Div1 250 BallsSeparating

最不擅长的码农题，情况繁琐。

如果一个颜色存在，那么必须有至少一个盒子放这种颜色。我们枚举必须放某种颜色的盒子，其余的盒子把数量较小的两种颜色拿走就行了。

//tc is healthy, just do it
#include <bits/stdc++.h>
using namespace std;
const int N=51;
int n,c[N];

class BallsSeparating {
public:
    int minOperations( vector <int> red, vector <int> green, vector <int> blue );
};
int BallsSeparating::minOperations(vector <int> red, vector <int> green, vector <int> blue) {
    n=red.size();
    int ans=0,R=0,G=0,B=0,sR,sG,sB;
    for(int i=0;i<n;i++)
     sR+=red[i],sG+=green[i],sB+=blue[i];
    if (sR) sR=1;
    if (sG) sG=1;
    if (sB) sB=1;
    if (sR+sG+sB>n) return -1;
    //cout<<sR<<' '<<sG<<' '<<sB<<endl;
    for(int i=0;i<n;i++)
     if (red[i]>=green[i]&&red[i]>=blue[i]){
        R++;
        ans+=green[i]+blue[i];
        c[i]=green[i]+blue[i];
     } else if (green[i]>=red[i]&&green[i]>=blue[i]){
        G++;
        ans+=red[i]+blue[i];
        c[i]=red[i]+blue[i];
     } else if (blue[i]>=red[i]&&blue[i]>=green[i]){
        B++;
        ans+=red[i]+green[i];
        c[i]=red[i]+green[i];
     }
    //cout<<ans<<endl;
    if (R&&G&&B) return ans;
    ans=2e9;
    for(int i=0;i<n;i++)
     for(int j=0;j<n;j++)
      for(int k=0;k<n;k++)
       if (i!=j&&j!=k&&i!=k){
        int s=0;
        for(int l=0;l<n;l++)
         if (l==i&&sR) s+=green[l]+blue[l];
          else if (l==j&&sG) s+=blue[l]+red[l];
           else if (l==k&&sB) s+=red[l]+green[l];
            else s+=c[l];
         ans=min(ans,s);
         //if (s==70) printf("%d %d %d\n",i,j,k);
       }
    return ans;
}