Submission #398187

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
398187	2021-05-03 21:32:25	illyakr	Fancy Fence (CEOI20_fancyfence)	C++14	100 / 100	107 ms	20848 KiB

fancyfence

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#define int long long
using namespace std;
const int mod = 1000000007;
int n;
int h[101010], w[101010];
int RMQ[30][101010];
int L[101010];
int pref[101010];
int get(int l, int r) {
    int x = L[r - l + 1];
    int f = RMQ[x][l], s = RMQ[x][r - (1 << x) + 1];
    if (h[f] <= h[s]) return f;
    return s;
}
int res = 0;
void rec(int l, int r, int nowH) {
    if (l > r)return;
    int go = get(l, r);
    int H = h[go] - nowH;
    int W = pref[r] - pref[l - 1];
    H %= mod; W %= mod;
    res += (((((W * (W + 1)) / 2) % mod) *
             (((H * (H + 1)) / 2) % mod)) % mod);
    res %= mod;
    res += (((((((W * (W + 1)) / 2) % mod) * H) % mod) * nowH) % mod);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 0
• Subtask 2: 12 / 12
• Subtask 3: 13 / 13
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 18 / 18
• Subtask 7: 27 / 27