結果

問題 No.1307 Rotate and Accumulate
ユーザー rniyarniya
提出日時 2020-12-04 00:42:15
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 56 ms / 5,000 ms
コード長 6,771 bytes
コンパイル時間 2,102 ms
コンパイル使用メモリ 208,740 KB
実行使用メモリ 15,172 KB
最終ジャッジ日時 2023-10-12 11:27:33
合計ジャッジ時間 4,272 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 1 ms
4,348 KB
testcase_05 AC 2 ms
4,352 KB
testcase_06 AC 1 ms
4,352 KB
testcase_07 AC 2 ms
4,348 KB
testcase_08 AC 38 ms
14,240 KB
testcase_09 AC 40 ms
14,328 KB
testcase_10 AC 33 ms
9,036 KB
testcase_11 AC 25 ms
9,348 KB
testcase_12 AC 32 ms
9,140 KB
testcase_13 AC 10 ms
4,352 KB
testcase_14 AC 17 ms
6,132 KB
testcase_15 AC 55 ms
14,808 KB
testcase_16 AC 54 ms
14,668 KB
testcase_17 AC 56 ms
14,680 KB
testcase_18 AC 50 ms
14,664 KB
testcase_19 AC 56 ms
14,824 KB
testcase_20 AC 56 ms
15,172 KB
testcase_21 AC 2 ms
4,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

namespace FastFourierTransform{
    struct Complex{
        double x,y;
        Complex():x(0),y(0){}
        Complex(double x,double y):x(x),y(y){}
        inline Complex operator+(const Complex &c) const {
            return Complex(x+c.x,y+c.y);
        }
        inline Complex operator-(const Complex &c) const {
            return Complex(x-c.x,y-c.y);
        }
        inline Complex operator*(const Complex &c) const {
            return Complex(x*c.x-y*c.y,x*c.y+y*c.x);
        }
        inline Complex conj() const {return Complex(x,-y);}
    };
    const double PI=acosl(-1);
    vector<Complex> roots={{0,0},{1,0}};
    vector<int> rev={0,1};
    int base=1;
    void ensure_base(int nbase){
        if (nbase<=base) return;
        rev.resize(1<<nbase);
        for (int i=0;i<(1<<nbase);++i){
            rev[i]=(rev[i>>1]>>1)|((i&1)<<(nbase-1));
        }
        roots.resize(1<<nbase);
        for (;base<nbase;++base){
            double angle=PI*2.0/(1<<(base+1));
            for (int i=1<<(base-1);i<(1<<base);++i){
                roots[i<<1]=roots[i];
                double angle_i=angle*((i<<1|1)-(1<<base));
                roots[i<<1|1]=Complex(cos(angle_i),sin(angle_i));
            }
        }
    }
    void fft(vector<Complex> &a,int n){
        int zeros=__builtin_ctz(n);
        ensure_base(zeros);
        int shift=base-zeros;
        for (int i=0;i<n;++i){
            if (i<(rev[i]>>shift)){
                swap(a[i],a[rev[i]>>shift]);
            }
        }
        for (int k=1;k<n;k<<=1){
            for (int i=0;i<n;i+=(k<<1)){
                for (int j=0;j<k;++j){
                    Complex z=a[i+j+k]*roots[j+k];
                    a[i+j+k]=a[i+j]-z;
                    a[i+j]=a[i+j]+z;
                }
            }
        }
    }
    vector<long long> multiply(const vector<int> &a,const vector<int> &b){
        int need=a.size()+b.size()-1;
        int nbase=1;
        while((1<<nbase)<need) ++nbase;
        ensure_base(nbase);
        int sz=1<<nbase;
        vector<Complex> C(sz);
        for (int i=0;i<sz;++i){
            int x=(i<a.size()?a[i]:0);
            int y=(i<b.size()?b[i]:0);
            C[i]=Complex(x,y);
        }
        fft(C,sz);
        Complex r(0,-0.25/(sz>>1)),s(0,1),t(0.5,0);
        for (int i=0;i<=(sz>>1);++i){
            int j=(sz-i)&(sz-1);
            Complex z=(C[j]*C[j]-(C[i]*C[i]).conj())*r;
            C[j]=(C[i]*C[i]-(C[j]*C[j]).conj())*r;
            C[i]=z;
        }
        for (int i=0;i<(sz>>1);++i){
            Complex C0=(C[i]+C[i+(sz>>1)])*t;
            Complex C1=(C[i]-C[i+(sz>>1)])*t*roots[(sz>>1)+i];
            C[i]=C0+C1*s;
        }
        fft(C,sz>>1);
        vector<long long> res(need);
        for (int i=0;i<need;++i){
            res[i]=llround(i&1?C[i>>1].y:C[i>>1].x);
        }
        return res;
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,Q; cin >> N >> Q;
    vector<int> a(N);
    for (int i=0;i<N;++i) cin >> a[i];
    vector<int> b(N+1,0);
    for (;Q--;){
        int r; cin >> r;
        ++b[N-r];
    }

    vector<long long> c=FastFourierTransform::multiply(a,b);
    vector<int> ans(N,0);
    for (int i=0;i<c.size();++i) ans[i%N]+=c[i];

    for (int i=0;i<N;++i) cout << ans[i] << (i==N-1?'\n':' ');
}
0