Wooden Sticks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10105 Accepted Submission(s): 4154
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).
(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
2 1 3
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct ss
{
int l,w,flag;
} s[10004];
int cmp(ss a,ss b)
{
if(a.l==b.l) return a.w<b.w;
return a.l<b.l;
}
int main()
{
int t,n,i,j,ans;
scanf("%d",&t);
while(t--)
{
memset(s,0,sizeof(s));
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d%d",&s[i].l,&s[i].w);
s[i].flag=0;
}
sort(s,s+n,cmp);
ss temp;
temp=s[0];
ans=1;
for(i=0; i<n; i++)
{//搜搜后面是否有可以跟它一组的,有则标记
for(j=i; j<n; j++)
{
if(!s[j].flag&&s[j].l>=temp.l&&s[j].w>=temp.w)
{
s[j].flag=1;
temp=s[j];
}
}
for(j=1; j<n; j++)
if(!s[j].flag) break;
if(j==n) break;//所有元素都被标记,都有归属则退出
ans++;
temp=s[j];
s[j].flag=1;
i=j;
}
printf("%d\n",ans);
}
return 0;
}