Submission #963036

#TimeUsernameProblemLanguageResultExecution timeMemory
963036antonFancy Fence (CEOI20_fancyfence)C++17
0 / 100
1 ms504 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> const int MAX_N = 1e5+1; const int mod =1e9+7; int h[MAX_N]; int w[MAX_N]; int nbp(int u){ return (u*(u+1LL)/2LL)%mod; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin>>n; int sw = 0; for(int i = 0; i<n; i++){ cin>>h[i]; } for(int i = 0; i<n; i++){ cin>>w[i]; sw = (sw+w[i])%mod; } h[n] = 0; int res= 0; res= nbp(sw); int prev_end = 0; int pref= 0; for(int i = 0; i<=n; i++){ if(h[i] <= 1){ res = (res+ 2*nbp(pref-prev_end))%mod; prev_end = pref+w[i]; } pref += w[i]; } cout<<res<<endl; }
#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...