【USACO 1.4.1】铺放矩形块

  1 #include <iostream>
  2 #include <cstdio>
  3 #include <cmath>
  4 #include <cstring>
  5 #include <algorithm>
  6 const int maxn=15;
  7 using namespace std;
  8 struct matrix
  9 {
 10        int w;
 11        int h;
 12 }data[maxn];
 13 struct Ans
 14 {
 15        int w;
 16        int h;
 17        int s;
 18        bool operator <(const Ans&b) const
 19        {
 20             if (s==b.s) return w<b.w;
 21             return s<b.s;
 22        }
 23 }ans[60000];
 24 int point=0;
 25 void check(matrix a,matrix b,matrix c,matrix d);
 26 int main()
 27 {
 28     int i,a,b,c,d;
 29     int vis[15];
 30     //文件操作 
 31     freopen("packrec.in","r",stdin);
 32     freopen("packrec.out","w",stdout);
 33     for (i=1;i<=4;i++)
 34     {
 35         scanf("%d%d",&data[i].w,&data[i].h);
 36         data[i+4].w=data[i].h;
 37         data[i+4].h=data[i].w;//不同的擺放狀態也應該記作不同的矩形 
 38     }
 39     
 40     for (a=1;a<=8;a++)
 41     for (b=1;b<=8;b++)
 42     {
 43         if (a==b) continue;
 44         for (c=1;c<=8;c++)
 45         {
 46             if (a==c || b==c) continue;
 47             for (d=1;d<=8;d++)
 48             {
 49                 if (a==d || b==d || c==d) continue;
 50                 memset(vis,0,sizeof(vis));
 51                 vis[a]++;vis[b]++;vis[c]++;vis[d]++;
 52                 if (vis[1]+vis[5]>1) continue;
 53                 if (vis[2]+vis[6]>1) continue;
 54                 if (vis[3]+vis[7]>1) continue;
 55                 if (vis[4]+vis[8]>1) continue;
 56                 check(data[a],data[b],data[c],data[d]);
 57             }
 58         }
 59     }
 60 
 61     sort(ans,ans+point);
 62     printf("%d\n",ans[0].s);
 63     for (i=0;i<point;i++)
 64     {
 65         if (i!=0 && ans[i].s!=ans[i-1].s) break;
 66         if (i!=0 && ans[i].w==ans[i-1].w) continue;
 67         printf("%d %d\n",ans[i].w,ans[i].h);
 68     }
 69     return 0;
 70 }
 71 void check(matrix a,matrix b,matrix c,matrix d)
 72 {
 73      //枚舉
 74      ans[point].w=a.w+b.w+c.w+d.w;ans[point].h=max(a.h,max(b.h,max(c.h,d.h))); 
 75      ans[point].s=ans[point].w*ans[point].h;
 76      if (ans[point].w>ans[point].h) swap(ans[point].w,ans[point].h);
 77      point++;
 78      ans[point].w=max(a.w+b.w+c.w,d.w);ans[point].h=max(a.h,max(b.h,c.h))+d.h;
 79      ans[point].s=ans[point].w*ans[point].h;
 80      if (ans[point].w>ans[point].h) swap(ans[point].w,ans[point].h);
 81      point++;
 82      ans[point].w=max(a.w+b.w,c.w)+d.w;
 83      ans[point].h=max(a.h+c.h,max(b.h+c.h,d.h));
 84      ans[point].s=ans[point].w*ans[point].h;
 85      if (ans[point].w>ans[point].h) swap(ans[point].w,ans[point].h);
 86      point++;
 87      ans[point].w=a.w+b.w+max(c.w,d.w);
 88      ans[point].h=max(a.h,max(c.h+d.h,b.h));
 89      ans[point].s=ans[point].w*ans[point].h;
 90      if (ans[point].w>ans[point].h) swap(ans[point].w,ans[point].h);
 91      point++;
 92      ans[point].h=max(a.h+c.h,b.h+d.h);
 93      if (c.h==d.h) ans[point].w=max(a.w+b.w,c.w+d.w);
 94      if (c.h>=b.h+d.h) ans[point].w=max(a.w,max(c.w+b.w,c.w+d.w));
 95      if (c.h>d.h && c.h<b.h+d.h) ans[point].w=max(a.w+b.w,max(b.w+c.w,c.w+d.w));
 96      if (d.h>c.h && d.h<a.h+c.h) ans[point].w=max(a.w+b.w,max(a.w+d.w,c.w+d.w));
 97      if (d.h>=a.h+c.h) ans[point].w=max(b.w,max(a.w+d.w,c.w+d.w));
 98      ans[point].s=ans[point].w*ans[point].h;
 99      if (ans[point].w>ans[point].h) swap(ans[point].w,ans[point].h);
100      point++;
101 }