結果

問題 No.1172 Add Recursive Sequence
ユーザー 👑 tatyamtatyam
提出日時 2020-08-14 23:00:42
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 2,491 ms / 4,000 ms
コード長 17,623 bytes
コンパイル時間 3,042 ms
コンパイル使用メモリ 223,340 KB
実行使用メモリ 51,736 KB
最終ジャッジ日時 2024-04-18 22:50:43
合計ジャッジ時間 46,747 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,162 ms
49,536 KB
testcase_01 AC 2,186 ms
49,648 KB
testcase_02 AC 2,190 ms
49,564 KB
testcase_03 AC 2,174 ms
49,544 KB
testcase_04 AC 2,161 ms
49,572 KB
testcase_05 AC 2,177 ms
49,516 KB
testcase_06 AC 2,176 ms
49,684 KB
testcase_07 AC 2,163 ms
49,812 KB
testcase_08 AC 2,175 ms
49,612 KB
testcase_09 AC 2,174 ms
49,692 KB
testcase_10 AC 2,211 ms
50,100 KB
testcase_11 AC 2,203 ms
49,720 KB
testcase_12 AC 2,194 ms
50,048 KB
testcase_13 AC 2,198 ms
49,904 KB
testcase_14 AC 2,476 ms
51,604 KB
testcase_15 AC 2,417 ms
51,548 KB
testcase_16 AC 2,491 ms
51,732 KB
testcase_17 AC 2,483 ms
51,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tuplis = array<ll, 3>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF=0x1fffffffffffffff;
const ll MINF=0x7fffffffffff;
const int INF=0x3fffffff;
const int MOD=1000000007;
const int MODD=998244353;
const ld DINF=numeric_limits<ld>::infinity();
const ld EPS=1e-9;
const ld PI=3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1,_2,_3,_4,name,...) name
#define overload3(_1,_2,_3,name,...) name
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i=n;i--;)
#define rrep2(i,n) for(ll i=n;i--;)
#define rrep3(i,a,b) for(ll i=b;i-->(a);)
#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define each1(i,a) for(auto&&i:a)
#define each2(x,y,a) for(auto&&[x,y]:a)
#define each3(x,y,z,a) for(auto&&[x,y,z]:a)
#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)
#define rall1(i) (i).rbegin(),(i).rend()
#define rall2(i,k) (i).rbegin(),(i).rbegin()+k
#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b
#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)
#define Msum(...) accumulate(all(__VA_ARGS__),0_M)
#define elif else if
#define unless(a) if(!(a))
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }
ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }
template<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }
template<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }
vector<ll> iota(ll n){ vector<ll> a(n); iota(a.begin(), a.end(), 0); return a; }
vector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }
map<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }
vector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }
template<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }
template<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }
int scan(){ return getchar(); }
void scan(int& a){ scanf("%d", &a); }
void scan(unsigned& a){ scanf("%u", &a); }
void scan(long& a){ scanf("%ld", &a); }
void scan(long long& a){ scanf("%lld", &a); }
void scan(unsigned long long& a){ scanf("%llu", &a); }
void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); }
void scan(float& a){ scanf("%f", &a); }
void scan(double& a){ scanf("%lf", &a); }
void scan(long double& a){ scanf("%Lf", &a); }
void scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }
void scan(char a[]){ scanf("%s", a); }
void scan(string& a){ cin >> a; }
template<class T> void scan(vector<T>&);
template<class T, size_t size> void scan(array<T, size>&);
template<class T, class L> void scan(pair<T, L>&);
template<class T, size_t size> void scan(T(&)[size]);
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
template<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }
template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }
template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }
template<class T> void scan(T& a){ cin >> a; }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(unsigned a){ printf("%u", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(unsigned long long a){ printf("%llu", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(float a){ printf("%.15f", a); }
void print(double a){ printf("%.15f", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
#ifdef DEBUG
inline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__  - 1 - __builtin_clzll(__n); }
#define debug(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...) void(0)
#endif
int first(bool i = true){ return out(i?"first":"second"); }
int yes(bool i = true){ return out(i?"yes":"no"); }
int Yes(bool i = true){ return out(i?"Yes":"No"); }
int No(){ return out("No"); }
int YES(bool i = true){ return out(i?"YES":"NO"); }
int NO(){ return out("NO"); }
int Yay(bool i = true){ return out(i?"Yay!":":("); }
int possible(bool i = true){ return out(i?"possible":"impossible"); }
int Possible(bool i = true){ return out(i?"Possible":"Impossible"); }
int POSSIBLE(bool i = true){ return out(i?"POSSIBLE":"IMPOSSIBLE"); }
void Case(ll i){ printf("Case #%lld: ", i); }


const int maxn = 1 << 17;
typedef unsigned long long u64;
typedef unsigned u32;
const u32 mod1 = 101711873, Tmod1 = mod1 + mod1;
const u32 mod2 = 104857601, Tmod2 = mod2 + mod2;
const u32 mod3 = 113246209, Tmod3 = mod3 + mod3;
inline u64 pow(u64 a, int b, const int mod, u64 ans = 1) {
    for(;b;b >>= 1, a = a * a % mod) if(b & 1)
        ans = ans * a % mod;
    return ans;
}
namespace poly {
    struct integer {
        u32 a, b, c;
        inline integer operator * (const integer & x) const {
            return (integer){u32((u64) a * x.a % mod1), u32((u64) b * x.b % mod2), u32((u64) c * x.c % mod3)};
        }
    };
    inline u32 get(const integer & x) {
        static const u32 mod = 1e9 + 7;
        static const u32 m12 = (u64) mod1 * mod2 % mod;
        static const u32 i12 = pow(mod1, mod2 - 2, mod2);
        static const u32 i23 = pow((u64) mod1 * mod2 % mod3, mod3 - 2, mod3);
        u64 o = u64(x.b + mod2 - x.a) * i12 % mod2 * mod1 + x.a;
        return ((x.c - o % mod3 + mod3) * i23 % mod3 * m12 + o) % mod;
    }
    const integer E = {1, 1, 1};
    integer wn[maxn], invwn[maxn], invlim;
    int rev[maxn], lim;
    inline integer inverse(const integer&x) {
        return (integer){ u32(((u64) x.a << 32) / mod1), u32(((u64) x.b << 32) / mod2), u32(((u64) x.c << 32) / mod3)};
    }
    inline void init() {
        const int mid = lim / 2;
        const integer w = {u32(pow(3, mod1 / lim, mod1)), u32(pow(3, mod2 / lim, mod2)), u32(pow(7, mod3 / lim, mod3))};
        wn[mid] = E; invwn[mid] = inverse(E);
        for(int i = 1;i < mid;++i) {
            wn[i + mid] = wn[i + mid - 1] * w;
            invwn[i + mid] = inverse(wn[i + mid]);
        }
        for(int i = mid - 1;i >= 1;--i) {
            wn[i] = wn[i << 1];
            invwn[i] = invwn[i << 1];
        }
    }
    inline void init(int len) {
        for(lim = 1;lim < len;lim <<= 1);
        invlim = {u32(mod1 - (mod1 - 1) / lim), u32(mod2 - (mod2 - 1) / lim), u32(mod3 - (mod3 - 1) / lim)};
        for(int i = 1;i < lim;++i) {
            rev[i] = rev[i >> 1] >> 1 | i % 2 * lim / 2;
        }
    }
    inline void fft(integer * a) {
        for(int i = 1;i < lim;++i) if(rev[i] > i) {
            std::swap(a[i], a[rev[i]]);
        }
        for(int mid = 1;mid < lim;mid <<= 1) {
            for(int j = 0;j < lim;j += mid + mid) {
                for(int k = 0;k < mid;++k) {
                    const u32 x1 = a[mid + j + k].a * wn[mid + k].a - u32((u64) a[mid + j + k].a * invwn[mid + k].a >> 32) * mod1;
                    const u32 x2 = a[mid + j + k].b * wn[mid + k].b - u32((u64) a[mid + j + k].b * invwn[mid + k].b >> 32) * mod2;
                    const u32 x3 = a[mid + j + k].c * wn[mid + k].c - u32((u64) a[mid + j + k].c * invwn[mid + k].c >> 32) * mod3;
                    a[mid + j + k].a = a[j + k].a + Tmod1 - x1;
                    a[mid + j + k].b = a[j + k].b + Tmod2 - x2;
                    a[mid + j + k].c = a[j + k].c + Tmod3 - x3;
                    a[j + k].a += x1;
                    a[j + k].b += x2;
                    a[j + k].c += x3;
                }
            }
        }
    }
    integer a[maxn], b[maxn];
    u32 n, m;
    inline void solve() {
        cin >> n >> m;
        init(n + m - 1);
        init();
        for(u32 i = 0, x;i < n;++i) {
            cin >> x;
            a[i] = {x, x, x};
        }
        for(u32 i = 0, x;i < m;++i) {
            cin >> x;
            b[i] = {x, x, x};
        }
        fft(a); fft(b);
        for(int i = 0;i < lim;++i) {
            a[i] = a[i] * b[i];
        }
        fft(a);
        for(int i = n + m - 2;i >= 1;--i) {
            cout << ' ' << get(a[lim - i] * invlim);
        }
        cout << ' ' << get(a[0] * invlim);
    }
}
constexpr uint mod = MOD;
struct Modint{
    uint num = 0;
    constexpr Modint() noexcept {}
    constexpr Modint(const Modint &x) noexcept : num(x.num){}
    inline constexpr operator ll() const noexcept { return num; }
    inline constexpr Modint& operator+=(Modint x) noexcept { num += x.num; if(num >= mod) num -= mod; return *this; }
    inline constexpr Modint& operator++() noexcept { if(num == mod - 1) num = 0; else num++; return *this; }
    inline constexpr Modint operator++(int) noexcept { Modint ans(*this); operator++(); return ans; }
    inline constexpr Modint operator-() const noexcept { return Modint(0) -= *this; }
    inline constexpr Modint operator-(Modint x) const noexcept { return Modint(*this) -= x; }
    inline constexpr Modint& operator-=(Modint x) noexcept { if(num < x.num) num += mod; num -= x.num; return *this; }
    inline constexpr Modint& operator--() noexcept { if(num == 0) num = mod - 1; else num--; return *this; }
    inline constexpr Modint operator--(int) noexcept { Modint ans(*this); operator--(); return ans; }
    inline constexpr Modint& operator*=(Modint x) noexcept { num = ull(num) * x.num % mod; return *this; }
    inline constexpr Modint& operator/=(Modint x) noexcept { return operator*=(x.inv()); }
    template<class T> constexpr Modint(T x) noexcept {
        using U = typename conditional<sizeof(T) >= 4, T, int>::type;
        U y = x; y %= U(mod); if(y < 0) y += mod; num = uint(y);
    }
    template<class T> inline constexpr Modint operator+(T x) const noexcept { return Modint(*this) += x; }
    template<class T> inline constexpr Modint& operator+=(T x) noexcept { return operator+=(Modint(x)); }
    template<class T> inline constexpr Modint operator-(T x) const noexcept { return Modint(*this) -= x; }
    template<class T> inline constexpr Modint& operator-=(T x) noexcept { return operator-=(Modint(x)); }
    template<class T> inline constexpr Modint operator*(T x) const noexcept { return Modint(*this) *= x; }
    template<class T> inline constexpr Modint& operator*=(T x) noexcept { return operator*=(Modint(x)); }
    template<class T> inline constexpr Modint operator/(T x) const noexcept { return Modint(*this) /= x; }
    template<class T> inline constexpr Modint& operator/=(T x) noexcept { return operator/=(Modint(x)); }
    inline constexpr Modint inv() const noexcept { ll x = 0, y = 0; extgcd(num, mod, x, y); return x; }
    static inline constexpr ll extgcd(ll a, ll b, ll &x, ll &y) noexcept { ll g = a; x = 1; y = 0; if(b){ g = extgcd(b, a % b, y, x); y -= a / b * x; } return g; }
    inline constexpr Modint pow(ull x) const noexcept { Modint ans = 1, cnt = *this; while(x){ if(x & 1) ans *= cnt; cnt *= cnt; x /= 2; } return ans; }
};
std::istream& operator>>(std::istream& is, Modint& x){ ll a; in(a); x = a; return is; }
inline constexpr Modint operator""_M(ull x) noexcept { return Modint(x); }
std::vector<Modint> fac(1, 1), inv(1, 1);
inline void reserve(ll a){
    if(fac.size() >= a) return;
    if(a < fac.size() * 2) a = fac.size() * 2;
    if(a >= mod) a = mod;
    while(fac.size() < a) fac.push_back(fac.back() * Modint(fac.size()));
    inv.resize(fac.size());
    inv.back() = fac.back().inv();
    for(ll i = inv.size() - 1; !inv[i - 1]; i--) inv[i - 1] = inv[i] * i;
}
inline Modint fact(ll n){ if(n < 0) return 0; reserve(n + 1); return fac[n]; }
inline Modint perm(ll n, ll r){
    if(r < 0 || n < r) return 0;
    if(n >> 24){ Modint ans = 1; for(ll i = 0; i < r; i++) ans *= n--; return ans; }
    reserve(n + 1); return fac[n] * inv[n - r];
}
inline Modint comb(ll n, ll r){ if(r < 0 || n < r) return 0; reserve(r + 1); return perm(n, r) * inv[r]; }
inline Modint Mcomb(ll n, ll r){ return comb(n + r - 1, n - 1); } // r balls into n boxes
inline Modint catalan(ll n){ reserve(n * 2 + 1); return fac[n * 2] * inv[n] * inv[n + 1]; }
signed main(){
    LL(k,n,m);
    VEC(Modint,a,k);
    VEC(Modint,c,k);
    a.resize(n);
    rep(i,k,n){
        rep(j,k)a[i]+=a[i-1-j]*c[j];
    }
    VEC(pll,q,m);
    vec(Modint,ans,n);
    const ll sq=1000;
    vv(uint,b,100000/sq,100000);
    each(x,y,q){
        const ll r=(y-x)%sq,d=(y-x)/sq;
        rep(r){
            y--;
            ans[y]+=a[y-x];
        }
        rep(d)b[i][x+i*sq]++;
    }
    a.resize(100000);
    poly::init(100000);
    poly::init();
    rep(100000/sq){
        memset(poly::a,0x00,sizeof(poly::a));
        memset(poly::b,0x00,sizeof(poly::b));
        rep(j,sq)poly::a[j]={a[i*sq+j].num,a[i*sq+j].num,a[i*sq+j].num};
        rep(j,100000)poly::b[j]={b[i][j],b[i][j],b[i][j]};
        poly::fft(poly::a); poly::fft(poly::b);
        for(int i = 0;i < poly::lim;++i) {
            poly::a[i] = poly::a[i] * poly::b[i];
        }
        poly::fft(poly::a);
        const u32 mask=poly::lim-1;
        rep(n)ans[i]+=poly::get(poly::a[-i&mask]*poly::invlim);
    }
    each(i,ans)out(i);
}
0