Submission #2526083
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i,a,n) for (int i = a; i < (int)n; ++i) #define REP(i,n) FOR(i,0,n) #define whole(f,x,...) ([&](decltype((x)) whole) { \ return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x) template<typename T> bool chmin(T &a, const T &b) {if (a > b) { a = b; return true; }return false;} template<typename T> bool chmax(T &a, const T &b) {if (a < b) { a = b; return true; }return false;} using ll = int_fast64_t; constexpr ll INF = (1e9); constexpr ll MOD = (1e9+7); int main() { int n, m; cin >> n >> m; vector<ll> x(n); REP(i,n) cin >> x[i]; vector<ll> y(m); REP(i,m) cin >> y[i]; ll xsum = 0, ysum = 0; REP(i,n) xsum += (2*i-n+1)%MOD * x[i]%MOD; REP(i,m) ysum += (2*i-m+1)%MOD * y[i]%MOD; cout << xsum%MOD * (ysum%MOD) %MOD << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | sunao |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 848 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 | 84 ms | 1792 KB |
rndC.txt | AC | 85 ms | 1792 KB |
rndD.txt | AC | 84 ms | 1792 KB |
rndE.txt | AC | 84 ms | 1792 KB |
rndF.txt | AC | 84 ms | 1792 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 | 85 ms | 1792 KB |