Submission #74688813

Source Code Expand

MOD = 998244353

n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

pref_a = [0] * (n+1)
for i in range(n):
    pref_a[i+1] = (pref_a[i] + a[i]) % MOD

sum_ai = 0
for i in range(n):
    sum_ai += (a[i] * (i+1))
    sum_ai %= MOD

ans = 0
for i in range(1, m+1):
    sum_floor = 0
    for j in range(1, n // i + 1):
        l = j * i
        r = min(n, (j+1) * i - 1)
        sum_range = (pref_a[r] - pref_a[l-1]) % MOD
        sum_floor = (sum_floor + j * sum_range) % MOD
        
    term = (sum_ai - i * sum_floor) % MOD
    ans += b[i-1] * term
    ans %= MOD

print(ans)

Submission Info

Submission Time
Task E - You WILL Like Sigma Problem
User gett
Language Python (PyPy 3.11-v7.3.20)
Score 450
Code Size 658 Byte
Status AC
Exec Time 257 ms
Memory 267536 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 450 / 450
Status
AC × 2
AC × 22
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt
All 00-sample-01.txt, 00-sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 56 ms 79456 KiB
00-sample-02.txt AC 57 ms 79724 KiB
01-01.txt AC 57 ms 79420 KiB
01-02.txt AC 56 ms 79396 KiB
01-03.txt AC 56 ms 79520 KiB
01-04.txt AC 76 ms 96368 KiB
01-05.txt AC 75 ms 97400 KiB
01-06.txt AC 75 ms 97340 KiB
01-07.txt AC 75 ms 97260 KiB
01-08.txt AC 75 ms 97284 KiB
01-09.txt AC 256 ms 267528 KiB
01-10.txt AC 252 ms 266996 KiB
01-11.txt AC 134 ms 174984 KiB
01-12.txt AC 134 ms 174688 KiB
01-13.txt AC 135 ms 174624 KiB
01-14.txt AC 157 ms 186232 KiB
01-15.txt AC 257 ms 267536 KiB
01-16.txt AC 257 ms 267268 KiB
01-17.txt AC 256 ms 267156 KiB
01-18.txt AC 255 ms 267232 KiB
01-19.txt AC 142 ms 178924 KiB
01-20.txt AC 193 ms 191496 KiB