HDU_1050 重叠数

先将数组进行排序，第一次循环，将不重叠的元素从数组中删除（这里将flag赋值为false），sum+=10

继续第二次循环，以此类推，直到数组中没有元素（flag全为false）

注意的问题：

1.排序前要进行交换，的将小放在start,大的放在end

2.测试数据

1

2

1 3

4 8

3和4是重叠的，因为他们在对门，共用走廊

#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
struct move{
public:
int start;
int end;
bool flag;
};
bool comp( move p, move q){
return p.start < q.start;
}
int main(){

move m[204];
int t;
cin>>t;
for(int i=1;i<=t;++i){
int n;
cin>>n;
for(int j=0;j<n;++j){
cin>>m[j].start>>m[j].end;
m[j].flag = true;

if(m[j].start>m[j].end){
int temp =   m[j].start;
m[j].start =   m[j].end;
m[j].end = temp;
}
}

sort(m,m+n,comp);    //°´½áÊøʱ¼ä´ÓСµ½´óÅÅÁÐ

int sum = 0;
for(int k=0;k<n;++k){
int p=-1;
for(int j=0;j<n;++j){
if(m[j].flag){
p = j;
m[p].flag = false;
break;
}
}

if(p<0){
break;
}

for(int j=p+1;j<n;++j){
if(m[j].flag){
if(m[j].start > m[p].end+1){
m[j].flag = false;
p = j;
}else if(m[j].start == m[p].end+1 && m[j].start%2!=0){
m[j].flag = false;
p = j;
}
}
}
sum+= 10;
}
cout<<sum<<endl;
}

return 0;
}

Moving Tables

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


Problem Description
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.



The floor has 200 rooms each on the north side and south side along the corridor. Recently the Company made a plan to reform its system. The reform includes moving a lot of tables between rooms. Because the corridor is narrow and all the tables are big, only one table can pass through the corridor. Some plan is needed to make the moving efficient. The manager figured out the following plan: Moving a table from a room to another room can be done within 10 minutes. When moving a table from room i to room j, the part of the corridor between the front of room i and the front of room j is used. So, during each 10 minutes, several moving between two rooms not sharing the same part of the corridor will be done simultaneously. To make it clear the manager illustrated the possible cases and impossible cases of simultaneous moving.



For each room, at most one table will be either moved in or moved out. Now, the manager seeks out a method to minimize the time to move all the tables. Your job is to write a program to solve the manager’s problem.

Input
The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.

Output
The output should contain the minimum time in minutes to complete the moving, one per line.

Sample Input

3
4
10 20
30 40
50 60
70 80
2
1 3
2 200
3
10 100
20 80
30 50

Sample Output

10
20
30