[题目] A. Elevator or Stairs? [描述] Masha要从第x层楼去第y层楼找Egor,可以选择爬楼梯或者坐直升电梯.已知爬楼梯每层需要时间t1:坐直升电梯每层需要时间t2,直升电梯开门或者关门一次需要时间t3,当前直升电梯在第z层楼,直升电梯门是在关闭状态的.如果爬楼梯总时间严格小于坐直升电梯,则选择爬楼梯并输出YES,否则选择坐直升电梯并输出NO. 数据范围:1<=x,y,z,t1,t2,t3<=1000 [思路] 爬楼梯总时长:t1*abs(x-y) 坐直升电梯总时
A. Determine Line Water. 1 #include <bits/stdc++.h> 2 using namespace std; 3 4 int n, vis[110]; 5 6 int main() 7 { 8 while (scanf("%d", &n) != EOF) 9 { 10 memset(vis, 0, sizeof vis); 11 for (int i = 1, tot, x; i <= n; ++i) 12 { 13 s
A. Elevator or Stairs? 签. 1 #include <bits/stdc++.h> 2 using namespace std; 3 4 int x, y, z, t[3]; 5 6 int main() 7 { 8 while (scanf("%d%d%d", &x, &y, &z) != EOF) 9 { 10 for (int i = 0; i < 3; ++i) scanf("%d", t +
In the year of 30XX30XX participants of some world programming championship live in a single large hotel. The hotel has nn floors. Each floor has mm sections with a single corridor connecting all of them. The sections are enumerated from 11 to mm alo