提出 #39250016

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
const int N = 1 << 20 | 1;
int n, A[N], B[N], a[N], b[N], f[N], l = 1, s[N], ans;
int PLUS(int x, int y) { return (x += y) >= MOD ? x - MOD : x; }
int qpow(int x, int y) { int t = 1; for (; y; y>>=1) { if (y & 1) t = 1ll * t * x % MOD; x = 1ll * x * x % MOD; } return t; }
void NTT(int n, int *a, int o) {
	for (int i=0; i<n; i++)
		if (i < f[i]) swap(a[i], a[f[i]]);
	for (int i=1; i<n; i<<=1) {
		int g = qpow(3, (MOD - 1) / (i << 1));
		for (int j=0; j<n; j+=i<<1)
			for (int k=j, gi=1; k<j+i; k++, gi=1ll*gi*g%MOD) {
				int _ = 1ll * a[k+i] * gi % MOD;
				a[k+i] = PLUS(a[k], MOD - _), a[k] = PLUS(a[k], _);
			}
	}
	if (o) {
		reverse (a+1, a+n);
		int inv = qpow(n, MOD - 2);
		for (int i=0; i<n; i++) a[i] = 1ll * a[i] * inv % MOD;
	}
}
int main() {
	cin >> n;
	for (int i=0; i<n; i++) scanf ("%d", &A[i]);
	for (int i=0; i<n; i++) scanf ("%d", &B[i]);
	reverse (B, B+n);
	while (l <= n - 1 << 1) l <<= 1;
	for (int i=1; i<l; i++) f[i] = f[i>>1] >> 1 | (i & 1 ? l >> 1 : 0);
	for (int t=0; t<5; t++) {
		for (int i=0; i<n; i++) a[i] = A[i] >> t & 1 ^ 1, b[i] = B[i] >> t & 1 ^ 1;
		for (int i=n; i<l; i++) a[i] = b[i] = 0;
		NTT(l, a, 0), NTT(l, b, 0);
		for (int i=0; i<l; i++) a[i] = 1ll * a[i] * b[i] % MOD;
		NTT(l, a, 1);
		for (int i=n; i<l; i++) a[i%n] += a[i];
		for (int i=0; i<n; i++) s[i] += n - a[i] << t;
	}
	for (int i=0; i<n; i++) ans = max(ans, s[i]);
	cout << ans;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:16: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses]
   30 |  while (l <= n - 1 << 1) l <<= 1;
      |              ~~^~~
./Main.cpp:33:44: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
   33 |   for (int i=0; i<n; i++) a[i] = A[i] >> t & 1 ^ 1, b[i] = B[i] >> t & 1 ^ 1;
      |                                  ~~~~~~~~~~^~~
./Main.cpp:33:70: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
   33 |   for (int i=0; i<n; i++) a[i] = A[i] >> t & 1 ^ 1, b[i] = B[i] >> t & 1 ^ 1;
      |                                                            ~~~~~~~~~~^~~
./Main.cpp:39:37: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses]
   39 |   for (int i=0; i<n; i++) s[i] += n - a[i] << t;
      |                                   ~~^~~~~~
./Main.cpp:27:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   27 |  for (int i=0; i<n; i++) scanf ("%d", &A[i]);
      |                          ~~~~~~^~~~~~~~~~~~~
./Main.cpp:28:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   28 |  for (int i=0; i<n; i++) scanf ("%d", &B[i]);
      |                          ~~~~~~^~~~~~~~~~~~~

ジャッジ結果