zoukankan      html  css  js  c++  java
  • Moving Tables

    Moving Tables

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 12304    Accepted Submission(s): 4226


    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

     (注意临界值!!!)

    #include<stdio.h>
    #include<string.h>
    int main()
    {
        int count[205];
        int end,begin;
        int T,n;
        int temp,i;
        int max;
        scanf("%d",&T);
        while(T--)
        {
            memset(count,0,sizeof(count));
            scanf("%d",&n);
            while(n--)
            {
                scanf("%d %d",&begin,&end);
                if(begin>end) {temp=begin;begin=end;end=temp;}
                for(i=(begin+1)/2;i<=(end+1)/2;i++)
                {
                    count[i]++;
                }
            }
            max=0;
            for(i=1;i<=202;i++)
            {
                if(max<count[i]){max=count[i];}
            }
            printf("%d
    ",10*max);
        }
    }
    View Code
  • 相关阅读:
    操作数据库系统(OLTP)和联机分析处理系统(OLAP)的区别
    BI笔记-SSAS部署的几种方式及部署后的SSAS刷新
    概念-数据仓库与元数据
    零基础学Python 3之环境准备
    OFBiz进阶之HelloWorld(五)创建新实体
    OFBIZ bug_create-component ERROR
    OFBIZ bug_ControlServlet.java:233:ERROR
    OFBiz进阶之HelloWorld(三)CRUD操作
    OFBiz进阶之HelloWorld(二)创建热部署模块
    OFBIZ bug_ControlServlet.java:239:ERROR
  • 原文地址:https://www.cnblogs.com/renqiqiang/p/5308598.html
Copyright © 2011-2022 走看看