Submission #1972217
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; int main() { int n,m; ll x[100001],y[100001]; cin>>n>>m; for(int i=0;i<n;++i)cin>>x[i]; for(int i=0;i<m;++i)cin>>y[i]; ll r=0; for(int i=0;i<n;++i){ for(int j=i+1;j<n;++j){ for(int k=0;k<m;++k){ for(int l=k+1;l<m;++l){ r=(r+(x[j]-x[i])*(y[l]-y[k]))%1000000007; } } } } cout<<r<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | peejee0904 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 522 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | TLE | 2103 ms | 1792 KB |
min.txt | AC | 1 ms | 256 KB |
mod.txt | TLE | 2103 ms | 1024 KB |
n2.txt | TLE | 2103 ms | 1024 KB |
rndA.txt | TLE | 2103 ms | 1792 KB |
rndB.txt | TLE | 2103 ms | 1792 KB |
rndC.txt | TLE | 2103 ms | 1792 KB |
rndD.txt | TLE | 2103 ms | 1792 KB |
rndE.txt | TLE | 2103 ms | 1792 KB |
rndF.txt | TLE | 2103 ms | 1792 KB |
rndG.txt | TLE | 2103 ms | 1792 KB |
rndH.txt | TLE | 2103 ms | 1792 KB |
rndI.txt | TLE | 2103 ms | 1792 KB |
rndJ.txt | TLE | 2103 ms | 1792 KB |
var.txt | TLE | 2103 ms | 1792 KB |