Submission #1515255

---

Source Code Expand

#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> t3;


#define X first
#define Y second
using namespace std;
typedef long long ll;
const ll inf = 1e18;

ll n;
pair<ll,ll> a[200005];

int main()
{
    ll n,m;
    cin >> n >> m;
    vector<ll> x(n);
    vector<ll> y(m);
    for(int i = 0;i < n;i++)
    {
        cin >> x[i];
    }
    for(int i = 0;i < m;i++)
    {
        cin >> y[i];
    }
    const ll mod = 1e9 + 7;
    ll w = 0;
    for(int i = 0;i < n;i++)
    {
        ll unit = x[i] * (i - (n - 1 - i));
        unit %= mod;
        w += unit;
        w %= mod;
    }
    ll h = 0;
    for(int i = 0;i < m;i++)
    {
        ll unit = y[i] * (i - (m - 1 - i));
        unit %= mod;
        h += unit;
        h %= mod;
    }
    ll s = (w * h) % mod;
    cout << s << endl;
    return 0;
}

Submission Info

Judge Result