# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745793 | vjudge1 | Fancy Fence (CEOI20_fancyfence) | C++14 | 1077 ms | 296 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 +7;
int binpow(int a, int b){
int ans = 1;
while(b != 0){
if(b & 1){
ans = ans * a % MOD;
}
a = a * a % MOD;
b /= 2;
}
return ans;
}
signed main() {
int n;
cin >> n;
vector<int> h(n), w(n);
int cnt = 0;
for(int i = 0; i < n; i++){
cin >> h[i];
}
for(int i = 0; i < n; i++){
cin >> w[i];
}
int dv = binpow(2, MOD - 2);
int ans = 0;
for(int i = 0; i < n; i++){
for(int j = 1; j <= h[i]; j++){
int k = i;
while(k < n - 1 && h[k + 1] >= j){
k++;
}
k = k - i + 1;
ans = (ans + j * k) % MOD;
}
}
cout << ans << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |