Submission #74675157

Source Code Expand

#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,m,ans,da,db;
int a[500050]; int b[500050];
int mm = 998244353;
signed main(){
	scanf("%lld%lld",&n,&m);
	for (int i = 1; i <= n; i++){
		scanf("%lld",&a[i]);
	}
	for (int i = 1; i <= m; i++){
		scanf("%lld",&b[i]);
	}
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			ans %= mm;
			ans += (((a[i]*b[j])%mm)*(i%j))%mm; 
		}
	}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task E - You WILL Like Sigma Problem
User Wilfredtomato
Language C++23 (GCC 15.2.0)
Score 0
Code Size 477 Byte
Status WA
Exec Time > 2000 ms
Memory 11252 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 450
Status
AC × 2
AC × 10
WA × 4
TLE × 8
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 3708 KiB
00-sample-02.txt AC 1 ms 3688 KiB
01-01.txt AC 1 ms 3604 KiB
01-02.txt AC 1 ms 3664 KiB
01-03.txt AC 1 ms 3652 KiB
01-04.txt AC 95 ms 3920 KiB
01-05.txt AC 114 ms 3792 KiB
01-06.txt WA 114 ms 3816 KiB
01-07.txt WA 115 ms 3836 KiB
01-08.txt WA 115 ms 3796 KiB
01-09.txt TLE > 2000 ms 11248 KiB
01-10.txt TLE > 2000 ms 11180 KiB
01-11.txt AC 31 ms 7600 KiB
01-12.txt WA 33 ms 7760 KiB
01-13.txt AC 130 ms 7728 KiB
01-14.txt TLE > 2000 ms 8032 KiB
01-15.txt TLE > 2000 ms 11056 KiB
01-16.txt TLE > 2000 ms 11172 KiB
01-17.txt TLE > 2000 ms 11232 KiB
01-18.txt TLE > 2000 ms 11252 KiB
01-19.txt AC 30 ms 7764 KiB
01-20.txt TLE > 2000 ms 7988 KiB