Submission #2227159
Source Code Expand
#include <bits/stdc++.h> using namespace std; using pii = pair<int,int>; using ll = long long; #define rep(i, j) for(int i=0; i < (int)(j); i++) #define repeat(i, j, k) for(int i = (j); i < (int)(k); i++) #define all(v) v.begin(),v.end() #define debug(x) cerr << #x << " : " << x << endl template<class T> bool set_min(T &a, const T &b) { return a > b ? a = b, true : false; } template<class T> bool set_max(T &a, const T &b) { return a < b ? a = b, true : false; } // vector template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; } template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << "\t" << t; return os << endl; } template<typename T> T gcd(T a,T b){ T c=a,d=b,r; do{r=c%d;c=d;d=r;}while(r); return c; } bool does_win_first(vector<int> &A) { ll sum = accumulate(all(A), 0ll) - A.size(); if(sum % 2 == 1) return true; vector<int> odd_indices; rep(i, A.size()) if(A[i] % 2) odd_indices.push_back(i); if(odd_indices.size() == 1 and A[odd_indices[0]] > 1) { A[odd_indices[0]]--; ll g = accumulate(all(A), 1ll, gcd<ll>); rep(i, A.size()) A[i] /= g; return not does_win_first(A); } return false; } int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector<int> A(N); cin >> A; cout << (does_win_first(A) ? "First" : "Second") << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrementing |
User | cormoran |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1537 Byte |
Status | WA |
Exec Time | 14 ms |
Memory | 1276 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 11 ms | 640 KB |
in10.txt | AC | 11 ms | 640 KB |
in11.txt | WA | 14 ms | 640 KB |
in12.txt | AC | 11 ms | 640 KB |
in13.txt | AC | 14 ms | 640 KB |
in14.txt | AC | 14 ms | 640 KB |
in15.txt | WA | 14 ms | 640 KB |
in16.txt | WA | 14 ms | 640 KB |
in17.txt | WA | 14 ms | 640 KB |
in18.txt | AC | 14 ms | 640 KB |
in19.txt | AC | 13 ms | 640 KB |
in2.txt | AC | 11 ms | 640 KB |
in20.txt | AC | 13 ms | 640 KB |
in21.txt | WA | 14 ms | 640 KB |
in22.txt | WA | 14 ms | 640 KB |
in23.txt | AC | 14 ms | 640 KB |
in24.txt | WA | 14 ms | 640 KB |
in25.txt | AC | 14 ms | 640 KB |
in26.txt | AC | 14 ms | 640 KB |
in27.txt | WA | 14 ms | 640 KB |
in28.txt | AC | 14 ms | 640 KB |
in29.txt | AC | 14 ms | 640 KB |
in3.txt | AC | 11 ms | 640 KB |
in30.txt | AC | 14 ms | 640 KB |
in31.txt | AC | 11 ms | 896 KB |
in32.txt | AC | 11 ms | 1024 KB |
in33.txt | AC | 14 ms | 640 KB |
in34.txt | AC | 14 ms | 640 KB |
in35.txt | AC | 14 ms | 640 KB |
in36.txt | AC | 1 ms | 256 KB |
in37.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 12 ms | 640 KB |
in5.txt | AC | 12 ms | 1276 KB |
in6.txt | AC | 11 ms | 1024 KB |
in7.txt | AC | 11 ms | 640 KB |
in8.txt | AC | 11 ms | 640 KB |
in9.txt | AC | 11 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |