結果

問題 No.206 数の積集合を求めるクエリ
ユーザー oteraotera
提出日時 2020-08-11 21:18:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 241 ms / 7,000 ms
コード長 4,153 bytes
コンパイル時間 1,425 ms
コンパイル使用メモリ 129,264 KB
実行使用メモリ 19,456 KB
最終ジャッジ日時 2024-10-09 11:43:34
合計ジャッジ時間 7,297 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 95 ms
17,920 KB
testcase_01 AC 94 ms
17,920 KB
testcase_02 AC 98 ms
17,792 KB
testcase_03 AC 93 ms
17,792 KB
testcase_04 AC 93 ms
17,792 KB
testcase_05 AC 93 ms
17,792 KB
testcase_06 AC 95 ms
17,920 KB
testcase_07 AC 93 ms
18,048 KB
testcase_08 AC 94 ms
18,048 KB
testcase_09 AC 94 ms
18,048 KB
testcase_10 AC 95 ms
17,792 KB
testcase_11 AC 94 ms
17,792 KB
testcase_12 AC 100 ms
18,048 KB
testcase_13 AC 98 ms
18,048 KB
testcase_14 AC 99 ms
18,048 KB
testcase_15 AC 99 ms
17,792 KB
testcase_16 AC 97 ms
17,920 KB
testcase_17 AC 112 ms
19,456 KB
testcase_18 AC 103 ms
19,328 KB
testcase_19 AC 111 ms
19,328 KB
testcase_20 AC 104 ms
18,560 KB
testcase_21 AC 107 ms
19,072 KB
testcase_22 AC 107 ms
18,816 KB
testcase_23 AC 113 ms
19,328 KB
testcase_24 AC 238 ms
19,456 KB
testcase_25 AC 241 ms
19,456 KB
testcase_26 AC 229 ms
19,456 KB
testcase_27 AC 194 ms
18,816 KB
testcase_28 AC 236 ms
19,072 KB
testcase_29 AC 230 ms
19,072 KB
testcase_30 AC 229 ms
18,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

struct ComplexNumber {
    double real, imag;
    inline ComplexNumber& operator = (const ComplexNumber &c) {real = c.real; imag = c.imag; return *this;}
    friend inline ostream& operator << (ostream &s, const ComplexNumber &c) {return s<<'<'<<c.real<<','<<c.imag<<'>';}
};
inline ComplexNumber operator + (const ComplexNumber &x, const ComplexNumber &y) {
    return {x.real + y.real, x.imag + y.imag};
}
inline ComplexNumber operator - (const ComplexNumber &x, const ComplexNumber &y) {
    return {x.real - y.real, x.imag - y.imag};
}
inline ComplexNumber operator * (const ComplexNumber &x, const ComplexNumber &y) {
    return {x.real * y.real - x.imag * y.imag, x.real * y.imag + x.imag * y.real};
}
inline ComplexNumber operator * (const ComplexNumber &x, double a) {
    return {x.real * a, x.imag * a};
}
inline ComplexNumber operator / (const ComplexNumber &x, double a) {
    return {x.real / a, x.imag / a};
}

struct FFT {
    static const int MAX = 1<<18;               // must be 2^n
    ComplexNumber AT[MAX], BT[MAX], CT[MAX];

    void DTM(ComplexNumber F[], bool inv) {
        int N = MAX;
        for (int t = N; t >= 2; t >>= 1) {
            double ang = acos(-1.0)*2/t;
            for (int i = 0; i < t/2; i++) {
                ComplexNumber w = {cos(ang*i), sin(ang*i)};
                if (inv) w.imag = -w.imag;
                for (int j = i; j < N; j += t) {
                    ComplexNumber f1 = F[j] + F[j+t/2];
                    ComplexNumber f2 = (F[j] - F[j+t/2]) * w;
                    F[j] = f1;
                    F[j+t/2] = f2;
                }
            }
        }
        for (int i = 1, j = 0; i < N; i++) {
            for (int k = N >> 1; k > (j ^= k); k >>= 1);
            if (i < j) swap(F[i], F[j]);
        }
    }
    
    // C is A*B
    void mult(long long A[], long long B[], long long C[]) {
        for (int i = 0; i < MAX; ++i) AT[i] = {(double)A[i], 0.0};
        for (int i = 0; i < MAX; ++i) BT[i] = {(double)B[i], 0.0};
        
        DTM(AT, false);
        DTM(BT, false);
        
        for (int i = 0; i < MAX; ++i) CT[i] = AT[i] * BT[i];
        
        DTM(CT, true);
        
        for (int i = 0; i < MAX; ++i) {
            CT[i] = CT[i] / MAX;
            C[i] = (long long)(CT[i].real + 0.5);
        }
    }
};

void solve() {
	int l, m, n; cin >> l >> m >> n;
    static ll A[FFT::MAX] = {0}, B[FFT::MAX] = {0}, C[FFT::MAX] = {0};
    rep(i, l) {
        int x; cin >> x;
        A[x] ++;
    }
    rep(i, m) {
        int x; cin >> x;
        B[n - x] ++;
    }
    int q; cin >> q;
    FFT fft;
    fft.mult(A, B, C);
    rep(i, q) {
        cout << C[n + i] << endl;
    }
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}
0