HDOJ---ACMSteps---1.3.6Wooden Sticks

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 1449 Accepted Submission(s): 581

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 2 1 3   #include <iostream> #include <cstdio> #include <cstdlib> using namespace std; struct Stic { int x; int y; int flag; }stic[5001]; int cmp(const void *a, const void *b) { if ((*(Stic *)a).x != (*(Stic*)b).x) { return (*(Stic *)a).x - (*(Stic*)b).x; } else { return (*(Stic *)a).y - (*(Stic*)b).y; } } int main() { int i, j, n, t; int cl, cw; cin>>t; while (t --) { cin>>n; i = 0; while(i < n) { cin>>stic[i].x; cin>>stic[i].y; stic[i].flag = 0; i ++; } qsort(stic, n, sizeof(stic[0]), cmp); stic[0].flag = 1; cl = stic[0].x; cw = stic[0].y; int count = 1; for (i = 1; i < n; i++) { for (j = i; j < n; j ++) { if (!stic[j].flag && stic[j].x >= cl && stic[j].y >= cw) { stic[j].flag = 1; cl = stic[j].x; cw = stic[j].y; } } j = 1; while (stic[j].flag && j < n) { j ++; } i = j; if (i == n) { break; } count ++; stic[i].flag = 1; cl = stic[i].x; cw = stic[i].y; } printf("%d\n", count); } return 0; }