#600580 (C++14) No.1331 Moving Penguin

提出ソース

結果

問題	No.1331 Moving Penguin
ユーザー	mtsd
提出日時	2021-01-08 21:33:08
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	165 ms / 1,500 ms
コード長	5,749 bytes
コンパイル時間	998 ms
コンパイル使用メモリ	118,068 KB
実行使用メモリ	7,532 KB
最終ジャッジ日時	2023-08-07 10:42:39
合計ジャッジ時間	8,964 ms
ジャッジサーバーID （参考情報）	judge14 / judge15

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	15 ms 7,196 KB
testcase_01	AC	4 ms 7,072 KB
testcase_02	AC	4 ms 7,076 KB
testcase_03	AC	4 ms 7,080 KB
testcase_04	AC	154 ms 7,376 KB
testcase_05	AC	146 ms 7,344 KB
testcase_06	AC	146 ms 7,224 KB
testcase_07	AC	145 ms 7,532 KB
testcase_08	AC	144 ms 7,228 KB
testcase_09	AC	146 ms 7,340 KB
testcase_10	AC	143 ms 7,228 KB
testcase_11	AC	142 ms 7,224 KB
testcase_12	AC	144 ms 7,368 KB
testcase_13	AC	144 ms 7,176 KB
testcase_14	AC	142 ms 7,180 KB
testcase_15	AC	143 ms 7,340 KB
testcase_16	AC	143 ms 7,276 KB
testcase_17	AC	143 ms 7,360 KB
testcase_18	AC	143 ms 7,364 KB
testcase_19	AC	143 ms 7,224 KB
testcase_20	AC	143 ms 7,316 KB
testcase_21	AC	143 ms 7,184 KB
testcase_22	AC	143 ms 7,180 KB
testcase_23	AC	143 ms 7,316 KB
testcase_24	AC	143 ms 7,256 KB
testcase_25	AC	144 ms 7,228 KB
testcase_26	AC	156 ms 7,272 KB
testcase_27	AC	155 ms 7,316 KB
testcase_28	AC	157 ms 7,268 KB
testcase_29	AC	158 ms 7,316 KB
testcase_30	AC	54 ms 7,068 KB
testcase_31	AC	90 ms 7,116 KB
testcase_32	AC	49 ms 7,192 KB
testcase_33	AC	72 ms 7,128 KB
testcase_34	AC	106 ms 7,164 KB
testcase_35	AC	165 ms 7,400 KB
testcase_36	AC	161 ms 7,508 KB
testcase_37	AC	161 ms 7,312 KB
testcase_38	AC	58 ms 7,360 KB
testcase_39	AC	152 ms 7,332 KB
testcase_40	AC	80 ms 7,212 KB
testcase_41	AC	148 ms 7,312 KB
testcase_42	AC	158 ms 7,332 KB
testcase_43	AC	159 ms 7,532 KB
testcase_44	AC	158 ms 7,228 KB
testcase_45	AC	159 ms 7,176 KB
testcase_46	AC	159 ms 7,180 KB
testcase_47	AC	158 ms 7,224 KB
testcase_48	AC	142 ms 7,232 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}

template <unsigned int mod>
class ModInt {
private:
    unsigned int v;
    static unsigned int norm(const unsigned int& x){ return x < mod ? x : x - mod; }
    static ModInt make(const unsigned int& x){ ModInt m; return m.v = x, m; }
    static ModInt inv(const ModInt& x){ return make(inverse(x.v, mod)); }
    static unsigned int inverse(int a, int m){
        int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
        while(*v){
            t = *u / *v;
            swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]), swap(u[2] -= t * v[2], v[2]);
        }
        return (u[1] % m + m) % m;
    }

public:
    ModInt() : v{0}{}
    ModInt(const long long val) : v{norm(val % mod + mod)} {}
    ModInt(const ModInt<mod>& n) : v{n()} {}
    explicit operator bool() const noexcept { return v != 0; }
    bool operator!() const noexcept { return !static_cast<bool>(*this); }
    ModInt& operator=(const ModInt& n){ return v = n(), (*this); }
    ModInt& operator=(const long long val){ return v = norm(val % mod + mod), (*this); }
    ModInt operator+() const { return *this; }
    ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
    ModInt operator+(const ModInt& val) const { return make(norm(v + val())); }
    ModInt operator-(const ModInt& val) const { return make(norm(v + mod - val())); }
    ModInt operator*(const ModInt& val) const { return make((long long)v * val() % mod); }
    ModInt operator/(const ModInt& val) const { return *this * inv(val); }
    ModInt& operator+=(const ModInt& val){ return *this = *this + val; }
    ModInt& operator-=(const ModInt& val){ return *this = *this - val; }
    ModInt& operator*=(const ModInt& val){ return *this = *this * val; }
    ModInt& operator/=(const ModInt& val){ return *this = *this / val; }
    ModInt operator+(const long long val) const { return ModInt{v + val}; }
    ModInt operator-(const long long val) const { return ModInt{v - val}; }
    ModInt operator*(const long long val) const { return ModInt{(long long)v * (val % mod)}; }
    ModInt operator/(const long long val) const { return ModInt{(long long)v * inv(val)}; }
    ModInt& operator+=(const long long val){ return *this = *this + val; }
    ModInt& operator-=(const long long val){ return *this = *this - val; }
    ModInt& operator*=(const long long val){ return *this = *this * val; }
    ModInt& operator/=(const long long val){ return *this = *this / val; }
    bool operator==(const ModInt& val) const { return v == val.v; }
    bool operator!=(const ModInt& val) const { return !(*this == val); }
    bool operator==(const long long val) const { return v == norm(val % mod + mod); }
    bool operator!=(const long long val) const { return !(*this == val); }
    unsigned int operator()() const { return v; }
    friend ModInt operator+(const long long val, const ModInt& n) { return n + val; }
    friend ModInt operator-(const long long val, const ModInt& n) { return ModInt{val - n()}; }
    friend ModInt operator*(const long long val, const ModInt& n) { return n * val; }
    friend ModInt operator/(const long long val, const ModInt& n) { return ModInt{val} / n; }
    friend bool operator==(const long long val, const ModInt& n) { return n == val; }
    friend bool operator!=(const long long val, const ModInt& n) { return !(val == n); }
    friend istream& operator>>(istream& is, ModInt& n){
        unsigned int v;
        return is >> v, n = v, is;
    }
    friend ostream& operator<<(ostream& os, const ModInt& n){ return (os << n()); }
    friend ModInt mod_pow(ModInt x, long long n){
        ModInt ans = 1;
        while(n){
            if(n & 1) ans *= x;
            x *= x, n >>= 1;
        }
        return ans;
    }
};

#define MOD 1000000007
using mod = ModInt<MOD>;

#define MAX_N 200000
mod inv[MAX_N],fac[MAX_N],finv[MAX_N];

void make()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2;i<MAX_N;i++){
        inv[i] = MOD - inv[MOD % i] * (MOD / i);
        fac[i] = fac[i-1] * i;
        finv[i] = finv[i-1] * inv[i];
    }
}

mod comb(int a, int b)
{
    if(a<b) return 0;
    return fac[a] * finv[b] * finv[a-b];
}
mod dp[200010];
mod s[400][400];
int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    dp[0] = 1;
    rep(i,n){
        rep(j,319){
            dp[i] += s[j+1][i%(j+1)];
        }
        if(a[i]<320){
            s[a[i]][i%a[i]]+=dp[i];
            if(a[i]!=1){
                dp[i+1] += dp[i];
            }
        }else{
            for(int j=i+a[i];j<n;j+=a[i]){
                dp[j] += dp[i];
            }
            dp[i+1] += dp[i];
        }
    }   
    cout << dp[n-1] << endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード