oj.uz

Submission #526068

# Submission time Handle Problem Language Result Execution time Memory
526068 2022-02-13T16:27:20 Z eric00513 씽크스몰 (kriii3_TT) C++17
20 / 30
 109 ms 24908 KB 
#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<double>;

const 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) {
		double ang = 2 * PI / len * (inv ? -1 : 1);
		base wlen(cos(ang), sin(ang));
		for (int i = 0; i < n; i += len) {
			base w(1);
			for (int j = 0; j < len / 2; j++) {
				base u = a[i + j], v = a[i + j + len / 2] * w;
				a[i + j] = u + v;
				a[i + j + len / 2] = u - v;
				w *= wlen;
			}
		}
	}
	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 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1884 KB Output is correct
2 Correct 43 ms 12920 KB Output is correct
3 Correct 43 ms 12868 KB Output is correct
4 Correct 46 ms 13116 KB Output is correct
5 Correct 47 ms 13124 KB Output is correct
6 Correct 49 ms 13124 KB Output is correct
7 Correct 48 ms 13108 KB Output is correct
8 Correct 49 ms 13380 KB Output is correct

Subtask #3
0 / 10.0

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