Submission #1499281
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <numeric> #define repeat(i,n) for (int i = 0; (i) < int(n); ++(i)) #define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x) using ll = long long; using namespace std; int gcd(int a, int b) { while (a) { b %= a; swap(a, b); } return b; } bool solve(int n, vector<int> & a) { ll sum = whole(accumulate, a, 0ll); bool is_first = (sum - n) % 2; int even = whole(count_if, a, [&](int ai) { return ai % 2 == 0; }); auto odd = whole(find_if, a, [&](int ai) { return ai % 2 == 1; }); if (not is_first and even == n-1 and *odd != 1) { -- (*odd); int d = a[0]; repeat (i,n) d = gcd(d, a[i]); repeat (i,n) a[i] /= d; return not solve(n, a); } else { return is_first; } } int main() { int n; cin >> n; vector<int> a(n); repeat (i,n) cin >> a[i]; cout << (solve(n, a) ? "First" : "Second") << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrementing |
User | kimiyuki |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1032 Byte |
Status | AC |
Exec Time | 58 ms |
Memory | 768 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
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 | 40 ms | 640 KB |
in10.txt | AC | 40 ms | 640 KB |
in11.txt | AC | 46 ms | 640 KB |
in12.txt | AC | 40 ms | 640 KB |
in13.txt | AC | 44 ms | 640 KB |
in14.txt | AC | 55 ms | 640 KB |
in15.txt | AC | 43 ms | 640 KB |
in16.txt | AC | 54 ms | 640 KB |
in17.txt | AC | 43 ms | 640 KB |
in18.txt | AC | 58 ms | 640 KB |
in19.txt | AC | 42 ms | 640 KB |
in2.txt | AC | 40 ms | 640 KB |
in20.txt | AC | 53 ms | 640 KB |
in21.txt | AC | 48 ms | 640 KB |
in22.txt | AC | 48 ms | 640 KB |
in23.txt | AC | 47 ms | 640 KB |
in24.txt | AC | 48 ms | 640 KB |
in25.txt | AC | 44 ms | 640 KB |
in26.txt | AC | 47 ms | 640 KB |
in27.txt | AC | 45 ms | 640 KB |
in28.txt | AC | 48 ms | 640 KB |
in29.txt | AC | 44 ms | 640 KB |
in3.txt | AC | 40 ms | 640 KB |
in30.txt | AC | 47 ms | 640 KB |
in31.txt | AC | 40 ms | 768 KB |
in32.txt | AC | 40 ms | 640 KB |
in33.txt | AC | 45 ms | 640 KB |
in34.txt | AC | 48 ms | 640 KB |
in35.txt | AC | 46 ms | 640 KB |
in36.txt | AC | 1 ms | 256 KB |
in37.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 40 ms | 640 KB |
in5.txt | AC | 40 ms | 640 KB |
in6.txt | AC | 40 ms | 640 KB |
in7.txt | AC | 41 ms | 640 KB |
in8.txt | AC | 40 ms | 640 KB |
in9.txt | AC | 40 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |