hdoj 1051 Wooden Sticks

最新推荐文章于 2022-12-02 11:31:48 发布

SimonCoder

最新推荐文章于 2022-12-02 11:31:48 发布

阅读量615

点赞数

分类专栏： # |--hdoj

本文链接：https://blog.csdn.net/SimonCoder/article/details/40451897

版权

|--hdoj 专栏收录该内容

134 篇文章 0 订阅

订阅专栏

http://acm.hdu.edu.cn/showproblem.php?pid=1051

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12154 Accepted Submission(s): 5035

Problem Description

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:

(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l' and weight w' if l<=l' and w<=w'. Otherwise, it will need 1 minute for setup.

You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are (4,9), (5,2), (2,1), (3,5), and (1,4), then the minimum setup time should be 2 minutes since there is a sequence of pairs (1,4), (3,5), (4,9), (2,1), (5,2).

Input

The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1<=n<=5000, that represents the number of wooden sticks in the test case, and the second line contains n 2 positive integers l1, w1, l2, w2, ..., ln, wn, each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces.

Output

The output should contain the minimum setup time in minutes, one per line.

Sample Input

  
  
   
   3 
5 
4 9 5 2 2 1 3 5 1 4 
3 
2 2 1 1 2 2 
3 
1 3 2 2 3 1

Sample Output

注意两点：

（1）：排序要先对长度排，如果长度相等再对重量排。或者先对重量排，如果重量相等再对长度排。

（2）：在一次扫描中，如果前一个L，W都小于后一个木头，下一步时要把L，W更新，要放后一个木头的参数，然后再往下比较。

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct Tree
{
    int a;
    int b;
    int J;
}num[10000];
int cmp(const void *a,const void *b)
{
    struct Tree *c=(Tree *)a;
    struct Tree *d=(Tree *)b;
    if(c->a!=d->a)
    return c->a-d->a;
    else
    return c->b-d->b;
}
int main()
{
    int T,N,i,j,k,sum;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&N);
        for(i=0;i<N;i++)
        {
             scanf("%d %d",&num[i].a,&num[i].b);
             num[i].J=1;
        }
        qsort(num,N,sizeof(num[0]),cmp);
    //    for(i=0;i<N;i++)
    //    printf("%d %d#\n",num[i].a,num[i].b);
        for(i=0,sum=0;i<N;i++)
        {
            if(num[i].J==0)
            continue;
            else
            sum+=1;
            
            num[i].J=0;
            int A=num[i].a;
            int B=num[i].b;
            for(j=i;j<N;j++)
            {
                if(num[j].J==0) continue;
                else
                if(A<=num[j].a&&B<=num[j].b)
                {
                   num[j].J=0;
                   A=num[j].a;
                   B=num[j].b;
                }
            }
      //      for(j=0;j<N;j++)
      //      printf("%d ",num[j].J);
      //      printf("\n");
        }
        printf("%d\n",sum);
    }
    return 0;
}