Submission #40819016

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
    int x = 0; bool op = 0;
    char c = getchar();
    while(!isdigit(c))op |= (c == '-'), c = getchar();
    while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return op ? -x : x;
}
const int N = 1e5 + 10;
int n;
int a[N];
int main() { 
    n = read();
    for(int i = 1; i <= n; i++)a[i] = read();
    sort(a + 1, a + 1 + n);
    int dif = 0; set<int> s;
    s.insert((a[1] & 1) ? -1 : 0);
    for(int i = 2; i <= n; i++) {
        if((a[i] & 1) == (a[i - 1] & 1)) {
            if(s.count(a[i - 1] + dif))s.erase(a[i - 1] + dif), dif++;
            else dif++, s.insert(a[i - 1] + dif);
        }
        else dif++;
    }
    int now = *(--s.upper_bound(dif));
    puts((now & 1) == (dif & 1) ? "First" : "Second");
    return 0;
}

Submission Info

Judge Result