ZOJ 2192 T-Shirt Gumbo(DFS)

来源：互联网发布：怎么进入淘宝店铺编辑：程序博客网时间：2024/06/05 04:27

普通的搜索会超时

可以剪的地方:

1.库存里没有T-shirt了可以剪掉

2.刚开始对各个参赛者的大小要求范围按最小的排个序,再进行搜索

#include <iostream>#include <cstdio>#include <memory.h>#include <algorithm>#include <string>using namespace std;const int maxn=50;char buf[maxn],tb[90];string dem[30];int iv[10],n;void init(){tb['S']=0;tb['M']=1;tb['L']=2;tb['X']=3;tb['T']=4;}bool cmp(const string &str1 ,const string &str2){return tb[str1[0]]<tb[str2[0]];}bool dfs(int curi){if(curi==n){return true;}for (int i=tb[dem[curi][0]];i<=tb[dem[curi][1]];++i){if(iv[i]>0){iv[i]--;for (int j=0;j<5;++j){if(iv[j]>0||curi+1==n){//必须有库存才继续,否则剪掉if(dfs(curi+1))return true;break;}}iv[i]++;}}return false;}int main(){init();while (scanf("%s",buf)&&strcmp(buf,"ENDOFINPUT")){scanf("%d",&n);for (int i=0;i<n;++i){scanf("%s",buf);dem[i]=buf;}sort(dem,dem+n,cmp);//对范围按最小的排个序for (int i=0;i<5;++i){scanf("%d",&iv[i]);}if(dfs(0)){printf("T-shirts rock!\n");}else{printf("I'd rather not wear a shirt anyway...\n");}scanf("%s",buf);}return 0;}