結果

問題 No.1618 Convolution?
ユーザー ゆにぽけゆにぽけ
提出日時 2024-03-18 23:41:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 397 ms / 2,000 ms
コード長 3,598 bytes
コンパイル時間 2,518 ms
コンパイル使用メモリ 162,976 KB
実行使用メモリ 24,476 KB
最終ジャッジ日時 2024-09-30 05:04:38
合計ジャッジ時間 12,459 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 352 ms
20,636 KB
testcase_03 AC 361 ms
23,028 KB
testcase_04 AC 205 ms
16,168 KB
testcase_05 AC 22 ms
6,816 KB
testcase_06 AC 366 ms
21,268 KB
testcase_07 AC 364 ms
21,380 KB
testcase_08 AC 207 ms
16,296 KB
testcase_09 AC 386 ms
24,208 KB
testcase_10 AC 347 ms
17,872 KB
testcase_11 AC 383 ms
23,420 KB
testcase_12 AC 397 ms
24,460 KB
testcase_13 AC 385 ms
24,360 KB
testcase_14 AC 389 ms
24,476 KB
testcase_15 AC 390 ms
24,424 KB
testcase_16 AC 379 ms
24,432 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	static constexpr int get_mod() noexcept {return m;}
	static constexpr int primitive_root() noexcept
	{
		assert(m == 998244353);
		return 3;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
/* using mint = modint<998244353>; */
using mint = modint<1000000007>;
vector<pair<long long,int>> PrimeFactorize(long long N)
{
	vector<pair<long long,int>> res;
	for(long long p = 2;p * p <= N;p++)
	{
		if(N % p != 0)
		{
			continue;
		}
		res.push_back(make_pair(p,0));
		while(N % p == 0)
		{
			N /= p;
			res.back().second++;
		}
	}
	
	if(N > 1)
	{
		res.push_back(make_pair(N,1));
	}

	return res;
}
#include <atcoder/convolution>
void Main()
{
	int N;
	cin >> N;
	vector<long long> A(N + 1),B(N + 1);
	for(int i = 1;i <= N;i++)
	{
		cin >> A[i];
	}
	for(int i = 1;i <= N;i++)
	{
		cin >> B[i];
	}
	vector<long long> I(N + 1);
	for(int i = 1;i <= N;i++)
	{
		I[i] = i;
	}
	A = atcoder::convolution_ll(A,I);
	B = atcoder::convolution_ll(B,I);
	for(int i = 1;i <= 2 * N;i++)
	{
		cout << A[i] + B[i] << (i == 2 * N ? "\n" : " ");
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}
0