#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXN 100010
#define MOD 1000000007
using namespace std;
ll two=500000004; //inv
ll n, dp[MAXN], pos[MAXN], h[MAXN], w[MAXN], pref[MAXN], cnt[MAXN], ress;
ll add(ll x, ll y)
{
ll ret=x+y;
if (ret>=MOD) ret-=MOD;
return ret;
}
ll mul(ll x, ll y)
{
ll ret=x*y;
if (ret>=MOD) ret%=MOD;
return ret;
}
ll sub(ll x, ll y)
{
ll ret=x-y;
if (ret<0) ret+=MOD;
return ret;
}
ll sum(ll x, ll y)
{
ll ret=mul(mul(y, y+1), two);
ret-=mul(mul(x-1, x), two);
if (ret<0) ret+=MOD;
return ret;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n;
for (int i=1; i<=n; i++) cin>>h[i];
for (int i=1; i<=n; i++) cin>>w[i];
stack<pii> st;
st.push({-1, 0});
for (int i=1; i<=n; i++)
{
while (st.top().xx>h[i]) st.pop();
pos[i]=st.top().yy;
st.push({h[i], i});
}
pref[0]=0;
for (int i=1; i<=n; i++) pref[i]=add(pref[i-1], w[i]);
ll x, y;
cnt[1]=sum(1, h[1]);
for (int i=2; i<=n; i++)
{
int ind=pos[i];
cnt[i]=cnt[ind];
cnt[i]=add(cnt[i], sum(1, h[i]));
x=pref[i-1]-pref[ind];
y=sum(1, h[i]);
ll pom=mul(x, y);
cnt[i]=add(cnt[i], pom);
}
dp[1]=mul(sum(1, w[1]), sum(1, h[1]));
for (int i=2; i<=n; i++)
{
int ind=pos[i];
dp[i]=mul(cnt[i], w[i]);
dp[i]=sub(dp[i], mul(w[i], sum(1, h[i])));
x=sum(1, w[i]);
y=sum(1, h[i]);
dp[i]=add(dp[i], mul(x, y));
}
for (int i=1; i<=n; i++) { ress=add(dp[i], ress); /*cout<<cnt[i]<<" "<<dp[i]<<endl;*/ }
//cout<<endl;
cout<<ress;
}
/*
3
1 2 1
1 2 3
*/
Compilation message
fancyfence.cpp: In function 'int main()':
fancyfence.cpp:82:13: warning: unused variable 'ind' [-Wunused-variable]
82 | int ind=pos[i];
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
324 KB |
Output is correct |
2 |
Incorrect |
1 ms |
460 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
296 KB |
Output is correct |
2 |
Correct |
0 ms |
316 KB |
Output is correct |
3 |
Correct |
0 ms |
316 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
316 KB |
Output is correct |
2 |
Incorrect |
1 ms |
328 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
312 KB |
Output is correct |
2 |
Incorrect |
1 ms |
356 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Incorrect |
1 ms |
352 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
324 KB |
Output is correct |
2 |
Incorrect |
1 ms |
460 KB |
Output isn't correct |