Submission #791348

#TimeUsernameProblemLanguageResultExecution timeMemory
791348ttamxFancy Fence (CEOI20_fancyfence)C++14
0 / 100
4 ms352 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N=1e5+5; const ll mod=1e9+7; const ll inv2=5e8+4; int n; ll h[N],w[N]; ll ans; int main(){ cin.tie(nullptr)->sync_with_stdio(false); cin >> n; for(int i=1;i<=n;i++)cin >> h[i]; for(int i=1;i<=n;i++)cin >> w[i]; for(int i=1;i<=n;i++){ ll rmq=h[i]; ans+=h[i]*w[i]; ans%=mod; for(int j=i;j>=1;j--){ rmq=min(rmq,h[j]); ans+=rmq*rmq*w[i]%mod*w[j]%mod; ans%=mod; } } cout << ans*inv2%mod; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...