# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871403 | Trisanu_Das | Fancy Fence (CEOI20_fancyfence) | C++17 | 0 ms | 0 KiB |
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;
typedef long long ll;
int N, L;
ll h[100005], w[100005];
vector<ll> nh;
int main(){
cin >> n;
for(int i=0;i<N;i++) cin >> h[i];
for(int i=0;i<N;i++){
cin >> w[i];
for(int j=0;j<w[i];j++){
L++;
nh.push_back(h[i]);
}
}
ll ans=0;
for(int i=0;i<L;i++){
for(int j=0; j<=i; j++){
ll m=INT_MAX;
for(int k=j;k<=i;k++) m = min(m, nh[k]);
(ans += (m*(m+1))/2LL) %= 100000007;
}
}
cout << ans << '\n';
}