cp-library/cpp.json at main · m4ushold/cp-library · GitHub

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
{
    "dsu": {
        "prefix": "dsu",
        "body": [
            "struct dsu {",
            "  int _n;",
            "  std::vector<int> p;",
            "  dsu(int n) : _n(n), p(n, -1) {}",
            "  int leader(int a) {",
            "    return p[a] < 0 ? a : p[a] = leader(p[a]);",
            "  }",
            "  bool same(int a, int b) {",
            "    return leader(a) == leader(b);",
            "  }",
            "  int size(int a) {",
            "    return -p[leader(a)];",
            "  }",
            "  int merge(int a, int b) {",
            "    a = leader(a), b = leader(b);",
            "    if(a == b) return a;",
            "    if(-p[a] < -p[b]) std::swap(a,b);",
            "    p[a] += p[b];",
            "    return p[b] = a;",
            "  }",
            "};"
        ],
        "description": "CP Library: dsu"
    },
    "segtree": {
        "prefix": "segtree",
        "body": [
            "template <class S, S (*op)(S, S), S (*e)()>",
            "struct segtree {",
            "  int _n, size, log;",
            "  std::vector<S> d;",
            "",
            "  segtree(int n) : segtree(std::vector<S>(n, e())) {}",
            "  segtree(const std::vector<S> &v) : _n(v.size()), size(1), log(0) {",
            "    while(size < _n) size <<= 1, ++log;",
            "    d = std::vector<S>(size << 1, e());",
            "    for(int i = 0; i < _n; i++) d[size + i] = v[i];",
            "    for(int i = size - 1; i; i--) update(i);",
            "  }",
            "",
            "  void update(int i) {d[i] = op(d[i<<1], d[i<<1|1]);}",
            "",
            "  void set(int i, S x) {",
            "    i += size;",
            "    d[i] = x;",
            "    while(i >>= 1) update(i);",
            "  }",
            "",
            "  S get(int i) {",
            "    return d[size + i];",
            "  }",
            "",
            "  S prod(int l, int r) {",
            "    S a = e(), b = e();",
            "    for(l += size, r += size; l < r; l >>= 1, r >>= 1) {",
            "      if(l & 1) a = op(a, d[l++]);",
            "      if(r & 1) b = op(d[--r], b);",
            "    }",
            "    return op(a,b);",
            "  }",
            "",
            "  S all_prod() {",
            "    return d[1];",
            "  }",
            "};"
        ],
        "description": "CP Library: segtree"
    }
}