Submission #826145

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
const double pi=acos(-1.0);
const double eps=1e-9;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair <int,int>
#define piii pair < pii, int>
#define pll pair <long long , long long>
#define plll pair <pll , long long>
#define hjsagjfasjg y1
typedef long long ll;

const int N=(int)1e5+5;
int n,a[N],t;

int main()
{
	ios:: sync_with_stdio(false);
	cin >> n;
	for(int i=0;i<n;i++)
		cin >> a[i];
	sort(a,a+n);
	t=-1;
	for(int i=1;i<n;i++)
		if(a[i]!=a[i-1])
		{
			t=i;
			break;
		}
	if(t==-1)
	{
		if((n+a[0])%2==0)
			cout << "Second";else cout << "First";
		return 0;
	}
	//for(int i=0;i<t;i++)
	//	if((i+1+a[0])%2==0) win[i]=false;else win[i]=true;
	/*for(int i=t;i<n;i++)
	{
		if(!win[i-1])win[i]=true;
	}*/
	if((n%2+a[0]%2+t%2)%2==1)
		cout << "Second";else cout << "First";
	return 0;
}

Submission Info

Judge Result