| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1282889 | red_souls | Fancy Fence (CEOI20_fancyfence) | C++20 | 3 ms | 576 KiB |
#include <bits/stdc++.h>
#define ll long long
#define task "Histogram"
using namespace std;
const int N = 1e5 + 16;
const ll INF = 1e18, mod = 1e9 + 7;
int n;
ll w[N], h[N];
namespace sub6 {
ll result;
void solve() {
for (int i = 1; i <= n; i++) {
ll minH = h[i], sumW = w[i];
ll cntW = w[i] * (w[i] + 1) >> 1;
ll cntH = h[i] * (h[i] + 1) >> 1;
result = (result + cntW * cntH % mod) % mod;
for (int j = i - 1; j >= 1; j--) {
minH = min(minH, h[j]);
result = (result + sumW * minH % mod) % mod;
sumW += w[j];
}
}
cout << result;
}
}
int main() {
ios_base :: sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
for (int i = 1; i <= n; i++) {
cin >> w[i];
}
sub6 :: solve();
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... | ||||
