Submission #1515305
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> P; typedef long long int LL; #define MOD 1000000007 int main() { int n, m; cin >> n >> m; vector<LL> x(n), y(m); for (int i = 0; i < n; i++) { cin >> x[i]; } for (int i = 0; i < m; i++) { cin >> y[i]; } LL lx = 0, ly = 0; for (int i = 0; i < n - 1; i++) { lx += (x[i + 1] - x[i]) * (i + 1) * (n - 1 - i); lx %= MOD; } for (int i = 0; i < m - 1; i++) { ly += (y[i + 1] - y[i]) * (i + 1) * (m - 1 - i); ly %= MOD; } cout << lx * ly % MOD << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | takaten |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 669 Byte |
Status | AC |
Exec Time | 88 ms |
Memory | 1920 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 | 84 ms | 1792 KB |
rndF.txt | AC | 84 ms | 1920 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 |