Submission #74689048

---

Source Code Expand

/**
 * @brief 南理工吊车尾的通用模板
 * @author Njust_jisan
 * @date 2026-04-04
 */
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using pii = pair<int, int>;
using pll = pair<i64, i64>;

const int INF = 0x3f3f3f3f;
const i64 LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 998244353;

#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()

void fujikaze()
{
    i64 n, m;
    cin >> n >> m;
    vector<i64> a(n + 1), b(m + 1), pre(n + 1, 0);
    for (i64 i = 1; i <= n; i++)
    {
        cin >> a[i];
        a[i] %= MOD;
        pre[i] = (pre[i - 1] + a[i]) % MOD;
    }
    for (i64 i = 1; i <= m; i++)
    {
        cin >> b[i];
        b[i] %= MOD;
    }
    i64 sum1 = 0, sum2 = 0;
    for (i64 i = 1; i <= n; i++)
    {
        sum1 = (sum1 + a[i] * i % MOD) % MOD;
    }
    for (i64 i = 1; i <= m; i++)
    {
        sum2 = (sum2 + b[i]) % MOD;
    }
    i64 sum = sum1 * sum2 % MOD;
    for (i64 j = 1; j <= m; j++)
    {
        i64 temp = 0;
        for (i64 k = 1; k * j <= n; k++)
        {
            i64 l = k * j;
            i64 r = min(n, (k + 1) * j - 1);
            i64 su = (pre[r] - pre[l - 1]) % MOD;
            temp = (temp + k * su) % MOD;
        }
        i64 sub = (b[j] * j % MOD) * temp % MOD;
        sum = (sum - sub + MOD) % MOD;
    }
    cout << sum;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--)
    {
        fujikaze();
    }
    return 0;
}

Submission Info

Judge Result