oj.uz

Submission #981969

# Submission time Handle Problem Language Result Execution time Memory
981969 2024-05-13T17:24:46 Z duckindog Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 42 ms 10604 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 100'000 + 10,
          M = 1'000'000'007;
int n;
int h[N], w[N];
int d[N];

int fl[N], fr[N];

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> h[i];
  for (int i = 1; i <= n; ++i) cin >> w[i];
  
  for (int i = 1; i <= n; ++i) d[i] = (d[i - 1] + w[i]) % M;
  
  {
    stack<int> st; st.push(0);
    for (int i = 1; i <= n; ++i) { 
      while (st.size() && h[st.top()] >= h[i]) st.pop();
      fl[i] = st.top() + 1;
      st.push(i);
    }
  }
  {  
    stack<int> st; st.push(n + 1);
    for (int i = n; i >= 1; --i) { 
      while (st.size() && h[st.top()] >= h[i]) st.pop();
      fr[i] = st.top() - 1;
      st.push(i);
    }
  }

  auto cal = [&](int l, int r) { return 1ll * (l + r) * (r - l + 1) / 2 % M; };
  auto add = [&](auto& x, long long val) { x = (x + val) % M; };
  auto sub = [&](auto& x, long long val) { x = ((x - val) % M + M) % M; };

  int answer = 0;

  set<tuple<int, int, int>> chk;
  for (int i = 1; i <= n; ++i) { 
    if (chk.count(make_tuple(fl[i], fr[i], h[i]))) continue;
    chk.insert(make_tuple(fl[i], fr[i], h[i]));
    int l = fl[i], r = fr[i];
    int height = max(h[l - 1], h[r + 1]);
    add(answer, cal(1, d[r] - d[l - 1]) * cal(height + 1, h[i]));
  } 

  cout << answer << "\n";
}

Compilation message

fancyfence.cpp: In function 'int32_t main()':
fancyfence.cpp:41:8: warning: variable 'sub' set but not used [-Wunused-but-set-variable]
   41 |   auto sub = [&](auto& x, long long val) { x = ((x - val) % M + M) % M; };
      |        ^~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 11 ms 2568 KB Output is correct
4 Correct 21 ms 4432 KB Output is correct
5 Correct 22 ms 4948 KB Output is correct
6 Correct 21 ms 3932 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 9 ms 1372 KB Output is correct
4 Correct 17 ms 2396 KB Output is correct
5 Correct 17 ms 2396 KB Output is correct
6 Correct 0 ms 344 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 8 ms 1372 KB Output is correct
5 Correct 17 ms 2396 KB Output is correct
6 Correct 17 ms 2396 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 1116 KB Output is correct
9 Correct 15 ms 2516 KB Output is correct
10 Correct 38 ms 8520 KB Output is correct
11 Correct 41 ms 8616 KB Output is correct
12 Correct 1 ms 344 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 472 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 396 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 11 ms 2640 KB Output is correct
12 Correct 18 ms 4456 KB Output is correct
13 Correct 22 ms 5080 KB Output is correct
14 Correct 19 ms 3932 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 732 KB Output is correct
17 Correct 11 ms 2396 KB Output is correct
18 Correct 17 ms 4188 KB Output is correct
19 Correct 18 ms 4240 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 4 ms 1496 KB Output is correct
22 Correct 15 ms 3676 KB Output is correct
23 Correct 39 ms 10460 KB Output is correct
24 Correct 39 ms 10572 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 480 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 5 ms 1372 KB Output is correct
31 Correct 4 ms 1372 KB Output is correct
32 Correct 17 ms 5056 KB Output is correct
33 Correct 17 ms 5468 KB Output is correct
34 Correct 34 ms 10324 KB Output is correct
35 Correct 33 ms 9828 KB Output is correct
36 Correct 36 ms 10576 KB Output is correct
37 Correct 35 ms 10412 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 31 ms 10152 KB Output is correct
40 Correct 34 ms 10604 KB Output is correct
41 Correct 38 ms 10580 KB Output is correct
42 Correct 42 ms 10580 KB Output is correct