#670627 (C++17) No.1569 Nixoracci's Number

• 問題: No.1569 Nixoracci's Number
• ユーザー: tokusakurai
• 提出日時: 2021-06-27 13:21:34
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 12 ms / 2,000 ms
• コード長: 4,569 bytes
• コンパイル時間: 2,131 ms
• コンパイル使用メモリ: 209,172 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-27 13:24:03
• 合計ジャッジ時間: 3,022 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	10 ms; 6,944 KB
testcase_05	AC	3 ms; 6,944 KB
testcase_06	AC	12 ms; 6,940 KB
testcase_07	AC	2 ms; 6,944 KB
testcase_08	AC	4 ms; 6,944 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	AC	3 ms; 6,940 KB
testcase_11	AC	5 ms; 6,940 KB
testcase_12	AC	7 ms; 6,940 KB
testcase_13	AC	8 ms; 6,940 KB
testcase_14	AC	3 ms; 6,940 KB
testcase_15	AC	10 ms; 6,940 KB
testcase_16	AC	4 ms; 6,940 KB
testcase_17	AC	4 ms; 6,940 KB
testcase_18	AC	5 ms; 6,940 KB
testcase_19	AC	3 ms; 6,940 KB
testcase_20	AC	11 ms; 6,940 KB
testcase_21	AC	7 ms; 6,944 KB
testcase_22	AC	4 ms; 6,944 KB
testcase_23	AC	10 ms; 6,940 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 2;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template<int mod>
struct Mod_Int{
    int x;

    Mod_Int() : x(0) {}

    Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p){
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p){
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += Mod_Int(1);}

    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= Mod_Int(1);}

    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int inverse() const{
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }

    Mod_Int pow(long long k) const{
        Mod_Int now = *this, ret = 1;
        for(; k > 0; k >>= 1, now *= now){
            if(k&1) ret *= now;
        }
        return ret;
    }

    friend ostream &operator << (ostream &os, const Mod_Int &p){
        return os << p.x;
    }

    friend istream &operator >> (istream &is, Mod_Int &p){
        long long a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

template<typename T>
struct Kitamasa{
    //f(x):=x^N-c[N-1]*x^(N-1)-・・・-c[1]*x-c[0]
    //a[k]=c[0]*a[k-N]+c[1]*a[k-N+1]+・・・+c[N-1]*a[k-1]
    const vector<T> a, c;

    Kitamasa(const vector<T> &a, const vector<T> &c) : a(a), c(c) {}

    vector<T> mul(const vector<T> &p, const vector<T> &q) const{ //p(x)*q(x)をf(x)で割った余り
        assert(p.size() == q.size() && p.size() >= 2);
        int n = p.size();
        vector<T> ret(2*n-1, 0);
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++) ret[i+j] += p[i]*q[j];
        }
        for(int i = 2*n-2; i >= n; i--){
            for(int j = 0; j < n; j++){
                ret[i-n+j] += ret[i]*c[j];
            }
        }
        ret.resize(n);
        return ret;
    }

    vector<T> pow(vector<T> p, long long k) const{ //p(x)^kをf(x)で割った余り
        int n = p.size();
        vector<T> ret(n, 0);
        ret[0] = 1;
        while(k){
            if(k&1) ret = mul(ret, p);
            p = mul(p, p), k >>= 1;
        }
        return ret;
    }

    T operator [] (int k) const{ //a[k](0-indexed)
        int n = a.size();
        vector<T> x(n, 0);
        x[1] = 1, x = pow(x, k);
        T ret = 0;
        for(int i = 0; i < n; i++) ret += x[i]*a[i];
        return ret;
    }
};

int main(){
    int N; ll K; cin >> N >> K; K--;

    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    vector<mint> c(N, 1);

    vector<mint> p(N, 0);
    p[1] = 1;

    Kitamasa<mint> a(c, c);
    vector<mint> x = a.pow(p, K);

    ll ans = 0;
    rep(i, N){
        ans ^= A[i]*(x[i].x);
    }

    cout << ans << '\n';
}