Submission #2210892
Source Code Expand
#include <iostream> using namespace std; typedef long long int lli; const lli MOD = 1e9 + 7; int main() { int n, m; cin >> n >> m; lli x[100001], y[100001]; for (int i = 1;i <= n;i++) { cin >> x[i]; } for (int i = 1;i <= m;i++) { cin >> y[i]; } lli sumx = 0, sumy = 0; //x軸y軸で累積長さをとる for (int i = 1;i <= n - 1;i++) { sumx = (sumx + i*(n - i)*(x[i + 1] - x[i])) % MOD; } for (int i = 1;i <= m - 1;i++) { sumy = (sumy + i*(m - i)*(y[i + 1] - y[i])) % MOD; } lli ans; ans = (sumx*sumy) % MOD; cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | A - ι⊥l |
User | spawn |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 571 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, A.txt, fever0.txt, fever7.txt, kure.txt, ma.txt, max.txt, nhk.txt, v.txt, xam.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | WA | 1 ms | 256 KB |
0_001.txt | WA | 1 ms | 256 KB |
0_002.txt | WA | 1 ms | 256 KB |
A.txt | WA | 1 ms | 256 KB |
fever0.txt | WA | 1 ms | 256 KB |
fever7.txt | WA | 1 ms | 256 KB |
kure.txt | WA | 1 ms | 256 KB |
ma.txt | WA | 1 ms | 256 KB |
max.txt | WA | 1 ms | 256 KB |
nhk.txt | WA | 1 ms | 256 KB |
v.txt | WA | 1 ms | 256 KB |
xam.txt | WA | 1 ms | 256 KB |