Submission #74690545

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int Mod=998244353;
int n,m,a[500001],b[500001],p[500001];
signed main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=m;i++){
		cin>>b[i];
	}
	for(int i=1;i<=n;i++){
		p[i]=(p[i-1]+a[i])%Mod;
	}
	int ans=0,cnt=0;
	for(int i=1;i<=m;i++){
		ans=(ans+b[i])%Mod;
	}
	for(int i=1;i<=n;i++){
		cnt=(cnt+a[i]*i)%Mod;
	}
	cnt=cnt*ans%Mod;
	int ans2=0;
    for(int j=1;j<=m;j++){
        int sum=0;
        for(int k=1;k*j<=n;k++){
            int l=k*j;
            int r=min(n,(k+1)*j-1);
            int t=(p[r]-p[l-1]+Mod)%Mod;
            sum=(sum+k*t)%Mod;
        }
        ans2=(ans2+b[j]*j%Mod*sum)%Mod;
    }
    cout<<(cnt-ans2+Mod)%Mod;
}

Submission Info

Submission Time
Task E - You WILL Like Sigma Problem
User ywrow
Language C++23 (GCC 15.2.0)
Score 450
Code Size 775 Byte
Status AC
Exec Time 228 ms
Memory 15388 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 1 ms 3392 KiB
00-sample-02.txt AC 1 ms 3472 KiB
01-01.txt AC 1 ms 3644 KiB
01-02.txt AC 1 ms 3568 KiB
01-03.txt AC 1 ms 3572 KiB
01-04.txt AC 3 ms 3512 KiB
01-05.txt AC 3 ms 3668 KiB
01-06.txt AC 3 ms 3528 KiB
01-07.txt AC 3 ms 3540 KiB
01-08.txt AC 3 ms 3640 KiB
01-09.txt AC 228 ms 15176 KiB
01-10.txt AC 226 ms 15244 KiB
01-11.txt AC 100 ms 7568 KiB
01-12.txt AC 94 ms 7380 KiB
01-13.txt AC 94 ms 7536 KiB
01-14.txt AC 113 ms 8656 KiB
01-15.txt AC 215 ms 15160 KiB
01-16.txt AC 215 ms 15160 KiB
01-17.txt AC 216 ms 15248 KiB
01-18.txt AC 215 ms 15388 KiB
01-19.txt AC 97 ms 11420 KiB
01-20.txt AC 136 ms 12048 KiB