Submission #921466

#TimeUsernameProblemLanguageResultExecution timeMemory
921466AlebnFancy Fence (CEOI20_fancyfence)C++14
15 / 100
61 ms3924 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int MOD = 1e9+7, INV = 250000002; int calc(int n, int m) { return n*m%MOD*(n+1)%MOD*(m+1)%MOD*INV%MOD; } signed main() { int n; cin >> n; vector<int> h(n), w(n); int sum = 0; for(int i = 0; i < n; i++) cin >> h[i]; for(int i = 0; i < n; i++) { cin >> w[i]; sum = (sum + w[i]) % MOD; } cout << calc(h[0], sum) << "\n"; }
#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...