POJ 1040 Transportation
链接:http://poj.org/problem?id=1040
Description
Ruratania is just entering capitalism and is establishing new enterprising activities in many fields in- cluding transport. The transportation company TransRuratania is starting a new express train from city A to city B with several
stops in the stations on the way. The stations are successively numbered, city A station has number 0, city B station number m. The company runs an experiment in order to improve passenger transportation capacity and thus to increase its earnings. The train
has a maximum capacity n passengers. The price of the train ticket is equal to the number of stops (stations) between the starting station and the destination station (including the destination station). Before the train starts its route from the city A, ticket
orders are collected from all onroute stations. The ticket order from the station S means all reservations of tickets from S to a fixed destination station. In case the company cannot accept all orders because of the passenger capacity limitations, its rejection
policy is that it either completely accept or completely reject single orders from single stations.
Write a program which for the given list of orders from single stations on the way from A to B determines the biggest possible total earning of the TransRuratania company. The earning from one accepted order is the product of the number of passengers included
in the order and the price of their train tickets. The total earning is the sum of the earnings from all accepted orders.
Input
The input file is divided into blocks. The first line in each block contains three integers: passenger capacity n of the train, the number of the city B station and the number of ticket orders from all stations. The next lines contain
the ticket orders. Each ticket order consists of three integers: starting station, destination station, number of passengers. In one block there can be maximum 22 orders. The number of the city B station will be at most 7. The block where all three numbers
in the first line are equal to zero denotes the end of the input file.
Output
The output file consists of lines corresponding to the blocks of the input file except the terminating block. Each such line contains the biggest possible total earning.
Sample Input
10 3 4
0 2 1
1 3 5
1 2 7
2 3 10
10 5 4
3 5 10
2 4 9
0 2 5
2 5 8
0 0 0
Sample Output
19
34
Source
Central Europe 1995
大意——从A到B有若干个车站,编号从0到m。列车的最大载客量是n。每次列车开车之前,会从各个车站收集订票信息。一条订票信息包含:起点站。终点站,人数。票价在数值上等于起点站与终点站之间的车站数(包含终点站,不包含起点站)。
因为列车的最大载客量是一定的。所以不一定能接受所有的订票。对于一条订票。仅仅能所有接受,或者是所有拒绝。如今给你最大载客量n。车站总数m,以及order条订票信息。要你计算出接受某些订票使之利润最大。而且输出这个最大利润。
思路——显然这是一个DFS的问题。但必须进行剪枝操作。
首先按起点站进行排序。假设起点站同样。则按终点站排。
然后按着顺序DFS:每接受一个订单,就把沿线所在站载客量所有加上这个订单中的人数。假设发现哪个站的人数超过了最大载客量n,就必须停下来,这个订单是不能接受的,就把所在站载客量中加上的人数所有减下来。
假设所有沿线所在站都没有超过n,就能够加上该订单的利润,開始測试下一个订单,測试完毕之后取消沿线所在站加的人数回溯。每当開始測试订单时,就把已经能获得的利润用參数的形式传递过去,保存这个最大值max。最后把所有的情况都遍历之后,输出max即得结果。
复杂度分析——时间复杂度:O(order*log(order))+O((n/passe)^order),空间复杂度:O(order)
附上AC代码:
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
const double PI = acos(-1.0);
const double E = exp(1.0);
const short maxorder = 22; // 最大订票量
const short maxsta = 8; // 最大车站数,包含首站
short cap, sta, order; // 分别表示火车的容量,车站数(不包含首站)和订票量
short down[maxsta]; // 第i站下车的人数,包含首站
short ans; // 终于结果
struct ticket
{
short start, des, pass;
bool operator < (const ticket & p) const{
if (start == p.start)
return des < p.des;
return start < p.start;
} // 按此规则排序
} ord[maxorder]; void dfs(short ord_num, short passe, short money); int main()
{
ios::sync_with_stdio(false);
while (cin >> cap >> sta >> order && (cap || sta || order))
{
for (int i=0; i<order; i++)
cin >> ord[i].start >> ord[i].des >> ord[i].pass; // 订票信息
sort(ord, ord+order);
ans = 0;
dfs(0, 0, 0);
cout << ans << endl;
}
return 0;
} void dfs(short ord_num, short passe, short money)
{
if (ord_num == order) // 订票量所有检查完成
{
ans = max(ans, money);
return;
}
if (ord_num > 0)
for (int i=ord[ord_num-1].start+1; i<=ord[ord_num].start; ++i)
passe -= down[i]; // 减去下车人数,计算当前车内人数
if (passe+ord[ord_num].pass <= cap) // 检查是否超载
{
down[ord[ord_num].des] += ord[ord_num].pass; // 不超载。接受订票
dfs(ord_num+1, passe+ord[ord_num].pass, money+ord[ord_num].pass*(ord[ord_num].des-ord[ord_num].start));
down[ord[ord_num].des] -= ord[ord_num].pass; // 恢复现场,以便后面回溯
}
dfs(ord_num+1, passe, money); // 不接受订票
}
POJ 1040 Transportation的更多相关文章
- poj 1797Heavy Transportation(dijkstra变形)
题目链接:http://poj.org/problem?id=1797 题意:有n个城市,m条道路,在每条道路上有一个承载量,现在要求从1到n城市最大承载量,而最大承载量就是从城市1到城市n所有通路上 ...
- POJ 3228Gold Transportation(二分+最大流)
题目地址:POJ3288 这个题跟之前的一道题混了,感觉是一样的,所以连想都没怎么想就拆点然后求最短路然后二分求最大流了.结果连例子都只是,还一直以为又是哪里手残了..结果看了看例子,手算也确实不正确 ...
- POJ题目排序的Java程序
POJ 排序的思想就是根据选取范围的题目的totalSubmittedNumber和totalAcceptedNumber计算一个avgAcceptRate. 每一道题都有一个value,value ...
- POJ 1797 Heavy Transportation (Dijkstra变形)
F - Heavy Transportation Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%I64d & ...
- POJ 1797 Heavy Transportation
题目链接:http://poj.org/problem?id=1797 Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K T ...
- poj 1797 Heavy Transportation(最大生成树)
poj 1797 Heavy Transportation Description Background Hugo Heavy is happy. After the breakdown of the ...
- POJ 1797 Heavy Transportation / SCU 1819 Heavy Transportation (图论,最短路径)
POJ 1797 Heavy Transportation / SCU 1819 Heavy Transportation (图论,最短路径) Description Background Hugo ...
- POJ.1797 Heavy Transportation (Dijkstra变形)
POJ.1797 Heavy Transportation (Dijkstra变形) 题意分析 给出n个点,m条边的城市网络,其中 x y d 代表由x到y(或由y到x)的公路所能承受的最大重量为d, ...
- POJ 1797 ——Heavy Transportation——————【最短路、Dijkstra、最短边最大化】
Heavy Transportation Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64 ...
随机推荐
- css去掉点击连接时所产生的虚线边框技巧兼容符合w3c标准的浏览器
解决方法: 1.在css中加上outline:none; 代码如下: a.fontnav { text-align:left;color:#555; text-decoration:none; out ...
- .com和.cn域名的区别所在,各个域名后缀含义
很多人在注册域名的时候不明白域名后缀的含义,在这里就介绍两种最为常用的域名,介绍下他们的区别以及适用的范围.需要先查询是否被注册,我们经常去的就是西部数据和万网,查询并注册未被注册的域名,一般无论是什 ...
- #!/bin/sh简介
第一次学shell编程,看的文章中说shell程序必须以"#!/bin/sh"开始,也就认为是这样了,虽然知道在shell中以"#"开始的语句都是注释,但也从没 ...
- 百度之星初赛(A)——T5
今夕何夕 Problem Description 今天是2017年8月6日,农历闰六月十五. 小度独自凭栏,望着一轮圆月,发出了“今夕何夕,见此良人”的寂寞感慨. 为了排遣郁结,它决定思考一个数学问题 ...
- roadhogrc.mock.js配置
1.roadhogrc.mock.js const fs=require('fs'); const path=require('path'); const mockPath=path.join(__d ...
- 【查看linux配置】查看linux系统常用的命令,Linux查看系统配置常用命令
一.linux CPU大小 cat /proc/cpuinfo |grep "model name" && cat /proc/cpuinfo |grep &qu ...
- STL~Deque简介
转自百度经验deque简介 deque是双向开口的连续性存储空间.虽说是连续性存储空间,但这种连续性只是表面上的,实际上它的内存是动态分配的,它在堆上分配了一块一块的动态储存区,每一块动态存储去本身是 ...
- mysql 连接失败问题汇集
FHost '192.168.5.128' is not allowed to connect to this MySQL serverConnection closed by foreign hos ...
- TMS320F28379D 使用心得之 SCI
原文地址https://blog.csdn.net/qq_39545674/article/details/82597106 一.SCI 简介SCI(Serial Communication Inte ...
- kvm虚拟机最佳实践系列2-创建KVM及KVM优化
创建KVM及KVM优化 把KVM优化与KVM创建放在一起,是因为我们创建的KVM是要用在生产环境中,所以基础优化工作是必备的. 创建KVM 创建系统盘, 大小: 操作系统通常都不到10G,所以系统盘2 ...