0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 18:31:59 +00:00

B - Circle Game

https://codeforces.com/contest/1695/submission/161078137
This commit is contained in:
Baoshuo Ren 2022-06-18 23:17:05 +08:00
parent 6d7808dc2c
commit c670d61a1d
Signed by: baoshuo
GPG Key ID: 00CB9680AB29F51A

57
Codeforces/1695/B/B.cpp Normal file
View File

@ -0,0 +1,57 @@
#include <iostream>
#include <limits>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 2e5 + 10;
int t, n, a[N];
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> t;
while (t--) {
cin >> n;
int p = n << 1;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (!a[i]) p = std::min(p, i);
}
if (p != (n << 1)) {
cout << (p & 1 ? "Joe" : "Mike") << endl;
} else if (n & 1) {
cout << "Mike" << endl;
} else {
int x = std::numeric_limits<int>::max(),
y = std::numeric_limits<int>::max();
int p1 = n, p2 = n;
for (int i = 1; i <= n; i++) {
if (i & 1) {
x = std::min(x, a[i]);
} else {
y = std::min(y, a[i]);
}
}
for (int i = 1; i <= n; i++) {
if ((i & 1) && x == a[i])
p1 = std::min(p1, i);
if (!(i & 1) && y == a[i])
p2 = std::min(p2, i);
}
cout << (x < y || x == y && p1 < p2 ? "Joe" : "Mike") << endl;
}
}
return 0;
}