Submission #946063

#TimeUsernameProblemLanguageResultExecution timeMemory
946063hmm789Fancy Fence (CEOI20_fancyfence)C++14
30 / 100
29 ms3572 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define INF 1000000000000000000 #define MOD 1000000007 int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int h[n], w[n], dp[n]; for(int i = 0; i < n; i++) cin >> h[i]; for(int i = 0; i < n; i++) cin >> w[i]; int pre[n]; pre[0] = 0; for(int i = 0; i < n-1; i++) { int num = h[i]*(h[i]+1)/2 % MOD; pre[i+1] = pre[i] + w[i]*num % MOD; pre[i+1] %= MOD; } for(int i = 0; i < n; i++) { int num = (w[i]+1)*w[i]/2 % MOD, num2 = (h[i]+1)*h[i]/2 % MOD; dp[i] = num * num2 % MOD + (i==0?0:dp[i-1]) + (w[i]*pre[i]) % MOD; dp[i] %= MOD; } cout << dp[n-1]; }
#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...