VK Cup 2016 - Round 1 (Div. 2 Edition) A. Bear and Reverse Radewoosh 水题
2016-03-29 09:27
483 查看
A. Bear and Reverse Radewoosh
题目连接:
http://www.codeforces.com/contest/658/problem/ADescription
Limak and Radewoosh are going to compete against each other in the upcoming algorithmic contest. They are equally skilled but they won't solve problems in the same order.There will be n problems. The i-th problem has initial score pi and it takes exactly ti minutes to solve it. Problems are sorted by difficulty — it's guaranteed that pi < pi + 1 and ti < ti + 1.
A constant c is given too, representing the speed of loosing points. Then, submitting the i-th problem at time x (x minutes after the start of the contest) gives max(0, pi - c·x) points.
Limak is going to solve problems in order 1, 2, ..., n (sorted increasingly by pi). Radewoosh is going to solve them in order n, n - 1, ..., 1 (sorted decreasingly by pi). Your task is to predict the outcome — print the name of the winner (person who gets more points at the end) or a word "Tie" in case of a tie.
You may assume that the duration of the competition is greater or equal than the sum of all ti. That means both Limak and Radewoosh will accept all n problems.
Input
The first line contains two integers n and c (1 ≤ n ≤ 50, 1 ≤ c ≤ 1000) — the number of problems and the constant representing the speed of loosing points.The second line contains n integers p1, p2, ..., pn (1 ≤ pi ≤ 1000, pi < pi + 1) — initial scores.
The third line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 1000, ti < ti + 1) where ti denotes the number of minutes one needs to solve the i-th problem.
Output
Print "Limak" (without quotes) if Limak will get more points in total. Print "Radewoosh" (without quotes) if Radewoosh will get more points in total. Print "Tie" (without quotes) if Limak and Radewoosh will get the same total number of points.Sample Input
3 250 85 250
10 15 25
Sample Output
LimakHint
题意
有两个人在做CF,一个正着做,一个反着做给你每道题的分值以及每道题做题的时间,问你谁的分数高
题解:
暴力模拟,扫一遍就好了代码
#include<bits/stdc++.h> using namespace std; const int maxn = 55; long long p[maxn]; long long t[maxn]; int main() { int n,c; scanf("%d%d",&n,&c); for(int i=1;i<=n;i++)scanf("%lld",&p[i]); for(int i=1;i<=n;i++)scanf("%lld",&t[i]); long long p1 = 0,p2 = 0; long long sum = 0; for(int i=1;i<=n;i++) { sum+=t[i]; p1 = p1 + max(0LL,p[i]-c*sum); } sum=0; for(int i=n;i>=1;i--) { sum+=t[i]; p2 = p2 + max(0LL,p[i]-c*sum); } if(p1>p2)cout<<"Limak"<<endl; else if(p2>p1)cout<<"Radewoosh"<<endl; else cout<<"Tie"<<endl; }
相关文章推荐
- 浅谈前端移动端页面开发(布局篇)
- 贪心1012
- 第四次
- Maven2的配置文件settings.xml
- Debian下配置网络的方法
- android 滑动删除的listview(自定义view)
- Leetcode Two Sum
- spark架构
- java 求两个链表的公共结点
- 那些想买但是决定不买的游戏
- DrawerLayout与SurfaceView搭配侧滑显示不完全
- 【硬件】DELLserver硬件监控及DELL系统管理工具OMSA介绍
- ios中json解析出现的null问题
- 如何打印PLC梯形图(3步搞定!)
- Android--Activity在跳转时携带数据
- [Canvas绘图] 第31节 连通实验
- ADT开发中的一些优化设置:代码自动补全等
- BumpMapping [转]
- ZOJ 1372 Networking(Prim求最小生成树)
- ManyToOne凭空多了很多空记录,@OrderColumn的问题