#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9+7, INV = 250000002;
int f(int n, int m) {
return n * m % MOD * (n + 1) % MOD * (m + 1) % MOD * INV % MOD;
}
signed main() {
//input and sum
int n;
cin >> n;
vector<int> h(n), w(n);
for(int i = 0; i < n; i++) cin >> h[i];
for(int i = 0; i < n; i++) cin >> w[i];
//linearily go over and compute result
int res = 0;
for(int i = 0; i < n; i++) {
int minH = h[i], sumW = w[i];
res = (res + f(minH, sumW)) % MOD;
for(int j = i+1; j < n; j++) {
minH = min(minH, h[i]), sumW += w[j];
res = (res + f(minH, sumW) - f(minH, sumW - w[j]) - f(minH, sumW - w[i]) + f(minH, sumW - w[i] - w[j])) % MOD;
if(res < 0) res += MOD;
}
}
cout << res << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
15 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
356 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
14 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
15 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
15 ms |
464 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
17 ms |
600 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
15 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |