Moving tables

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. 

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<iostream>
#include<cstdio>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<fstream>
#include<memory>
#include<string>
using namespace std;
typedef long long LL;
#define MAXN  209
#define INF 1000000009
/*
移动桌子，走廊不可以共用求最短时间
求最大的线段重叠长度
*/
int cnt[MAXN],n;
struct node
{
    int t, s;
};
node t;
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        memset(cnt, 0, sizeof(cnt));
        scanf("%d", &n);
        for (int i = 0; i < n; i++)
        {
            scanf("%d%d", &t.s, &t.t);
            if (t.s > t.t)
                swap(t.s, t.t);
            t.s = (t.s + 1) / 2;
            t.t = (t.t + 1) / 2;
            for (int i = t.s; i <= t.t; i++)
            {
                cnt[i]++;
            }
        }
        int ans =0;
        for(int i=0;i<MAXN;i++)
        {
            ans = max(ans, cnt[i]);
        }
        printf("%d\n", (ans) * 10);
    }
}