Submission #421267


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, vector<Complex> const & z){
    int n = f.size();
    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,z);
    f1 = inv_dft_dft(f1,z);
    int k = z.size() / n;
    rep(i,n){
        f[i] = f0[i%(n/2)] + z[z.size()-k*i-1] * f1[i%(n/2)];
    }
    return f;
}

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

vector<Complex> dft(vector<Complex> & f, vector<Complex> const & z){
    int n = f.size();
    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,z);
    f1 = dft(f1,z);
    int k = z.size() / n;
    rep(i,n){
        f[i] = f0[i%(n/2)] + z[k*i] * f1[i%(n/2)];
    }
    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> z(n+1);
    rep(i,n+1) z[i] = polar<Real>(1,2*PI/n*i);
    vector<Complex> g_ = to_c(g), h_ = to_c(h);
    vector<Complex> gg = dft(g_,z);
    vector<Complex> hh = dft(h_,z);
    vector<Complex> ff(n);
    rep(i,n) ff[i] = gg[i]*hh[i];
    return inv_dft(ff,z);
}

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 3590 Byte
Status AC
Exec Time 2412 ms
Memory 91640 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 44 ms 1380 KB
01_00_01 AC 43 ms 1372 KB
01_01_19 AC 42 ms 1384 KB
01_02_31 AC 42 ms 1380 KB
01_03_22 AC 43 ms 1376 KB
01_04_31 AC 43 ms 1380 KB
01_05_40 AC 48 ms 1380 KB
01_06_15 AC 45 ms 1384 KB
01_07_39 AC 43 ms 1384 KB
01_08_28 AC 41 ms 1376 KB
01_09_30 AC 42 ms 1376 KB
01_10_23 AC 44 ms 1380 KB
01_11_33 AC 43 ms 1376 KB
01_12_11 AC 45 ms 1376 KB
01_13_28 AC 42 ms 1388 KB
01_14_41 AC 42 ms 1380 KB
01_15_26 AC 43 ms 1376 KB
01_16_49 AC 44 ms 1380 KB
01_17_34 AC 42 ms 1376 KB
01_18_02 AC 43 ms 1380 KB
01_19_33 AC 43 ms 1388 KB
01_20_29 AC 43 ms 1380 KB
02_00_51254 AC 1140 ms 43480 KB
02_01_82431 AC 2273 ms 90564 KB
02_02_17056 AC 524 ms 21552 KB
02_03_34866 AC 1050 ms 42464 KB
02_04_6779 AC 175 ms 7100 KB
02_05_65534 AC 1234 ms 44388 KB
02_06_65535 AC 1229 ms 44384 KB
02_07_65536 AC 2180 ms 89428 KB
02_08_65537 AC 2180 ms 89504 KB
02_09_65538 AC 2189 ms 89564 KB
02_10_100000 AC 2412 ms 91640 KB