CodeForces - 1249E
You are planning to buy an apartment in a nn-floor building. The floors are numbered from 11 to nn 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:
aiai for all ii from 11 to n−1n−1 be the time required to go from the ii-th floor to the (i+1)(i+1)-th one (and from the (i+1)(i+1)-th to the ii-th as well) using the stairs;
bibi for all ii from 11 to n−1n−1 be the time required to go from the ii-th floor to the (i+1)(i+1)-th one (and from the (i+1)(i+1)-th to the ii-th as well) using the elevator, also there is a value cc — 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 xx to any floor yy (x≠yx≠y) in two different ways:
If you are using the stairs, just sum up the corresponding values of aiai. Formally, it will take ∑i=min(x,y)max(x,y)−1ai∑i=min(x,y)max(x,y)−1ai time units.
If you are using the elevator, just sum up cc and the corresponding values of bibi. Formally, it will take c+∑i=min(x,y)max(x,y)−1bic+∑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 ii to determine the minimum total time it takes to reach the ii-th floor from the 11-st (bottom) floor.
Input
The first line of the input contains two integers nn and cc (2≤n≤2⋅105,1≤c≤10002≤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−1n−1 integers a1,a2,…,an−1a1,a2,…,an−1 (1≤ai≤10001≤ai≤1000), where aiai is the time required to go from the ii-th floor to the (i+1)(i+1)-th one (and from the (i+1)(i+1)-th to the ii-th as well) using the stairs.
The third line of the input contains n−1n−1 integers b1,b2,…,bn−1b1,b2,…,bn−1 (1≤bi≤10001≤bi≤1000), where bibi is the time required to go from the ii-th floor to the (i+1)(i+1)-th one (and from the (i+1)(i+1)-th to the ii-th as well) using the elevator.
Output
Print nn integers t1,t2,…,tnt1,t2,…,tn, where titi is the minimum total time to reach the ii-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层楼。a[i]表示(0<i<n)表示从i楼到i+1楼走楼梯的时间,b[i]表示乘电梯的时间,求从1楼到1~n楼所需的最短时间
思路:从对每一层要么走楼梯要么走电梯
#include<stdio.h> #include<string.h> #include<algorithm> typedef long long ll; const int N=2*1e5+10; using namespace std; int a[N],b[N],dp[N][10]; ///二维数组dp[i][j],表示通过 j 的方法 ///(j=0表示楼梯,j=1表示电梯)到第i层所需的最少时间。 int main() { int n,c; while(~scanf("%d %d",&n,&c)) { memset(dp,0,sizeof(dp)); memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(int i=2; i<=n; i++) scanf("%d",&a[i]); for(int i=2; i<=n; i++) scanf("%d",&b[i]); dp[1][0]=0;///stairs dp[1][1]=0x3f3f3f;///elevator ///a[i] 代表 i-1到i层楼的时间 for(int i=2; i<=n; i++) { dp[i][0]=min(dp[i-1][0]+a[i],dp[i-1][1]+a[i]); dp[i][1]=min(dp[i-1][0]+b[i]+c,dp[i-1][1]+b[i]); } for(int i=1; i<n; i++) printf("%d ",min(dp[i][0],dp[i][1])); printf("%d\n",min(dp[n][0],dp[n][1])); } return 0; }Starry_Sky_Dream 原创文章 50获赞 4访问量 2342 关注 私信
- CodeForces 589F -- F. Gourmet and Banquet (二分 + 贪心)
- Codeforces 834E The Bakery【枚举+数位dp】
- CodeForces - 798C Mike and gcd problem (贪心+思维)
- codeforces 183(div2) A. Pythagorean Theorem II 枚举+二分查找
- codeforces 303 div2 E
- Codeforces Div.2 212 C Insertion Sort (DP)
- CodeForces 669B Little Artem and Grasshopper(可怜的小蚂蚱,等待AC)
- CodeForces - 673B Problems for Round
- codeforces 312
- [思维]CodeForces 135B
- Codeforces 1118F1 Tree Cutting (Easy Version) (DFS)
- CodeForces 706A Beru-taxi
- codeforces 835 (3/6)
- codeforces_59B Fortune Telling
- 【codeforces】305C GCD,容斥
- 『ACM C++』 Codeforces | 1005D - Polycarp and Div 3
- codeforces 691C Exponential notation(思维 + 比较精妙的模拟)
- Codeforces 438D The Child and Sequence - 线段树
- Codeforces 313
- Bits - CodeForces 485C