Submission #421218


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
//#define endl "\n"
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
template<class T> inline bool chmax(T & x, T const & y){ return x<y ? x=y,true : false; }
template<class T> inline bool chmin(T & x, T const & y){ return x>y ? x=y,true : false; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif
// ll const mod = 1000000007;
// ll const inf = 1LL<<60;

typedef long double Real;
typedef complex<Real> Complex;

Real const PI = acos(-1);

vector<Complex> inv_dft_dft(vector<Complex> f, int n){
    if(n==1) return f;
    vector<Complex> f0(n/2), f1(n/2);
    rep(i,n/2) f0[i] = f[i*2], f1[i] = f[i*2+1];
    f0 = inv_dft_dft(f0, n/2);
    f1 = inv_dft_dft(f1, n/2);
    Complex zeta = polar<Real>(1,2*PI/n);
    Complex pow_zeta = 1;
    rep(i,n){
        f[i] = f0[i%(n/2)] + pow_zeta * f1[i%(n/2)];
        pow_zeta /= zeta;
    }
    return f;
}

vector<Complex> inv_dft(vector<Complex> f, int n){
    vector<Complex> res = inv_dft_dft(f,n);
    rep(i,n) res[i] /= n;
    return res;
}

vector<Complex> dft(vector<Complex> f, int n){
    if(n==1) return f;
    vector<Complex> f0(n/2), f1(n/2);
    rep(i,n/2) f0[i] = f[i*2], f1[i] = f[i*2+1];
    f0 = dft(f0, n/2);
    f1 = dft(f1, n/2);
    Complex zeta = polar<Real>(1,2*PI/n);
    Complex pow_zeta = 1;
    rep(i,n){
        f[i] = f0[i%(n/2)] + pow_zeta * f1[i%(n/2)];
        pow_zeta *= zeta;
    }
    return f;
}

vector<Complex> to_c(vector<Real> f){
    int n = f.size();
    vector<Complex> g(n);
    rep(i,n) g[i] = f[i];
    return g;
}

vector<Complex> mul(vector<Real> g, vector<Real> h){
    int n_ = max(g.size(), h.size());
    int n = 1;
    while(n < n_) n<<=1;
    while((int)g.size() < n) g.push_back(0);
    while((int)h.size() < n) h.push_back(0);
    vector<Complex> gg = dft(to_c(g),n);
    vector<Complex> hh = dft(to_c(h),n);
    vector<Complex> ff(n);
    rep(i,n) ff[i] = gg[i]*hh[i];
    return inv_dft(ff,n);
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    vector<Real> g(n*2+1), h(n*2+1);
    rep(i,n) cin >> g[i+1] >> h[i+1];
    vector<Complex> f = mul(g,h);
    for(int i=1;i<=n*2;i++){
        cout << (ll)(f[i].real()+0.5) << endl;
    }
}

Submission Info

Submission Time
Task C - 高速フーリエ変換
User tubo28
Language C++11 (GCC 4.9.2)
Score 100
Code Size 3484 Byte
Status AC
Exec Time 2786 ms
Memory 80804 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 1
AC × 33
Set Name Test Cases
Sample 00_sample_01
All 00_sample_01, 01_00_01, 01_01_19, 01_02_31, 01_03_22, 01_04_31, 01_05_40, 01_06_15, 01_07_39, 01_08_28, 01_09_30, 01_10_23, 01_11_33, 01_12_11, 01_13_28, 01_14_41, 01_15_26, 01_16_49, 01_17_34, 01_18_02, 01_19_33, 01_20_29, 02_00_51254, 02_01_82431, 02_02_17056, 02_03_34866, 02_04_6779, 02_05_65534, 02_06_65535, 02_07_65536, 02_08_65537, 02_09_65538, 02_10_100000
Case Name Status Exec Time Memory
00_sample_01 AC 29 ms 792 KB
01_00_01 AC 24 ms 808 KB
01_01_19 AC 25 ms 800 KB
01_02_31 AC 24 ms 800 KB
01_03_22 AC 25 ms 924 KB
01_04_31 AC 25 ms 928 KB
01_05_40 AC 25 ms 804 KB
01_06_15 AC 25 ms 928 KB
01_07_39 AC 27 ms 928 KB
01_08_28 AC 25 ms 928 KB
01_09_30 AC 25 ms 808 KB
01_10_23 AC 24 ms 928 KB
01_11_33 AC 27 ms 844 KB
01_12_11 AC 25 ms 916 KB
01_13_28 AC 25 ms 920 KB
01_14_41 AC 26 ms 800 KB
01_15_26 AC 25 ms 924 KB
01_16_49 AC 25 ms 920 KB
01_17_34 AC 27 ms 796 KB
01_18_02 AC 28 ms 924 KB
01_19_33 AC 26 ms 736 KB
01_20_29 AC 23 ms 796 KB
02_00_51254 AC 1355 ms 40844 KB
02_01_82431 AC 2751 ms 79728 KB
02_02_17056 AC 627 ms 20316 KB
02_03_34866 AC 1301 ms 39820 KB
02_04_6779 AC 179 ms 5868 KB
02_05_65534 AC 1457 ms 41740 KB
02_06_65535 AC 1476 ms 41764 KB
02_07_65536 AC 2607 ms 78600 KB
02_08_65537 AC 2625 ms 78596 KB
02_09_65538 AC 2630 ms 78604 KB
02_10_100000 AC 2786 ms 80804 KB