2021-05-23

楼梯与电梯的转换

You are planning to buy an apartment in a n-floor building. The floors are numbered from 1 to n from the bottom to the top. At first for each floor you want to know the minimum total time to reach it from the first (the bottom) floor.

Let:

ai for all i from 1 to n−1 be the time required to go from the i-th floor to the (i+1)-th one (and from the (i+1)-th to the i-th as well) using the stairs;
bi for all i from 1 to n−1 be the time required to go from the i-th floor to the (i+1)-th one (and from the (i+1)-th to the i-th as well) using the elevator, also there is a value c — time overhead for elevator usage (you need to wait for it, the elevator doors are too slow!).
In one move, you can go from the floor you are staying at x to any floor y (x≠y) in two different ways:

If you are using the stairs, just sum up the corresponding values of ai. Formally, it will take ∑i=min(x,y)max(x,y)−1ai time units.
If you are using the elevator, just sum up c and the corresponding values of bi. Formally, it will take c+∑i=min(x,y)max(x,y)−1bi time units.
You can perform as many moves as you want (possibly zero).

So your task is for each i to determine the minimum total time it takes to reach the i-th floor from the 1-st (bottom) floor.

Input
The first line of the input contains two integers n and c (2≤n≤2⋅105,1≤c≤1000) — the number of floors in the building and the time overhead for the elevator rides.

The second line of the input contains n−1 integers a1,a2,…,an−1 (1≤ai≤1000), where ai is the time required to go from the i-th floor to the (i+1)-th one (and from the (i+1)-th to the i-th as well) using the stairs.

The third line of the input contains n−1 integers b1,b2,…,bn−1 (1≤bi≤1000), where bi is the time required to go from the i-th floor to the (i+1)-th one (and from the (i+1)-th to the i-th as well) using the elevator.
Print n integers t1,t2,…,tn, where ti is the minimum total time to reach the i-th floor from the first floor if you can perform as many moves as you want.

Examples
Input
10 2
7 6 18 6 16 18 1 17 17
6 9 3 10 9 1 10 1 5
Output
0 7 13 18 24 35 36 37 40 45
Input
10 1
3 2 3 1 3 3 1 4 1
1 2 3 4 4 1 2 1 3
Output
0 2 4 7 8 11 13 14 16 17
题意
题意：给出n m，表示有n层楼，等电梯需要m时间； 给出两行数，每行有n-1个数， 第一行表示相邻层楼走楼梯需要的时间，第二行相邻层楼乘电梯需要的时间；从电梯转电梯不需要等待时间，从楼梯转楼梯也不需要等待时间，但是从楼梯转电梯需要算上等待的时间m。
题解
从i-1层到i层一共有四种状态：
先分别算出到达第i的方式，即
乘电梯
i-1层 i层
楼梯----->电梯
电梯----->电梯
或走楼梯
电梯----->楼梯
楼梯----->楼梯
然后在算出花费时间最小的方式

#include"stdio.h"
#include"string.h"
#include"algorithm"
using namespace std;
int a[701101],dp[3][701111],b[701111];
int main()
{
	int i,j,n,k,m,x,t;
	scanf("%d%d",&n,&m);
	for(i=2; i<=n; i++)
		scanf("%d",&a[i]);
	for(i=2; i<=n; i++)
		scanf("%d",&b[i]);
	printf("0");
	dp[1][1]=m;
	for(i=2; i<=n; i++)//0楼,1电梯 
	{
		dp[0][i]=min(dp[0][i-1]+a[i],dp[1][i-1]+a[i]);
		dp[1][i]=min(dp[0][i-1]+b[i]+m,dp[1][i-1]+b[i]);
		printf(" %d",min(dp[0][i],dp[1][i]));
	}
	return 0;
}