#32318 (C++11) No.206 数の積集合を求めるクエリ

提出ソース

結果

問題	No.206 数の積集合を求めるクエリ
ユーザー	shimomire
提出日時	2015-06-13 14:11:17
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	913 ms / 7,000 ms
コード長	6,276 bytes
コンパイル時間	2,342 ms
コンパイル使用メモリ	144,360 KB
実行使用メモリ	18,156 KB
最終ジャッジ日時	2023-09-21 00:02:53
合計ジャッジ時間	16,004 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,384 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	1 ms 4,380 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	16 ms 4,376 KB
testcase_07	AC	16 ms 4,380 KB
testcase_08	AC	16 ms 4,380 KB
testcase_09	AC	16 ms 4,376 KB
testcase_10	AC	1 ms 4,380 KB
testcase_11	AC	2 ms 4,376 KB
testcase_12	AC	20 ms 4,376 KB
testcase_13	AC	19 ms 4,380 KB
testcase_14	AC	20 ms 4,380 KB
testcase_15	AC	20 ms 4,380 KB
testcase_16	AC	20 ms 4,380 KB
testcase_17	AC	779 ms 18,084 KB
testcase_18	AC	787 ms 17,908 KB
testcase_19	AC	798 ms 18,124 KB
testcase_20	AC	796 ms 17,712 KB
testcase_21	AC	792 ms 18,056 KB
testcase_22	AC	784 ms 17,892 KB
testcase_23	AC	780 ms 18,104 KB
testcase_24	AC	913 ms 18,156 KB
testcase_25	AC	898 ms 17,992 KB
testcase_26	AC	903 ms 17,664 KB
testcase_27	AC	855 ms 17,616 KB
testcase_28	AC	899 ms 18,056 KB
testcase_29	AC	899 ms 17,796 KB
testcase_30	AC	897 ms 17,724 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<58;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};

// min{2^r | n < 2^r}
template<typename T> T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}

template <ll M=(ll)1e9+7> class modU{
public:
	inline ll pmod(ll v){return (v%M+M)%M;}
	inline ll ainv(ll a){return pmod(-a);}
	inline ll add(ll a,ll b){return pmod(a+b);}
	inline ll mul(ll a,ll b){return pmod(a*b);}
	ll pow(ll x, ll N){
		ll res=1;
		while(N>0){
			if(N%2)res=mul(res,x);
			x=mul(x,x);
			N/=2;
		}
		return res;
	}

	//O(logM)
	inline ll minv(ll a){return pow(a,M-2);}
};

class NTT{
public:
	// n = 2^k
	// ω^n ≡ 1 (mod p) となるωとpを選択する
	const static ll nM = 1LL<<23;
	const static ll om = 183;
	const static ll p = 254*nM+1;
	modU<p> mu;

	// O(nlogn)
	// simple code
	void ntt(ll f[],int N,int s,ll om){
		if(N==1) return;
		int s2=s*2, N2=N/2;
		ntt(f,N2,s2,om), ntt(f+s,N2,s2,om);

		vector<ll> tmp = vector<ll>(N);
		ll tom = 1,d =mu.pow(om,s);
		for(int i:range(N2)){
			ll lv = f[s2*i], rv = mu.mul(tom,f[s+s2*i]);
			tmp[i] = mu.add(lv,rv), tmp[i+N2] = mu.add(lv,-rv);
			tom =mu.mul(tom,d);
		}
		for(int i:range(N)) f[s*i] = tmp[i];
	}

	void ntt(vector<ll>& f,ll th){
		ntt(&f[0],f.size(),1,th);
	}

	//O(nlogn)
	// [s_1,...,s_n]
	// s_k=Σ(0<=i<=k)a_i*b_(k-i) 
	void convolution(vector<ll>& as,vector<ll>& bs){
		int n = 1, vwn = as.size() + bs.size() - 1;
		while(n < vwn) n <<= 1;
		as.resize(n), bs.resize(n);
		ntt(as,mu.pow(om,nM/n)); ntt(bs,mu.pow(om,nM/n));
		for(int i:range(n)) as[i] = mu.mul(as[i],bs[i]);
		ntt(as,mu.pow(mu.minv(om),nM/n));
		ll invn =mu.minv(n);
		for(int i:range(n)) as[i] = mu.mul(as[i],invn);
	}
};

class Main{
	public:
	void run(){
		int L,M,N;cin >> L >> M >> N;
		vector<int> as(L);cin >> as;
		vector<int> bs(M);cin >> bs;
		

		vector<ll> tas(2*N+2);
		for(int a:as)tas[N+1 + a]++;
		vector<ll> tbs(2*N+2);
		for(int b:bs)tbs[N+1 - b]++;

		int Q;cin >>Q;
		NTT ntt;
		ntt.convolution(tas,tbs);
		for(int i=2*(N+1);i<2*(N+1)+Q;i++){
			cout << tas[i] <<endl;
		}
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

yukicoder

結果

テストケース

ソースコード