Submission #1510916

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=j; i<=k; i++)
#define FFOR(i, j, k) for(int i=j; i<k; i++)
#define DFOR(i, j, k) for(int i=j; i>=k; i--)
#define bug(x) cerr<<#x<<" = "<<x<<'\n'
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
template <typename T> inline void read(T &x){
    char c;
    bool nega=0;
    while((!isdigit(c=getchar()))&&(c!='-'));
    if(c=='-'){
        nega=1;
        c=getchar();
    }
    x=c-48;
    while(isdigit(c=getchar())) x=x*10+c-48;
    if(nega) x=-x;
}
template <typename T> inline void writep(T x){
    if(x>9) writep(x/10);
    putchar(x%10+48);
}
template <typename T> inline void write(T x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    writep(x);
}
template <typename T> inline void writeln(T x){
    write(x);
    putchar('\n');
}
#define taskname "D"
const ll base=1000000007;
int n, m;
ll x[100001];
ll y[100001];
int main(){
    #ifdef Megumin
        if(fopen(taskname".inp", "r"))
            freopen(taskname".inp", "r", stdin);
    #endif // Megumin
    read(n);
    read(m);
    FOR(i, 1, n) read(x[i]);
    FOR(i, 1, m) read(y[i]);
    x[0]=x[1];
    FOR(i, 1, n) x[0]=min(x[0], x[i]);
    FOR(i, 1, n) x[i]-=x[0];
    y[0]=y[1];
    FOR(i, 1, m) y[0]=min(y[0], y[i]);
    FOR(i, 1, m) y[i]-=y[0];
    sort(x+1, x+n+1);
    sort(y+1, y+m+1);
    ll ansx=0;
    FOR(i, 1, n) ansx=(ansx+x[i]*((i-1)-(n-i)))%base;
    ansx+=base;
    ll ansy=0;
    FOR(i, 1, m) ansy=(ansy+y[i]*((i-1)-(m-i)))%base;
    ansy+=base;
    writeln((ansx*ansy)%base);
}

Submission Info

Judge Result