#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9+7, INV = 250000002;
int mod(int n) {
return (n + 3 * MOD) % MOD;
}
int f(int n, int m) {
n = mod(n), m = mod(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, temp;
for(int i = 0; i < n; i++) {
int minH = h[i], sumW = w[i];
res = mod(res + f(minH, sumW));
for(int j = i+1; j < n; j++) {
minH = min(minH, h[i]), sumW = mod(sumW + w[j]);
temp = f(minH, sumW);
temp -= mod(f(minH, sumW - w[j]) + f(minH, sumW - w[i]));
temp = mod(temp);
temp += f(minH, sumW - w[i] - w[j]);
res = mod(res + temp);
}
}
cout << res << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
19 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
19 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
348 KB |
Output is correct |
2 |
Execution timed out |
1045 ms |
344 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
20 ms |
344 KB |
Output is correct |
3 |
Execution timed out |
1034 ms |
344 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
19 ms |
344 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 |
19 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |