# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871402 | 2023-11-10T17:38:17 Z | Trisanu_Das | Fancy Fence (CEOI20_fancyfence) | C++17 | 0 ms | 0 KB |
#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=INF; for(int k=j;k<=i;k++) m = min(m, nh[k]); ans += (m*(m+1))/2LL; ans %= MOD; } } cout << ans << '\n'; }