Submission #1722128
Source Code Expand
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define fi first #define se second #define mp make_pair #define pb push_back #define fbo find_by_order #define ook order_of_key typedef long long ll; typedef pair<ll,ll> ii; typedef vector<int> vi; typedef long double ld; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; typedef set<int>::iterator sit; typedef map<int,int>::iterator mit; typedef vector<int>::iterator vit; void p1() { cout<<"First\n"; exit(0); } void p2() { cout<<"Second\n"; exit(0); } int a[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; int sum = 0; for(int i = 0; i < n; i++) { cin>>a[i]; sum+=(a[i]&1); sum%=2; } int n2 = n%2; if(n==1) { if(sum==n2) p2(); else p1(); return 0; } if(sum!=n2) { p1(); return 0; } int turn = 1; while(1) { int cntodd = 0; int ex1 = 0; int sm = 0; int oddidx=0; for(int i = 0; i < n; i++) { if(a[i]&1) { cntodd++; oddidx=i; } if(a[i]==1) ex1++; sm+=(a[i]&1); sm%=2; } if(sm!=n2&&!turn) { p2(); return 0; } if(sm!=n2&&turn) { p1(); return 0; } if(ex1>0||cntodd>1) { if(sm!=n2) { if(turn) p1(); else p2(); } else { if(!turn) p1(); else p2(); } return 0; } a[oddidx]--; int gcd = a[0]; for(int i = 0; i < n; i++) { gcd=__gcd(a[i],gcd); } assert(gcd>1); for(int i = 0; i < n; i++) { a[i]/=gcd; } turn^=1; } }
Submission Info
Submission Time | |
---|---|
Task | D - Decrementing |
User | vjudge2 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1616 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 640 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 | 11 ms | 640 KB |
in10.txt | AC | 11 ms | 640 KB |
in11.txt | AC | 17 ms | 640 KB |
in12.txt | AC | 11 ms | 640 KB |
in13.txt | AC | 15 ms | 640 KB |
in14.txt | AC | 26 ms | 640 KB |
in15.txt | AC | 14 ms | 640 KB |
in16.txt | AC | 25 ms | 640 KB |
in17.txt | AC | 14 ms | 640 KB |
in18.txt | AC | 28 ms | 640 KB |
in19.txt | AC | 16 ms | 640 KB |
in2.txt | AC | 11 ms | 640 KB |
in20.txt | AC | 25 ms | 640 KB |
in21.txt | AC | 18 ms | 640 KB |
in22.txt | AC | 18 ms | 640 KB |
in23.txt | AC | 17 ms | 640 KB |
in24.txt | AC | 18 ms | 640 KB |
in25.txt | AC | 16 ms | 640 KB |
in26.txt | AC | 17 ms | 640 KB |
in27.txt | AC | 17 ms | 640 KB |
in28.txt | AC | 18 ms | 640 KB |
in29.txt | AC | 16 ms | 640 KB |
in3.txt | AC | 11 ms | 640 KB |
in30.txt | AC | 17 ms | 640 KB |
in31.txt | AC | 11 ms | 640 KB |
in32.txt | AC | 11 ms | 640 KB |
in33.txt | AC | 17 ms | 640 KB |
in34.txt | AC | 18 ms | 640 KB |
in35.txt | AC | 17 ms | 640 KB |
in36.txt | AC | 1 ms | 256 KB |
in37.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 11 ms | 640 KB |
in5.txt | AC | 11 ms | 640 KB |
in6.txt | AC | 11 ms | 640 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 |