#1014700 (C++23) No.2619 Sorted Nim

• 問題: No.2619 Sorted Nim
• ユーザー: t9unkubj
• 提出日時: 2024-10-01 00:52:19
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 25 ms / 2,000 ms
• コード長: 5,373 bytes
• コンパイル時間: 4,016 ms
• コンパイル使用メモリ: 279,532 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-01 00:52:29
• 合計ジャッジ時間: 9,666 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	20 ms; 5,248 KB
testcase_03	AC	23 ms; 5,248 KB
testcase_04	AC	19 ms; 5,248 KB
testcase_05	AC	18 ms; 5,248 KB
testcase_06	AC	23 ms; 5,248 KB
testcase_07	AC	18 ms; 5,248 KB
testcase_08	AC	23 ms; 5,248 KB
testcase_09	AC	1 ms; 5,248 KB
testcase_10	AC	24 ms; 5,248 KB
testcase_11	AC	21 ms; 5,248 KB
testcase_12	AC	20 ms; 5,248 KB
testcase_13	AC	1 ms; 5,248 KB
testcase_14	AC	20 ms; 5,248 KB
testcase_15	AC	18 ms; 5,248 KB
testcase_16	AC	20 ms; 5,248 KB
testcase_17	AC	21 ms; 5,248 KB
testcase_18	AC	20 ms; 5,248 KB
testcase_19	AC	17 ms; 5,248 KB
testcase_20	AC	17 ms; 5,248 KB
testcase_21	AC	22 ms; 5,248 KB
testcase_22	AC	18 ms; 5,248 KB
testcase_23	AC	20 ms; 5,248 KB
testcase_24	AC	20 ms; 5,248 KB
testcase_25	AC	20 ms; 5,248 KB
testcase_26	AC	19 ms; 5,248 KB
testcase_27	AC	16 ms; 5,248 KB
testcase_28	AC	21 ms; 5,248 KB
testcase_29	AC	25 ms; 5,248 KB
testcase_30	AC	19 ms; 5,248 KB
testcase_31	AC	2 ms; 5,248 KB
testcase_32	AC	17 ms; 5,248 KB
testcase_33	AC	19 ms; 5,248 KB
testcase_34	AC	17 ms; 5,248 KB
testcase_35	AC	21 ms; 5,248 KB
testcase_36	AC	21 ms; 5,248 KB
testcase_37	AC	1 ms; 5,248 KB
testcase_38	AC	17 ms; 5,248 KB
testcase_39	AC	20 ms; 5,248 KB
testcase_40	AC	18 ms; 5,248 KB
testcase_41	AC	18 ms; 5,248 KB
testcase_42	AC	17 ms; 5,248 KB
testcase_43	AC	20 ms; 5,248 KB
testcase_44	AC	19 ms; 5,248 KB
testcase_45	AC	20 ms; 5,248 KB
testcase_46	AC	19 ms; 5,248 KB
testcase_47	AC	18 ms; 5,248 KB
testcase_48	AC	2 ms; 5,248 KB
testcase_49	AC	18 ms; 5,248 KB
testcase_50	AC	17 ms; 5,248 KB
testcase_51	AC	19 ms; 5,248 KB
testcase_52	AC	1 ms; 5,248 KB
testcase_53	AC	22 ms; 5,248 KB
testcase_54	AC	17 ms; 5,248 KB
testcase_55	AC	21 ms; 5,248 KB
testcase_56	AC	22 ms; 5,248 KB
testcase_57	AC	21 ms; 5,248 KB
testcase_58	AC	20 ms; 5,248 KB
testcase_59	AC	18 ms; 5,248 KB
testcase_60	AC	17 ms; 5,248 KB
testcase_61	AC	18 ms; 5,248 KB

ソースコード

#ifdef t9unkubj
#include"template.h"
//#include"template_no_debug.h"
#else
#undef _GLIBCXX_DEBUG
#pragma GCC optimize("O3")
#define dbg(...) 199958
using namespace std;
#include<bits/stdc++.h>
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vvc<vc<T>>;
using vi=vc<int>;
using vvi=vc<vi>;
using vvvi=vc<vvi>;
using vl=vc<ll>;
using vvl=vc<vl>;
using vvvl=vc<vvl>;
template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)
#define drep(i,n) for(ll i=((n)-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define is insert
#define bg begin()
#define ed end()
void scan(int&a) { cin >> a; }
void scan(ll&a) { cin >> a; }
void scan(string&a) { cin >> a; }
void scan(char&a) { cin >> a; }
void scan(uint&a) { cin >> a; }
void scan(ull&a) { cin >> a; }
void scan(bool&a) { cin >> a; }
void scan(ld&a){ cin>> a;}
template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }
void read() {}
template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);
#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);
#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);
void print(int a) { cout << a; }
void print(ll a) { cout << a; }
void print(string a) { cout << a; }
void print(char a) { cout << a; }
void print(uint a) { cout << a; }
void print(bool a) { cout << a; }
void print(ull a) { cout << a; }
void print(double a) { cout << a; }
void print(ld a){ cout<< a; }
template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}
void PRT() { cout <<endl; return ; }
template<class T> void PRT(T a) { print(a); cout <<endl; return; }
template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }
template<class T,class F>
bool chmin(T &x, F y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template<class T, class F>
bool chmax(T &x, F y){
    if(x<y){
        x=y;
        return true;
    }
    return false;
}
void YesNo(bool b){
    cout<<(b?"Yes":"No")<<endl;
}
void Yes(){
    cout<<"Yes"<<endl;
}
void No(){
    cout<<"No"<<endl;
}
template<class T>
int popcount(T n){
    return __builtin_popcountll(n);
}
template<class T>
T sum(vc<T>&a){
    return accumulate(all(a),T(0));
}
template<class T>
T max(vc<T>&a){
    return *max_element(all(a));
}
template<class T>
T min(vc<T>&a){
    return *min_element(all(a));
}
template<class T>
void unique(vc<T>&a){
    a.erase(unique(all(a)),a.end());
}
vvi readgraph(int n,int m,int off = -1){
    vvi g(n);
    rep(i, m){
        int u,v;
        cin>>u>>v;
        u+=off,v+=off;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    return g;
}
vvi readtree(int n,int off=-1){
    return readgraph(n,n-1,off);
}
template<class T>
vc<T> presum(vc<T> &a){
    vc<T> ret(a.size()+1);
    rep(i,a.size())ret[i+1]=ret[i]+a[i];
    return ret;
}
template<class T, class F>
vc<T> &operator+=(vc<T> &a,F b){
    for (auto&v:a)v += b;
    return a;
}
template<class T, class F>
vc<T> &operator-=(vc<T>&a,F b){
    for (auto&v:a)v-=b;
    return a;
}
template<class T, class F>
vc<T> &operator*=(vc<T>&a,F b){
    for (auto&v:a)v*=b;
    return a;
}
#endif
double pass_time=0;
map<vi,int>ma;
int lab(vi a){
    int n=a.size();
    auto dfs=[&](auto&dfs,vi a)->int{
        if(ma.count(a))return ma[a];
        set<int>st;
        rep(i,n){
            int up=a[i];
            if(i)chmin(up,a[i]-a[i-1]);
            REP(j,1,up+1){
                auto b=a;
                b[i]-=j;
                st.is(dfs(dfs,b));
            }
        }
        for(int i=0;;i++){
            if(!st.count(i))return ma[a]=i;
        }
    };
    return dfs(dfs,a);
}
void solve(){
    /*int n=4;
    for(int i=1;i<=10;i++){
        for(int j=i;j<=10;j++){
            for(int k=j;k<=10;k++){
                auto res=lab({i,j,k});
                cout<<i<<" "<<j<<" "<<k<<" "<<((k-j)^i)<<" "<<res<<endl;
            }
        }
    }*/
    INT(n);
    VC(int,a,n);
    int res=0;
    for(int i=n-1;i>0;i-=2){
        res^=(a[i]-a[i-1]);
    }
    if(n%2)res^=a[0];
    cout<<(res?"First":"Second");
}
signed main(){
#ifdef t9unkubj
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
    cin.tie(0)->sync_with_stdio(0);
    pass_time=clock();
    int t=1;
    //cin>>t;
    while(t--)solve();
    pass_time=clock()-pass_time;
    dbg(pass_time/CLOCKS_PER_SEC);
}