2.1.4 Healthy Holsteins

这道题比较简单，就是bfs，不过我用了string导致了一些问题，调了我2个小时。终于好了。唉，下次不能粗心啊。

具体代码如下：（自己体会细节）

   
     

    
      
/*
    
      
ID: awsd1231
    
      
PROG: holstein 
    
      
LANG: C++
    
      
*/
    
      
#include<iostream>
    
      
#include<cstdio>
    
      
#include<algorithm>
    
      
#include<queue>
    
      
#include<string>
    
      

    
      
using namespace std;
    
      

    
      
int V, eveV[25], G, eveGV[15][25];
    
      
//维他命种类数,每种需要的最小量,饲料的种类数,[每种饲料]含[每种维他命]的多少
    
      
string ans;
    
      
queue<string> may;
    
      
string bfs(string x) {
    
      
 int tmpV[25] = {0};
    
      
 int len = x.length();
    
      
 int b = x[len - 1] - '0' + 1;
    
      
 for(int l = 0; l != len; ++l) {
    
      
 for(int i = 0; i != V; ++i) {
    
      
 tmpV[i] += eveGV[x[l] - '0'][i];
    
      
 }
    
      
 }
    
      
 for (int i = b; i != G; ++i) {
    
      
 for (int j = 0; j != V; ++j) {
    
      
 if (tmpV[j] + eveGV[i][j] < eveV[j]) {
    
      
 char c = i + '0';
    
      
 may.push(x + c);
    
      
 break;
    
      
 }
    
      
 else if (j == V - 1) {
    
      
 char c = i + '0';
    
      
 return x + c;
    
      
 }
    
      
 }
    
      
 }
    
      
 may.pop();
    
      
 return bfs(may.front());
    
      
}
    
      

    
      
int main () {
    
      
 freopen("holstein.in", "r", stdin); 
    
      
 freopen("holstein.out", "w", stdout);
    
      
 scanf("%d", &V);
    
      
 for (int i = 0; i != V; ++i) {
    
      
 scanf("%d", &eveV[i]);
    
      
 }
    
      
 scanf("%d", &G);
    
      
 for (int i = 0; i != G; ++i) {
    
      
 for (int j = 0; j != V; ++j) {
    
      
 scanf("%d", &eveGV[i][j]);
    
      
 }
    
      
 }
    
      
 for (int i = 0; i != G; ++i) {
    
      
 for (int j = 0; j != V; ++j) {
    
      
 if(eveGV[i][j] < eveV[j]) break;
    
      
 else if(j == V - 1) {
    
      
 cout << "1" << " " << i + 1 << endl;
    
      
 return 0;
    
      
 }
    
      
 }
    
      
 }
    
      
 if(G != 1) {
    
      
 for(int i = 0; i != G; ++i) {
    
      
 char c = i + '0';
    
      
 string t;
    
      
 may.push(t + c);
    
      
 }
    
      
 ans = bfs(may.front());
    
      
 int len = ans.length();
    
      
 cout << len << " ";
    
      
 for (int i = 0; i != len - 1; ++i) {
    
      
 cout << ans[i] + 1 - '0' << " ";
    
      
 }
    
      
 cout << ans[len - 1] + 1 - '0' << endl;
    
      
 } else cout << "1 1" << endl;
    
      
 return 0;
    
      
}
   
     

来自为知笔记(Wiz)