-
Notifications
You must be signed in to change notification settings - Fork 0
/
A - Bear and Reverse Radewoosh.cpp
107 lines (85 loc) · 1.89 KB
/
A - Bear and Reverse Radewoosh.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
/*
RAJAT SINGH
VIT VELLORE
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
//#define max 706000
#define gc getchar_unlocked
#define pc putchar_unlocked
//inline void get(int *p){register int n=0,sign=1,a=gc();while(a<'0'||a>'9'){ if(a=='-'){sign=-1;a=gc();break;} a=gc();}while(a>='0' && a<='9'){n=(n<<1)+(n<<3)+a-'0';a=gc();}*p=n*sign;}
//inline void put(int n){char d[10];int i=0;if(n<0){pc('-');n=-n;}do{d[i++]=n%10+'0';n=n/10;}while(n);while(i)pc(d[--i]);pc('\n');}
#define sc(a) scanf("%d",&a)
#define p(a) printf("%d\n",a)
#define l(i,a) for(int i=0;i<a;i++)
#define re(j,a,b) for(int j=a;j<=b;j++)
# define ll long long
#define modu 1000000007
ll modular_pow(ll int base, ll int exponent)
{
if(exponent==0)
return 1;
else if(exponent%2==0){
ll int res=modular_pow(base,exponent/2);
return (res*res );
}
else{
return (modular_pow(base,exponent-1) * base);
}
}
int gcd(int a,int b){
if(b==0)
return a;//gcd
else return gcd(b,a%b);
}
bool chek(int x){
return (x&&!(x&(x-1)));// power of 2
}
int onebits(int n){
return __builtin_popcount(n);//count number od set bits in a number
}
ll max(ll x, ll y){
if(x>=y) return x;
else return y;
}
vector< map< int , int > >r;
vector< map< int , int > >c;
int a[2000][2000];
int main() {
// freopen("inp.txt","r",stdin);
//string s= "rajat";
int n,m;
sc(n);
sc(m);
vector< int >v;
vector< int >vv;
l(i,n){
int x;
sc(x);
v.push_back(x);
}
l(i,n){
int x;
sc(x);
vv.push_back(x);
}
int ans1=0;
int ans2=0;
int time=0;
l(i,n){
if(i==0) time=vv[i];
else time+=vv[i];
ans1+=max(0,v[i]-time*m);
}
for(int i=n-1;i>=0;i--){
if(i==n-1) time=vv[i];
else time+=vv[i];
ans2+=max(0,v[i]-time*m);
}
if(ans1> ans2) puts("Limak");
else{
if(ans1== ans2) puts("Tie");
else puts("Radewoosh");
}
return 0;}