#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5;
const int MOD = 1e9 + 7;
int h[MAX_N], w[MAX_N], p[MAX_N];
vector<int> s;
int main() {
int n;
cin >> n;
for ( int i = 0; i < n; i++ )
cin >> h[i];
for ( int i = 0; i < n; i++ )
cin >> w[i];
int ans = 0, sum = 0;
for ( int i = 0; i < n; i++ ) {
while ( !s.empty() && h[i] <= h[s.back()] ) {
sum = (sum - (long long)h[i] * (h[i] + 1) / 2 % MOD * p[s.back()] % MOD + MOD) % MOD;
p[i] = (p[i] + p[s.back()]) % MOD;
s.pop_back();
}
s.push_back( i );
sum = (sum + (long long)h[i] * (h[i] + 1) / 2 % MOD * p[i] % MOD) % MOD;
ans = (ans + ((long long)h[i] * (h[i] + 1) / 2 % MOD) * ((long long)w[i] * (w[i] + 1) / 2) % MOD) % MOD;
ans = (ans + (long long)sum * w[i] % MOD) % MOD;
sum = (sum + (long long)h[i] * (h[i] + 1) / 2 % MOD * w[i] % MOD) % MOD;
cout << ans << "\n";
}
cout << ans << "\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |