POJ1083 模拟

0)

题目大意：  400个房间排成两排，中间是走廊（如题目中的图所示），要从某些房间搬桌子到另一个房间，两个房间进行搬运时中间的走廊包括两个房间门口前的空间都是不能有其他桌子的搬运行为，但只要搬运空间没有交集就可以同时进行，假设每次搬运不论距离长远都是10分钟，问最少一共需要多少分钟。

模拟，注意细节即可。这种题目应该1y，连着wa了好几次，确实应该反思：读题注意细节，敲完代码提交之前顺着题目应用场景的思路在自己的代码上走一遍，看看有没有什么情况漏掉。

1)

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stack>
#include <algorithm>

using namespace std;
const int maxn=210;
struct Object{
    int left;
    int right;
    int flag;
}object[maxn];
bool cmp(Object a,Object b){
    return a.left<b.left;
}
int main()
{
    int t;
    cin>>t;
    while(t--){
        int time=0;
        int n;
        scanf("%d",&n);
        int x,y;
        for(int i=0;i<n;i++){
            scanf("%d%d",&x,&y);
            object[i].left=x<y?x:y;
            object[i].right=x>y?x:y;
            object[i].flag=0;
        }
        sort(object,object+n,cmp);
        for(int i=0;i<n;i++){
            if(object[i].flag==1)
                continue;
            int cur_right=object[i].right;
            object[i].flag=1;
            time+=10;
            for(int j=i+1;j<n;j++){
                if(object[j].flag==0){
                    if(cur_right<object[j].left){
                        if(cur_right%2==0){
                            object[j].flag=1;
                            cur_right=object[j].right;
                        }
                        else if(cur_right%2==1&&((cur_right+1)<object[j].left)){
                            object[j].flag=1;
                            cur_right=object[j].right;
                        }
                    }
                }
            }
        }
        cout<<time<<endl;
    }
    return 0;
}

2)

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 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.

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