Submission #526071

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
526071	2022-02-13T16:32:50 Z	eric00513	씽크스몰 (kriii3_TT)	C++17	20 / 30	688 ms	45716 KB

tt

#include <bits/stdc++.h>
using namespace std;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

using ll = long long;
using base = complex<long double>;

const long double PI = acos(-1);

void fft(vector<base>& a, bool inv) {
	int n = sz(a);
	for (int i = 1, j = 0; i < n; i++) {
		int bit = n >> 1;
		while (j >= bit) j -= bit, bit >>= 1;
		j += bit;
		if (i < j) swap(a[i], a[j]);
	}
	for (int len = 2; len <= n; len <<= 1) {
		vector<base> w(len >> 1);
		for (int i = 0; i < (len >> 1); i++) {
			long double ang = 2 * PI * i / len * (inv ? -1 : 1);
			w[i] = base(cos(ang), sin(ang));
		}
		for (int i = 0; i < n; i += len) {
			for (int j = 0; j < len / 2; j++) {
				base u = a[i + j], v = a[i + j + len / 2] * w[j];
				a[i + j] = u + v;
				a[i + j + len / 2] = u - v;
			}
		}
	}
	if (inv) for (int i = 0; i < n; i++) a[i] /= n;
}

vector<ll> multiply(vector<int>& a, vector<int>& b) {
	vector<base> fa(all(a)), fb(all(b));
	int n = 1;
	while (n < max(sz(a), sz(b))) n <<= 1;
	fa.resize(n), fb.resize(n);
	fft(fa, false); fft(fb, false);
	for (int i = 0; i < n; i++) fa[i] *= fb[i];
	fft(fa, true);
	vector<ll> ret(n);
	for (int i = 0; i < n; i++) ret[i] = (ll)(fa[i].real() + (fa[i].real() > 0 ? 0.5 : -0.5));
	return ret;
}

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);

	int n, m;
	cin >> n >> m;
	n++, m++;
	int k = 1;
	while (k < 2 * max(n, m) - 1) k <<= 1;
	vector<int> a(k), b(k);
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int i = 0; i < m; i++) cin >> b[i];

	vector<ll> res = multiply(a, b);
	ll ans = 0;
	for (int i = 0; i < n + m - 1; i++) ans ^= res[i];
	cout << ans << '\n';
	return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	3 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	3 ms	460 KB	Output is correct
7	Correct	3 ms	460 KB	Output is correct
8	Correct	4 ms	460 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	3232 KB	Output is correct
2	Correct	373 ms	23016 KB	Output is correct
3	Correct	391 ms	22892 KB	Output is correct
4	Correct	332 ms	22968 KB	Output is correct
5	Correct	324 ms	22956 KB	Output is correct
6	Correct	325 ms	22964 KB	Output is correct
7	Correct	334 ms	22944 KB	Output is correct
8	Correct	387 ms	22956 KB	Output is correct

Subtask #3

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	688 ms	45716 KB	Output isn't correct
2	Halted	0 ms	0 KB	-