This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
#define MOD 1000000007
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
int h[n], w[n], dp[n];
for(int i = 0; i < n; i++) cin >> h[i];
for(int i = 0; i < n; i++) cin >> w[i];
for(int i = 0; i < n; i++) {
int num = (w[i]+1)*w[i]/2 % MOD, num2 = (h[i]+1)*h[i]/2 % MOD;
dp[i] = num * num2 % MOD + (i==0?0:dp[i-1]);
int mn = h[i];
for(int j = i-1; j >= 0; j--) {
mn = min(mn, h[j]);
num = w[i]*w[j] % MOD;
num2 = (mn+1)*mn/2 % MOD;
dp[i] += num * num2 % MOD;
dp[i] %= MOD;
}
}
cout << dp[n-1];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |