• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 195,  comments - 30,  trackbacks - 0

             

            #include<iostream>
            #include
            <cstdlib>
            #include 
            <memory> 
            using namespace std;
              
            int a[201];
              
            int main()
              
            {
              
            //freopen("s.txt","r",stdin);
              
            //freopen("key.txt","w",stdout);
              int n,m,i,j,k,temp;
              cin
            >>n;
              
            while(n--)
              
            {
                 temp
            =0;       
                 memset(a,
            0,sizeof(a));              
                 cin
            >>m;
                 
            while(m--)
                 
            {
                        cin
            >>i>>j;
                        
            if(i%2==0)
                          i
            =i/2;
                          
            else i=i/2+1;
                        
            if(j%2==0)
                           j
            =j/2;
                           
            else 
                             j
            =j/2+1;
                        
            if(i>j)
                        
            {temp=i;
                        i
            =j;
                        j
            =temp;
                        temp
            =0;
                        }
                 
                        
            for(k=i;k<=j;k++)
                        a[k]
            ++;  
                 }

                 
            for(k=1;k<=200;k++)
                 
            if(a[k]>temp)temp=a[k];
                 cout
            <<temp*10<<endl;                 
              }


              
            //system("PAUSE");
              return   0;
              }

            Moving Tables


            Status In/Out TIME Limit MEMORY Limit Submit Times Solved Users JUDGE TYPE
            stdin/stdout 3s 8192K 899 213 Standard

            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 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
            
            題真的很簡單,有一個陷阱就是他給的s和t的大小不一定都是s<=t的,

            一定要仔細慎重啊

            低級錯誤
            posted on 2009-05-11 11:36 luis 閱讀(336) 評論(0)  編輯 收藏 引用
            <2009年5月>
            262728293012
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            2021久久精品免费观看| 久久人人爽人人爽人人片AV东京热| 久久91这里精品国产2020| 无码精品久久久久久人妻中字| 国产精品中文久久久久久久| 精品久久久久久无码免费| 久久久久国产精品| 久久久久国产精品嫩草影院| 日韩影院久久| 蜜臀av性久久久久蜜臀aⅴ| www.久久热| 三级韩国一区久久二区综合 | 国产午夜电影久久| 久久久精品视频免费观看| 狠狠人妻久久久久久综合| 欧美午夜精品久久久久久浪潮| 久久婷婷五月综合成人D啪| 久久精品国产亚洲AV不卡| 久久九九兔免费精品6| 欧美牲交A欧牲交aⅴ久久 | 久久久久久久久久久免费精品| 久久av免费天堂小草播放| 亚洲国产一成久久精品国产成人综合 | 日韩人妻无码精品久久免费一| 久久99精品久久久久久水蜜桃 | 成人午夜精品久久久久久久小说| 精品久久久无码21p发布| 亚洲欧美成人综合久久久| 久久成人精品视频| 久久99精品久久久久久齐齐| 色诱久久av| 粉嫩小泬无遮挡久久久久久| 久久婷婷人人澡人人| 久久狠狠爱亚洲综合影院| 久久青青草原国产精品免费 | 99久久国产主播综合精品| 亚洲AV无码久久精品成人| 精品久久香蕉国产线看观看亚洲| 久久久久亚洲AV综合波多野结衣 | 久久人人爽爽爽人久久久| 精品久久久久国产免费|