oj.uz

Submission #746946

# Submission time Handle Problem Language Result Execution time Memory
746946 2023-05-23T09:12:14 Z vjudge1 Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 161 ms 16336 KB 
#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++) {
      if (i != n + 1 && hv[i] == hv[i + 1]) {
        wv[i + 1] += wv[i];
        continue;
      }
      index_dim_map[i] = {hv[i], wv[i]};
      height_index_set.insert({-hv[i], i});
    }
  }
  ll res = 0;

  while (height_index_set.size() > 1) {
    auto _it = height_index_set.begin();
    int ind_curr = _it->second;
    height_index_set.erase(_it);

    // should always be the iterator at key ind_curr
    auto curr_it = index_dim_map.lower_bound(ind_curr);
    auto& [h_curr, w_curr] = index_dim_map[ind_curr];
    assert(curr_it->first == ind_curr);

    auto next_it = curr_it;
    next_it++;
    auto& [h_next, w_next] = next_it->second;

    auto prev_it = curr_it;
    prev_it--;
    auto& [h_prev, w_prev] = prev_it->second;

    assert(h_curr > h_prev);
    assert(h_curr > h_next);

    res += solve_rect(h_curr, w_curr);
    res %= mod;

    if (h_prev > h_next) {
      res -= solve_rect(h_prev, w_curr);
      res += mod;
      res %= mod;
      w_prev += w_curr;
      w_prev %= mod;
    }
    else if (h_next > h_prev) {
      res -= solve_rect(h_next, w_curr);
      res += mod;
      res %= mod;
      w_next += w_curr;
      w_next %= mod;
    }
    else {
      res -= solve_rect(h_prev, w_curr);
      res += mod;
      res %= mod;
      w_prev += w_curr + w_next;
      w_prev %= mod;
      height_index_set.erase({-h_next, next_it->first});
      index_dim_map.erase(next_it);
    }
    index_dim_map.erase(curr_it);
  }
  assert(height_index_set.size() == 1);
  assert(index_dim_map.size() == 1);
  cout << res;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 460 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 24 ms 4680 KB Output is correct
4 Correct 35 ms 6992 KB Output is correct
5 Correct 42 ms 9036 KB Output is correct
6 Correct 24 ms 5188 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 11 ms 2004 KB Output is correct
4 Correct 21 ms 3808 KB Output is correct
5 Correct 25 ms 3924 KB Output is correct
6 Correct 1 ms 316 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 12 ms 1984 KB Output is correct
5 Correct 22 ms 3784 KB Output is correct
6 Correct 28 ms 3932 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 9 ms 1872 KB Output is correct
9 Correct 20 ms 4472 KB Output is correct
10 Correct 82 ms 16200 KB Output is correct
11 Correct 73 ms 16220 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 224 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 488 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 212 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 20 ms 4632 KB Output is correct
12 Correct 31 ms 7032 KB Output is correct
13 Correct 38 ms 9004 KB Output is correct
14 Correct 23 ms 5224 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 584 KB Output is correct
17 Correct 11 ms 2000 KB Output is correct
18 Correct 24 ms 3800 KB Output is correct
19 Correct 23 ms 3924 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 7 ms 1820 KB Output is correct
22 Correct 18 ms 4552 KB Output is correct
23 Correct 70 ms 16132 KB Output is correct
24 Correct 77 ms 16280 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 10 ms 1876 KB Output is correct
31 Correct 9 ms 1868 KB Output is correct
32 Correct 65 ms 8128 KB Output is correct
33 Correct 54 ms 8256 KB Output is correct
34 Correct 135 ms 16076 KB Output is correct
35 Correct 116 ms 15948 KB Output is correct
36 Correct 159 ms 16260 KB Output is correct
37 Correct 154 ms 16228 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 161 ms 16336 KB Output is correct
40 Correct 104 ms 16256 KB Output is correct
41 Correct 87 ms 16328 KB Output is correct
42 Correct 76 ms 16284 KB Output is correct