hustoj——练习赛i题
来源:互联网 发布:有源码怎么建站 编辑:程序博客网 时间:2024/06/05 19:50
Problem I: Moving Tables
Time Limit: 1 Sec Memory Limit: 32 MBSubmit: 171 Solved: 63
[Submit][Status][Web Board]
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
102030
#include<stdio.h>#include<algorithm>using namespace std;int rooms[201]={0};int main(){int T,N,begin,end,max;scanf("%d",&T);while(T--){max=0;for(int i=0; i<201; i++) rooms[i]=0;scanf("%d",&N);for(int j=0; j<N; j++){scanf("%d %d",&begin,&end);if(begin>end) swap(begin,end);for(int k=(begin+1)/2; k<=(end+1)/2; k++) rooms[k]++;}for(int g=0; g<201; g++) if(rooms[g]>max)max=rooms[g];printf("%d\n",max*10);}}
- hustoj——练习赛i题
- 【HUSTOJ】1062: 对角线I
- 【HUSTOJ】1064: 斜角I
- 【HUSTOJ】1068: 拐角I
- 【HUSTOJ】1056: 数字走向I
- 指针练习——变量交换I
- 递归递推练习——I
- 【HUSTOJ】1084: 有趣的数字图形I
- HustOj 数据库分析(r1292) [—夏 夏 ]
- Java——I/O相关练习代码
- Java——I/O入门相关练习代码
- ACM第一次练习—1001B,1008I
- HustOj使用脚本开启判题功能
- 【HUSTOJ】1000: 一个伟大的题
- Ubuntu 上 HUSTOJ Pascal判题设置
- 在线判题系统hustoj的搭建
- [转]HUSTOJ建立分布式判题系统
- 多校联合练习赛1 problem1009 I-number 信心题啊。。。
- JS阻止事件被频繁点击
- 求两个字符串的最长公共子序列的数量
- C/C++中#,##,__FILE__,__LINE__等的用法
- (1)Tika获取文件的类型、编码、文本内容
- Codeforces 645B Mischievous Mess Makers 【逆序对】
- hustoj——练习赛i题
- 【线段树】【树】【网络流】[UOJ#77]A+B Problem
- ARMv8 架构与指令集.学习笔记
- Android Scroll分析
- android开发中的一些思考
- JAVA学习之数据类型的使用
- Unity3D小小小经验篇——Canvas
- cocos2d 释放资源 总结
- 参数化查询 '(@UserName nvarchar(1),@PassWord nvarchar(4000))Select * from Us未提供“@PassWord”参数