CodeForces 658A Bear and Reverse Radewoosh

Bear and Reverse Radewoosh

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

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 p_i and it takes exactly t_i minutes to solve it. Problems are sorted by difficulty — it's guaranteed that p_i < p_i + 1 and t_i < t_i + 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,  p_i - c·x) points.

Limak is going to solve problems in order 1, 2, ..., n (sorted increasingly by p_i). Radewoosh is going to solve them in order n, n - 1, ..., 1 (sorted decreasingly by p_i). 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 t_i. 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 p₁, p₂, ..., p_n (1 ≤ p_i ≤ 1000, p_i < p_i + 1) — initial scores.

The third line contains n integers t₁, t₂, ..., t_n (1 ≤ t_i ≤ 1000, t_i < t_i + 1) where t_i denotes the number of minutes one needs to solve thei-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.

Input

  
  

   
   3 2
  
  
  
  

   
   50 85 250
  
  
  
  

   
   10 15 25
  
  

Output

Limak

Input

  
  

   
   3 6
  
  
  
  

   
   50 85 250
  
  
  
  

   
   10 15 25
  
  

Output

Radewoosh

Input

  
  

   
   8 1
  
  
  
  

   
   10 20 30 40 50 60 70 80
  
  
  
  

   
   8 10 58 63 71 72 75 76
  
  

Output

Tie

题解：这个题没啥好说的，啥思想都没用到，直接上代码

<span style="font-family:SimSun;font-size:18px;">#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[60],b[60],c[60],d[60];
int main()
{
	int n,s;
	while(scanf("%d%d",&n,&s)!=EOF)
	{
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			c[n-1-i]=a[i];
		}
		for(int i=0;i<n;i++)
		{
			scanf("%d",&b[i]);
			d[n-1-i]=b[i];
		}
		int s1=0,s2=0;
		for(int i=1;i<n;i++)
		{
			b[i]+=b[i-1];
			d[i]+=d[i-1];
		}
		for(int i=0;i<n;i++)
		{
			s1+=max(0,a[i]-s*b[i]);
			s2+=max(0,c[i]-s*d[i]);
		}
		if(s1>s2)
			printf("Limak\n");
		else if(s2>s1)
			printf("Radewoosh\n");
		else
			printf("Tie\n");
	}
	return 0;
}
</span>