Submission #3589067
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int main(){ int n, m; cin >> n >> m; long long x[n], y[m]; for(int i = 0; i < n; i++) cin >> x[i]; for(int i = 0; i < m; i++) cin >> y[i]; long long sum1 = 0, sum2 = 0; for(int k = 1; k <= n; k++){ sum1 += (k - 1) * x[k-1] - (n - k) * x[k-1]; sum1 %= mod; } for(int k = 1; k <= m; k++){ sum2 += (k - 1) * y[k-1] - (m - k) * y[k-1]; sum2 %= mod; } cout << (sum1 * sum2) % mod << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | swkfn |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 571 Byte |
Status | AC |
Exec Time | 89 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 | 89 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 | 85 ms | 1792 KB |
rndC.txt | AC | 86 ms | 1792 KB |
rndD.txt | AC | 85 ms | 1792 KB |
rndE.txt | AC | 85 ms | 1792 KB |
rndF.txt | AC | 85 ms | 1792 KB |
rndG.txt | AC | 85 ms | 1792 KB |
rndH.txt | AC | 85 ms | 1792 KB |
rndI.txt | AC | 85 ms | 1792 KB |
rndJ.txt | AC | 85 ms | 1792 KB |
var.txt | AC | 83 ms | 1792 KB |