Submission #2145572


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <map>
#include <iterator>
#include <functional>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <fstream>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <list>
#include <sstream>
#include <cstring>
#include <stdio.h>
#include <complex>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse4")

typedef long double LD;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LD, LD> PDD;
typedef pair<LL, int> PLL;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<char> VCH;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef vector<VS> VSS;
typedef vector<VI> VVI;
typedef vector<VLL> VVLL;
typedef vector<VCH> VVCH;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<PDD> VPDD;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define next fake_next
#define prev fake_prev
#define left fake_left
#define right fake_right

#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); --i)
#define REP(i, t) FOR(i,0,t)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))

const LD PI = acos(-1.0);
const LD EPS = 1e-4;
const LL INF = 1e7 - 1;
const LL mod = 1000000007;
const LL LINF = 1e18 + 10;
const int MAXN = 100001;
const int MAXK = 101;

LL gcd(LL x, LL y)
{
	if (!y)
		return x;
	return gcd(y, x%y);
}

LL n;
VLL a;

string solve()
{
	LL s = 0;
	FOR(i, 0, n)
		s += a[i];

	bool one = 0;
	FOR(i, 0, n)
		if (a[i] == 1)
			one = 1;

	if (one || n < 3 || (n % 2 == 0))
	{
		if ((s - n) & 1)
			return "First";
		else
			return "Second";
	}

	if ((s - n) & 1)
		return "First";

	int cnt_odd = 0;
	FOR(i, 0, n)
		cnt_odd += (a[i] & 1);

	if (cnt_odd > 1)
		return  "Second";

	FOR(i, 0, n)
		if (a[i] & 1)
			--a[i];

	LL k = a[0];
	FOR(i, 1, n)
		k = gcd(a[i], k);

	LL su = 0;
	FOR(i, 0, n)
		su += a[i] / k;

	if (su & 1)
		return  "First";
	else
		return  "Second";
}

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	//freopen("In.txt", "r", stdin);
	cin >> n;
	a.resize(n);
	FOR(i, 0, n)
		cin >> a[i];

	cout << solve();
	cin >> n;
	return 0;
}

Submission Info

Submission Time
Task D - Decrementing
User vjudge2
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2382 Byte
Status WA
Exec Time 14 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
WA × 1
AC × 27
WA × 16
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 11 ms 1024 KB
in10.txt AC 11 ms 1024 KB
in11.txt AC 13 ms 1024 KB
in12.txt AC 11 ms 1024 KB
in13.txt WA 13 ms 1024 KB
in14.txt WA 13 ms 1024 KB
in15.txt AC 13 ms 1024 KB
in16.txt AC 13 ms 1024 KB
in17.txt AC 13 ms 1024 KB
in18.txt WA 13 ms 1024 KB
in19.txt WA 12 ms 1024 KB
in2.txt AC 11 ms 1024 KB
in20.txt WA 12 ms 1024 KB
in21.txt AC 13 ms 1024 KB
in22.txt AC 13 ms 1024 KB
in23.txt WA 13 ms 1024 KB
in24.txt AC 13 ms 1024 KB
in25.txt WA 13 ms 1024 KB
in26.txt WA 13 ms 1024 KB
in27.txt AC 13 ms 1024 KB
in28.txt WA 13 ms 1024 KB
in29.txt WA 13 ms 1024 KB
in3.txt AC 11 ms 1024 KB
in30.txt WA 13 ms 1024 KB
in31.txt AC 11 ms 1024 KB
in32.txt AC 11 ms 1024 KB
in33.txt WA 14 ms 1024 KB
in34.txt WA 13 ms 1024 KB
in35.txt WA 13 ms 1024 KB
in36.txt AC 1 ms 256 KB
in37.txt AC 1 ms 256 KB
in4.txt AC 11 ms 1024 KB
in5.txt AC 11 ms 1024 KB
in6.txt AC 11 ms 1024 KB
in7.txt AC 11 ms 1024 KB
in8.txt AC 11 ms 1024 KB
in9.txt AC 11 ms 1024 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt WA 1 ms 256 KB