南陽題目220-推桌子

推桌子

時間限制：1000 ms  |  內存限制：65535 KB

難度：3

描述

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.

輸入

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 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 3 + N -rd
line, the remaining test cases are listed in the same manner as above.

輸出

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

樣例輸入

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

樣例輸出

10
20
30

上傳者

這個題目，前面的處理就是讓其變成題目要求的情況，然後就是求區間覆蓋問題了，求其最大的覆蓋長度。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int p[10010];
struct node
{
	int x,y;
 } s[10010];
 int main()
 {
 	int a,b,m,n,i,M,j,k;
 	scanf("%d",&M);
 	while(M--)
 	{
 		memset(p,0,sizeof(p));
 		scanf("%d",&m);
 		for(i=0;i<m;i++)
 		{
 			scanf("%d%d",&a,&b);
 			a=(a+1)/2;
 			b=(b+1)/2;
 			if(a>b)
 			swap(a,b);
 			s[i].x=a;
 			s[i].y=b;
		 }
		 int ma=0;
		 for(i=0;i<m;i++)
		 {
		 	for(j=s[i].x;j<=s[i].y;j++)
		 	{
		 		p[j]+=10;
		 		if(ma<p[j])
		 		ma=p[j];
			 }
		 }
		 printf("%d\n",ma);
	 }
	 return 0;
 }

然後我自己想的另一種方法是每次求不相交的區間，取玩爲止，然後求出最少次數，但是，我也不太清楚爲什麼要這樣排序

1，按開始排序，從前向後找

2，按結束排序，從後向前找

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
	int x,y,f;
}s[100100];
bool cmp(node x,node y)
{
	return x.x<y.x;//按開始排序
}
int main()
{
	int a,b,c,m,n,i,j;
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&a,&b);
			a=(a+1)/2;
			b=(b+1)/2;
			if(a>b)
			swap(a,b);
			s[i].x=a;
			s[i].y=b;
			s[i].f=0;
		}
			
		sort(s,s+n,cmp);
		int t,j=0,cot=0;
		for(i=0;i<n;i++)
		{
			if(!s[i].f)
			{
				t=s[i].y;
				s[i].f=1;
				cot++;
				for(j=i+1;j<n;j++)
				{
					if(s[j].f==0&&s[j].x>t)
					{
						t=s[j].y;
						s[j].f=1;
					}
				}
			}
		}
	printf("%d\n",cot*10);
	}
	return 0;
}

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
	int x,y,f;
}s[100100];
bool cmp(node x,node y)
{
	return x.y<y.y;//按結束排序
}
int main()
{
	int a,b,c,m,n,i,j;
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&a,&b);
			a=(a+1)/2;
			b=(b+1)/2;
			if(a>b)
			swap(a,b);
			s[i].x=a;
			s[i].y=b;
			s[i].f=0;
		}
			
		sort(s,s+n,cmp);
		int t,j=0,cot=0;
		for(i=n-1;i>=0;i--)
		{
			if(!s[i].f)
			{
				t=s[i].x;
				s[i].f=1;
				cot++;
				for(j=i-1;j>=0;j--)
				{
					if(s[j].f==0&&s[j].y<t)
					{
						t=s[j].x;
						s[j].f=1;
					}
				}
			}
		}
	printf("%d\n",cot*10);
	}
	return 0;
}