-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB-Apple in boxes
More file actions
69 lines (59 loc) · 1.88 KB
/
B-Apple in boxes
File metadata and controls
69 lines (59 loc) · 1.88 KB
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
/////////////// PRANTA KUMER PANDIT ///////////////
// Test Case Based Template //
// //
// BANGLADESH UNIVERSITY OF BUSINESS AND TECHNOLOGY (BUBT) //
// INTAKE 52 //
// DEPARTMENT OF CSE //
// //
//||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||//
// WELCOME TO ISHAN'S PARADISE //
// (-.-) Training to be a Secret Tool of Next ICPC (-.-) //
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define all(x) (x).begin(), (x).end()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) * (b)) / gcd(a,b)
#define optimize() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void alada(vector<ll>& a, int n) {
for (int i = 0; i < n; ++i) cin >> a[i];
}
void ishan() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
alada(a, n);
ll mxele = *max_element(all(a));
ll mnele = *min_element(all(a));
ll sc = 0, cc = 0;
for (ll ve : a) {
sc += ve;
if (ve == mxele) cc++;
}
if (mxele - mnele > k + 1) {
cout << "Jerry\n";
return;
}
if (mxele - mnele <= k) {
cout << ((sc % 2 == 1) ? "Tom\n" : "Jerry\n");
}
else {
if (cc == 1 && (sc % 2 == 1)) {
cout << "Tom\n";
} else {
cout << "Jerry\n";
}
}
}
int main() {
optimize();
int lol;
cin >> lol;
while (lol--) {
ishan();
}
return 0;
}
// THANK YOU //