Submission #2525675
Source Code Expand
#include<iostream> #include<algorithm> #include<queue> using namespace std; int const MAX = 100005; long long const MOD = 1000000007; long long x[MAX], y[MAX]; long long mod_p(long long a, long long b) { return (a + b + 2 * MOD) % MOD; } long long mod_m(long long a, long long b) { return (a%MOD)*(b%MOD) % MOD; } long long func(long long p[], long long n) { long long ans = 0; for (int i = 1; i <= n; i++) { long long value = mod_m(n + 1 - 2 * i,p[i]); ans = mod_p(value, ans); } return ans; } int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> x[i]; } for (int j = 1; j <= m; j++) { cin >> y[j]; } cout << (func(x, n) * func(y, m)) % MOD << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | nejineji |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 739 Byte |
Status | AC |
Exec Time | 88 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 | 88 ms | 1792 KB |
min.txt | AC | 1 ms | 256 KB |
mod.txt | AC | 42 ms | 1024 KB |
n2.txt | AC | 42 ms | 1024 KB |
rndA.txt | AC | 84 ms | 1792 KB |
rndB.txt | AC | 83 ms | 1792 KB |
rndC.txt | AC | 83 ms | 1792 KB |
rndD.txt | AC | 83 ms | 1792 KB |
rndE.txt | AC | 84 ms | 1792 KB |
rndF.txt | AC | 83 ms | 1792 KB |
rndG.txt | AC | 84 ms | 1792 KB |
rndH.txt | AC | 84 ms | 1792 KB |
rndI.txt | AC | 83 ms | 1792 KB |
rndJ.txt | AC | 84 ms | 1792 KB |
var.txt | AC | 82 ms | 1792 KB |