Submission #1972254
Source Code Expand
#include <iostream> #include <string.h> #include <algorithm> #include <vector> #include <queue> using namespace std; typedef long long ll; const int INF=1000000; ll x[100001],y[100001]; ll x2[100001]={}; ll y2[100001]={}; int main() { int n,m; cin>>n>>m; for(int i=1;i<=n;++i){ cin>>x[i]; x2[i]=x2[i-1]+x[i]; } for(int i=1;i<=m;++i){ cin>>y[i]; y2[i]=y2[i-1]+y[i]; } ll r=0; ll x3=0,y3=0; for(int i=1;i<n;++i)x3=(x3+x2[n]-x2[i]-x[i]*(n-i))%1000000007; for(int i=1;i<m;++i)y3=(y3+y2[m]-y2[i]-y[i]*(m-i))%1000000007; cout<<(x3*y3)%1000000007<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | peejee0904 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 612 Byte |
Status | AC |
Exec Time | 93 ms |
Memory | 3328 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 | 93 ms | 3328 KB |
min.txt | AC | 1 ms | 256 KB |
mod.txt | AC | 43 ms | 1792 KB |
n2.txt | AC | 43 ms | 1792 KB |
rndA.txt | AC | 84 ms | 3328 KB |
rndB.txt | AC | 84 ms | 3328 KB |
rndC.txt | AC | 84 ms | 3328 KB |
rndD.txt | AC | 84 ms | 3328 KB |
rndE.txt | AC | 84 ms | 3328 KB |
rndF.txt | AC | 84 ms | 3328 KB |
rndG.txt | AC | 84 ms | 3328 KB |
rndH.txt | AC | 84 ms | 3328 KB |
rndI.txt | AC | 84 ms | 3328 KB |
rndJ.txt | AC | 84 ms | 3328 KB |
var.txt | AC | 82 ms | 3328 KB |