Submission #1443442
Source Code Expand
#include <iostream> #define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++) #define MOD(i) ((i) % 1000000007LL) using namespace std; typedef long long ll; int N, M; ll X[100000], Y[100000]; int main(void) { cin >> N >> M; REP(i, 0, N) cin >> X[i]; REP(i, 0, M) cin >> Y[i]; ll p = 0; REP(i, 0, N - 1) { ll n = MOD(((ll) i + 1) * ((ll) N - i - 1)); ll x = MOD(X[i + 1] - X[i]); p = MOD(p + MOD(n * x)); } ll q = 0; REP(j, 0, M - 1) { ll m = MOD(((ll) j + 1) * ((ll) M - j - 1)); ll y = MOD(Y[j + 1] - Y[j]); q = MOD(q + MOD(m * y)); } cout << MOD(p * q) << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | kshinya |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 651 Byte |
Status | AC |
Exec Time | 88 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt |
All | 0_000.txt, 0_001.txt, max.txt, min.txt, mod.txt, n2.txt, rndA.txt, rndB.txt, rndC.txt, rndD.txt, rndE.txt, rndF.txt, rndG.txt, rndH.txt, rndI.txt, rndJ.txt, var.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
max.txt | AC | 88 ms | 1792 KB |
min.txt | AC | 1 ms | 256 KB |
mod.txt | AC | 43 ms | 1024 KB |
n2.txt | AC | 43 ms | 1024 KB |
rndA.txt | AC | 84 ms | 1792 KB |
rndB.txt | AC | 84 ms | 1792 KB |
rndC.txt | AC | 84 ms | 1792 KB |
rndD.txt | AC | 84 ms | 1792 KB |
rndE.txt | AC | 85 ms | 1792 KB |
rndF.txt | AC | 84 ms | 1792 KB |
rndG.txt | AC | 84 ms | 1792 KB |
rndH.txt | AC | 84 ms | 1792 KB |
rndI.txt | AC | 84 ms | 1792 KB |
rndJ.txt | AC | 84 ms | 1792 KB |
var.txt | AC | 83 ms | 1792 KB |