結果

問題 No.1500 Super Knight
ユーザー snrnsidysnrnsidy
提出日時 2021-10-28 04:28:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 351 ms / 2,000 ms
コード長 4,925 bytes
コンパイル時間 2,637 ms
コンパイル使用メモリ 220,600 KB
実行使用メモリ 145,920 KB
最終ジャッジ日時 2024-10-07 07:51:51
合計ジャッジ時間 14,609 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 351 ms
145,792 KB
testcase_01 AC 297 ms
145,792 KB
testcase_02 AC 322 ms
145,816 KB
testcase_03 AC 297 ms
145,612 KB
testcase_04 AC 297 ms
145,588 KB
testcase_05 AC 297 ms
145,864 KB
testcase_06 AC 297 ms
145,664 KB
testcase_07 AC 298 ms
145,736 KB
testcase_08 AC 297 ms
145,748 KB
testcase_09 AC 297 ms
145,920 KB
testcase_10 AC 297 ms
145,664 KB
testcase_11 AC 296 ms
145,716 KB
testcase_12 AC 297 ms
145,664 KB
testcase_13 AC 296 ms
145,696 KB
testcase_14 AC 296 ms
145,792 KB
testcase_15 AC 298 ms
145,596 KB
testcase_16 AC 296 ms
145,588 KB
testcase_17 AC 296 ms
145,608 KB
testcase_18 AC 297 ms
145,792 KB
testcase_19 AC 296 ms
145,580 KB
testcase_20 AC 297 ms
145,792 KB
testcase_21 AC 299 ms
145,604 KB
testcase_22 AC 297 ms
145,792 KB
testcase_23 AC 297 ms
145,792 KB
testcase_24 AC 298 ms
145,664 KB
testcase_25 AC 297 ms
145,592 KB
testcase_26 AC 297 ms
145,660 KB
testcase_27 AC 296 ms
145,664 KB
testcase_28 AC 296 ms
145,664 KB
testcase_29 AC 297 ms
145,696 KB
testcase_30 AC 298 ms
145,776 KB
testcase_31 AC 297 ms
145,724 KB
testcase_32 AC 296 ms
145,588 KB
testcase_33 AC 300 ms
145,652 KB
testcase_34 AC 296 ms
145,612 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'std::vector<int> berlekamp_massey(std::vector<int>)':
main.cpp:32:36: warning: 'ld' may be used uninitialized [-Wmaybe-uninitialized]
   32 |         lint k = -(x[i] - t) * ipow(ld, mod - 2) % mod;
      |                                ~~~~^~~~~~~~~~~~~
main.cpp:19:13: note: 'ld' was declared here
   19 |     int lf, ld;
      |             ^~
main.cpp:33:24: warning: 'lf' may be used uninitialized [-Wmaybe-uninitialized]
   33 |         vector<int> c(i-lf-1);
      |                       ~^~~
main.cpp:19:9: note: 'lf' was declared here
   19 |     int lf, ld;
      |         ^~

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

const long long int mod = 1e9 + 7;
const long long int MOD = 1e9 + 7;
using lint = long long;
lint ipow(lint x, lint p){
    lint ret = 1, piv = x;
    while(p){
        if(p & 1) ret = ret * piv % mod;
        piv = piv * piv % mod;
        p >>= 1;
    }
    return ret;
}
vector<int> berlekamp_massey(vector<int> x){
    vector<int> ls, cur;
    int lf, ld;
    for(int i=0; i<x.size(); i++){
        lint t = 0;
        for(int j=0; j<cur.size(); j++){
            t = (t + 1ll * x[i-j-1] * cur[j]) % mod;
        }
        if((t - x[i]) % mod == 0) continue;
        if(cur.empty()){
            cur.resize(i+1);
            lf = i;
            ld = (t - x[i]) % mod;
            continue;
        }
        lint k = -(x[i] - t) * ipow(ld, mod - 2) % mod;
        vector<int> c(i-lf-1);
        c.push_back(k);
        for(auto &j : ls) c.push_back(-j * k % mod);
        if(c.size() < cur.size()) c.resize(cur.size());
        for(int j=0; j<cur.size(); j++){
            c[j] = (c[j] + cur[j]) % mod;
        }
        if(i-lf+(int)ls.size()>=(int)cur.size()){
            tie(ls, lf, ld) = make_tuple(cur, i, (t - x[i]) % mod);
        }
        cur = c;
    }
    for(auto &i : cur) i = (i % mod + mod) % mod;
    return cur;
}
int get_nth(vector<int> rec, vector<int> dp, lint n){
    int m = rec.size();
    vector<int> s(m), t(m);
    s[0] = 1;
    if(m != 1) t[1] = 1;
    else t[0] = rec[0];
    auto mul = [&rec](vector<int> v, vector<int> w){
        int m = v.size();
        vector<int> t(2 * m);
        for(int j=0; j<m; j++){
            for(int k=0; k<m; k++){
                t[j+k] += 1ll * v[j] * w[k] % mod;
                if(t[j+k] >= mod) t[j+k] -= mod;
            }
        }
        for(int j=2*m-1; j>=m; j--){
            for(int k=1; k<=m; k++){
                t[j-k] += 1ll * t[j] * rec[k-1] % mod;
                if(t[j-k] >= mod) t[j-k] -= mod;
            }
        }
        t.resize(m);
        return t;
    };
    while(n){
        if(n & 1) s = mul(s, t);
        t = mul(t, t);
        n >>= 1;
    }
    lint ret = 0;
    for(int i=0; i<m; i++) ret += 1ll * s[i] * dp[i] % mod;
    return ret % mod;
}
int guess_nth_term(vector<int> x, lint n){
    if(n < x.size()) return x[n];
    vector<int> v = berlekamp_massey(x);
    if(v.empty()) return 0;
    return get_nth(v, x, n);
}
struct elem{int x, y, v;}; // A_(x, y) <- v, 0-based. no duplicate please..
vector<int> get_min_poly(int n, vector<elem> M){
    // smallest poly P such that A^i = sum_{j < i} {A^j \times P_j}
    vector<int> rnd1, rnd2;
    mt19937 rng(0x14004);
    auto randint = [&rng](int lb, int ub){
        return uniform_int_distribution<int>(lb, ub)(rng);
    };
    for(int i=0; i<n; i++){
        rnd1.push_back(randint(1, mod - 1));
        rnd2.push_back(randint(1, mod - 1));
    }
    vector<int> gobs;
    for(int i=0; i<2*n+2; i++){
        int tmp = 0;
        for(int j=0; j<n; j++){
            tmp += 1ll * rnd2[j] * rnd1[j] % mod;
            if(tmp >= mod) tmp -= mod;
        }
        gobs.push_back(tmp);
        vector<int> nxt(n);
        for(auto &i : M){
            nxt[i.x] += 1ll * i.v * rnd1[i.y] % mod;
            if(nxt[i.x] >= mod) nxt[i.x] -= mod;
        }
        rnd1 = nxt;
    }
    auto sol = berlekamp_massey(gobs);
    reverse(sol.begin(), sol.end());
    return sol;
}
lint det(int n, vector<elem> M){
    vector<int> rnd;
    mt19937 rng(0x14004);
    auto randint = [&rng](int lb, int ub){
        return uniform_int_distribution<int>(lb, ub)(rng);
    };
    for(int i=0; i<n; i++) rnd.push_back(randint(1, mod - 1));
    for(auto &i : M){
        i.v = 1ll * i.v * rnd[i.y] % mod;
    }
    auto sol = get_min_poly(n, M)[0];
    if(n % 2 == 0) sol = mod - sol;
    for(auto &i : rnd) sol = 1ll * sol * ipow(i, mod - 2) % mod;
    return sol;
}
bool dp[101][1201][1201];
int n;
int dy[12] = {3,3,2,0,-2,-3,-3,-3,-2,0,2,3};
int dx[12] = {0,2,3,3,3,2,0,-2,-3,-3,-3,-2};

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> n;

    memset(dp,false,sizeof(dp));

    dp[0][600][600] = true;

    for(int i=0;i<100;i++)
    {
        for(int y=0;y<=1200;y++)
        {
            for(int x=0;x<=1200;x++)
            {
                if(dp[i][y][x]==false) continue;
                for(int j=0;j<12;j++)
                {
                    int ny = y + dy[j];
                    int nx = x + dx[j];
                    if(ny < 0 || ny > 1200 || nx < 0 || nx > 1200) continue;
                    dp[i+1][ny][nx] = true;
                }
            }
        }
    }

    vector <int> v;

    for(int i=0;i<=100;i++)
    {
        int cnt = 0;
        for(int y=0;y<=1200;y++)
        {
            for(int x=0;x<=1200;x++)
            {
                cnt += dp[i][y][x];
            }
        }
        v.push_back(cnt);
    }

    cout << guess_nth_term(v,n) << '\n';
    return 0;
}
0