zoukankan      html  css  js  c++  java
  • 1050 Moving Tables(贪心-4)

    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

     代码1:

     1 #include<iostream>
     2 #include <algorithm>
     3 #include <cstring>
     4 #include <stdio.h>
     5 #include <math.h>
     6 using namespace std;
     7 int room1[500],room2[500],data[500];
     8 int main()
     9 {
    10     int n,m,tmp;
    11     while(cin>>n)
    12     {
    13         while(n--)
    14         {
    15             memset(data,0,sizeof(data));
    16             cin>>m;
    17             for(int i=0;i<m;i++)
    18             {
    19                 cin>>room1[i]>>room2[i];
    20                 if(room1[i]>room2[i])
    21                 {
    22                     tmp=room1[i];
    23                     room1[i]=room2[i];
    24                     room2[i]=tmp;
    25                 }
    26                 if(room1[i]%2==0)
    27                 room1[i]=room1[i]/2;
    28                 else
    29                 room1[i]=(room1[i]+1)/2;
    30                 if(room2[i]%2==0)
    31                 room2[i]=room2[i]/2;
    32                 else
    33                 room2[i]=(room2[i]+1)/2;
    34                 for(int k=room1[i];k<=room2[i];k++)
    35                 data[k]++;
    36             }
    37             sort(data,data+451);
    38             cout<<10*data[450]<<endl;
    39         }
    40     }
    41     return 0;
    42 }
    View Code
  • 相关阅读:
    Java精通并发-Lock锁方法原理详解
    Java精通并发-Lock锁机制深入详解
    深层次揭示runBlocking与coroutineScope之间的异同点
    轻量级协程与线程执行比对分析
    第二阶段冲刺个人任务——four
    第二阶段冲刺个人任务——three
    第二阶段冲刺个人任务——two
    第二阶段冲刺个人任务——one
    输入法评价
    2017.12.30第十五周学习进度
  • 原文地址:https://www.cnblogs.com/wang-ya-wei/p/5361250.html
Copyright © 2011-2022 走看看