Submission #1215950

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX_N = 100000;
const int MAX_M = 100000;
const int MOD = 1000000007;

int N, M, X[MAX_N], Y[MAX_M];

signed main()
{
	cin >> N >> M;
	for (int i = 0; i < N; i++)
	{
		cin >> X[i];
	}
	for (int i = 0; i < M; i++)
	{
		cin >> Y[i];
	}
	int sum = 0;
	for (int i = 0; i < N - 1; i++)
	{
		(sum += (X[i + 1] - X[i])*(i + 1)%MOD*(N - 1 - i)) %= MOD;
	}
	int ans = 0;
	for (int i = 0; i < M - 1; i++)
	{
		(ans += sum*(Y[i + 1] - Y[i])%MOD*(i + 1)%MOD*(M - 1 - i)) %= MOD;
	}
	printf("%lld\n", ans);
	return 0;
}

Submission Info

Judge Result