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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/Neutral element for combine/ {
print "#ifndef SEGTREE_FIRST_NEG"
print "# ifndef SEGTREE_MAX"
print
print "# else"
tmp = $0
sub(/0/, "numeric_limits<T>::min()", tmp)
print tmp
print "# endif"
print "#else"
sub(/0/, "numeric_limits<T>::max()")
print
print "#endif"
next
}
/Modify this \+ E/ {
print "#ifndef SEGTREE_FIRST_NEG"
print "# ifndef SEGTREE_MAX"
print
print "# else"
tmp = $0
sub(/a \+ b/, "max(a, b)", tmp)
print tmp
print "# endif"
print "#else"
sub(/a \+ b/, "a < 0 ? a : min(a, b)")
print
print "#endif"
next
}
/Unused value by updates/ {
print "#ifndef SEGTREE_FIRST_NEG"
print
print "#else"
sub(/0/, /numeric_limits<U>::max()/)
print
print "#endif"
next
}
/And this \+ UF/ {
print
getline set_tree
getline set_lazy
print "#ifndef SEGTREE_MAX"
print "# ifndef SEGTREE_FIRST_NEG"
print set_tree
print "# else"
tmp = set_tree
sub(/val \* k\[i\]/, "val", tmp)
print tmp
print "# endif"
print set_lazy
print "#else"
sub(/= val \* k\[i\]/, "+= val", set_tree)
sub(/= val/, "+= val", set_lazy)
print set_tree
print set_lazy
print "#endif"
next
}
/Optional/ { print "#ifdef SEGTREE_MAX" }
/^\};$/ { print "#endif" }
/SegTree\(const vector<T>& a\)/ {
print "#ifndef SEGTREE_INIT_DEFAULT"
print
print "#else"
getline
sub(/\/\//, "")
print
print "#endif"
getline
print
print "#ifndef SEGTREE_INIT_DEFAULT"
getline
print
print "#endif"
next
}
{ print }
|
