Submission #1513072


Source Code Expand

//by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define bged(v) (v).begin(),(v).end()
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
typedef long long ll;
const int Imx=2147483647;
const ll Lbig=2e18;
const int mod=1e9+7;
//My i/o stream
struct fastio
{
	char s[100000];
	int it,len;
	fastio(){it=len=0;}
	inline char get()
	{
		if(it<len)return s[it++];it=0;
		len=fread(s,1,100000,stdin);
		if(len==0)return EOF;else return s[it++];
	}
	bool notend()
	{
		char c=get();
		while(c==' '||c=='\n')c=get();
		if(it>0)it--;
		return c!=EOF;
	}
}_buff;
#define geti(x) x=getnum()
#define getii(x,y) geti(x),geti(y)
#define getiii(x,y,z) getii(x,y),geti(z)
#define puti(x) putnum(x),putchar(' ')
#define putii(x,y) puti(x),puti(y)
#define putiii(x,y,z) putii(x,y),puti(z)
#define putsi(x) putnum(x),putchar('\n')
#define putsii(x,y) puti(x),putsi(y)
#define putsiii(x,y,z) putii(x,y),putsi(z)
inline ll getnum()
{
	ll r=0;bool ng=0;char c;c=_buff.get();
	while(c!='-'&&(c<'0'||c>'9'))c=_buff.get();
	if(c=='-')ng=1,c=_buff.get();
	while(c>='0'&&c<='9')r=r*10+c-'0',c=_buff.get();
	return ng?-r:r;
}
template<class T> inline void putnum(T x)
{
	if(x<0)putchar('-'),x=-x;
	register short a[20]={},sz=0;
	while(x)a[sz++]=x%10,x/=10;
	if(sz==0)putchar('0');
	for(int i=sz-1;i>=0;i--)putchar('0'+a[i]);
}
inline char getreal(){char c=_buff.get();while(c==' '||c=='\n')c=_buff.get();return c;}
int n,a[100111];
bool solve()
{
	ll sum=0;
	bool has1=0;
	int cnt1=0;
	for(int i=1;i<=n;i++)
	{
		sum+=a[i]-1;
		if(a[i]==1)has1=1;
		if(a[i]&1)cnt1++;
	}
	if(has1)return sum%2;
	if((n-cnt1)%2==1)return 1;
	if(cnt1==1)
	{
		int g=0;
		for(int i=1;i<=n;i++)
		{
			if(a[i]&1)a[i]--;
			g=__gcd(g,a[i]);
		}
		for(int i=1;i<=n;i++)a[i]/=g;
		return solve()^1;
	}
	return 0;
}
int main()
{
	geti(n);
	for(int i=1;i<=n;i++)
	{
		geti(a[i]);
	}
	if(solve())puts("First");else puts("Second");
	return 0;
}

Submission Info

Submission Time
Task D - Decrementing
User fizzydavid
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2096 Byte
Status AC
Exec Time 33 ms
Memory 896 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 43
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 4 ms 768 KB
in10.txt AC 3 ms 768 KB
in11.txt AC 13 ms 768 KB
in12.txt AC 4 ms 768 KB
in13.txt AC 10 ms 768 KB
in14.txt AC 28 ms 896 KB
in15.txt AC 9 ms 768 KB
in16.txt AC 27 ms 768 KB
in17.txt AC 8 ms 768 KB
in18.txt AC 33 ms 768 KB
in19.txt AC 13 ms 640 KB
in2.txt AC 3 ms 768 KB
in20.txt AC 30 ms 768 KB
in21.txt AC 14 ms 768 KB
in22.txt AC 12 ms 768 KB
in23.txt AC 11 ms 768 KB
in24.txt AC 14 ms 768 KB
in25.txt AC 12 ms 768 KB
in26.txt AC 13 ms 768 KB
in27.txt AC 13 ms 768 KB
in28.txt AC 14 ms 768 KB
in29.txt AC 12 ms 768 KB
in3.txt AC 4 ms 768 KB
in30.txt AC 11 ms 768 KB
in31.txt AC 3 ms 768 KB
in32.txt AC 4 ms 768 KB
in33.txt AC 14 ms 768 KB
in34.txt AC 16 ms 768 KB
in35.txt AC 14 ms 768 KB
in36.txt AC 1 ms 256 KB
in37.txt AC 1 ms 256 KB
in4.txt AC 3 ms 768 KB
in5.txt AC 3 ms 768 KB
in6.txt AC 4 ms 768 KB
in7.txt AC 4 ms 768 KB
in8.txt AC 4 ms 768 KB
in9.txt AC 4 ms 768 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB