Wooden Sticks
Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 16237 Accepted Submission (s): 6665
Problem Description There is a pile of n wooden sticks. The length and weight of each stick is known in advance. The sticks is 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 is associated with cleaning operations and changing tools and shapes. The setup times of the woodworking machine is 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 would need no setup time for a stick of length l ' and weight W ' if l<=l ' and W<=w '. Otherwise, it'll need 1 minute for setup.
You is 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 is (4,9), (5,2), (2,1), (3,5), and (1,4), then the Minimum setup time should be 2 minutes since there are 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 on the first line of the input file. Each test case consists of a lines:the first line has a integer n, 1<=n<=5000, that represents the number of Wo Oden sticks in the test case, and the second line contains n 2 positive integers L1, W1, L2, W2, ..., LN, WN, each of Magn Itude at most 10000, where Li and wi is the length and weight of the i th wooden stick, respectively. The 2n integers is 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 Ac-code:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct node
{
int x, y;
} S[5005];
BOOL CMP (node A,node b)
{
if (a.x==b.x)
return a.y<b.y;
Return a.x<b.x;
}
int c[5005];
int main ()
{
int t,n,i,j,cnt,flag;
scanf ("%d", &t);
while (t--)
{
scanf ("%d", &n);
for (i=0;i<n;i++)
scanf ("%d%d", &s[i].x,&s[i].y);
Sort (s,s+n,cmp);
cnt=0;
Memset (C,0,sizeof (c));
for (i=0;i<n;i++)
if (!c[i])
{
flag=s[i].y;
for (j=i+1;j<n;j++)
if (!c[j]&&s[j].y>=flag)
flag=s[j].y,c[j]=1;
C[i]=1;
cnt++;
}
printf ("%d\n", CNT);
}
return 0;
}