# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
746946 | vjudge1 | Fancy Fence (CEOI20_fancyfence) | C++17 | 161 ms | 16336 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;
typedef long long ll;
const ll mod = 1e9 + 7;
ll solve_rect(ll h, ll w) {
h %= mod;
w %= mod;
ll hc = (h * (h + 1) / 2) % mod;
ll wc = (w * (w + 1) / 2) % mod;
return (hc * wc) % mod;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
set<pair<ll, int>> height_index_set;
map<int, pair<ll, ll>> index_dim_map;
height_index_set.insert({0, -1});
height_index_set.insert({0, n});
index_dim_map[-1] = {0, 0};
index_dim_map[n] = {0, 0};
{
vector<ll> hv(n), wv(n);
for (ll& h : hv) cin >> h;
for (ll& w : wv) cin >> w;
for (int i = 0; i < n; i++) {
# | 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... |