MCPcopy Create free account

hub / github.com/EndlessCheng/codeforces-go / functions

Functions8,098 in github.com/EndlessCheng/codeforces-go

⨍ Functions 8,098◇ Types & classes 911
↓ 1 callersMethod_pushUp
(o int)
main/edu/2/segmenttree1/step4/b/main.go:30
↓ 1 callersMethod_pushUp
(o int)
leetcode/season/2019fall/e/e.go:12
↓ 1 callersMethod_pushUp
(o int)
leetcode/weekly/174/d_nlogn.go:25
↓ 1 callersMethod_pushUp
(o int)
leetcode/weekly/187/c/c.go:26
↓ 1 callersMethod_put
(o *node527C, key int)
main/500-599/527C_treap.go:63
↓ 1 callersMethod_put
(o *node58, l, r int, b byte)
main/500-599/558E.go:49
↓ 1 callersMethod_put
(o *node55, key, end int, up bool)
main/500-599/555C.go:48
↓ 1 callersMethod_put
(o *node98, key int)
main/1300-1399/1398E.go:70
↓ 1 callersMethod_put
(o *node87, key int)
main/300-399/387E.go:49
↓ 1 callersMethod_put
(o *node49, key, id int)
main/1200-1299/1249D2.go:47
↓ 1 callersMethod_put
(o *node28, key int)
main/1500-1599/1528C.go:47
↓ 1 callersMethod_put
(o *node60, key, val int)
main/900-999/960F.go:47
↓ 1 callersMethod_put
(o *node15, l, r int, work bool)
main/900-999/915E.go:48
↓ 1 callersMethod_put
(o *node24, v, c1 int)
main/400-499/424D.go:46
↓ 1 callersMethod_put
(o *sNode840, key int)
main/800-899/840D.go:37
↓ 1 callersMethod_put
(o *tpNode840, key, val int)
main/800-899/840D.go:126
↓ 1 callersMethod_put
(o *node10, key int)
main/600-699/610D.go:58
↓ 1 callersMethod_put
(o *node, key int)
main/gym/101628K.go:46
↓ 1 callersMethod_put
(o *sgtNode, key, val int)
copypasta/scapegoat_tree.go:91
↓ 1 callersMethod_put
(o *rbNode, key rbKeyType, value rbValueType)
copypasta/red_black_tree.go:126
↓ 1 callersMethod_put
插入一键值对，返回插入后优先级最大的节点 先和二叉搜索树的插入一样，先把要插入的点插入到一个叶子上，并随机分配一个优先级， 然后跟维护堆一样，如果当前节点的优先级比根大就旋转，如果当前节点是根的左儿子就右旋如果当前节点是根的右儿子就左旋
copypasta/treap.go:107
↓ 1 callersMethod_put
(o *node, key entry)
leetcode/biweekly/55/d/d.go:111
↓ 1 callersMethod_put
(o *node, key int)
leetcode/biweekly/51/d/d.go:42
↓ 1 callersMethod_put
(o *node, key int)
leetcode/biweekly/36/d/d.go:42
↓ 1 callersMethod_put
(o *node, key int)
leetcode/weekly/180/d/d.go:38
↓ 1 callersMethod_put
(o *node, key, val, i int, next *node)
leetcode/weekly/230/d/d.go:43
↓ 1 callersMethod_put
(o *node, key int)
leetcode/weekly/236/d/d.go:44
↓ 1 callersMethod_put
(o *node, key int)
leetcode/weekly/175/c/c.go:52
↓ 1 callersMethod_put
(o *node, key int)
leetcode/weekly/194/c/c.go:39
↓ 1 callersMethod_put
(o *node, key int)
leetcode/weekly/196/d/d.go:51
↓ 1 callersMethod_query
(o, l, r int)
main/500-599/522B.go:39
↓ 1 callersMethod_query
(o, l, r int)
main/900-999/920F.go:56
↓ 1 callersMethod_query
(o, l, r, v int)
main/900-999/914D.go:46
↓ 1 callersMethod_query
(o, l, r, x int)
main/900-999/961E.go:50
↓ 1 callersMethod_query
(o, l, r int)
main/1100-1199/1114F.go:85
↓ 1 callersMethod_query
(o *pstNode813E, l, r int)
main/800-899/813E.go:48
↓ 1 callersMethod_query
(o, k int)
main/edu/2/segmenttree1/step3/b/main.go:26
↓ 1 callersMethod_query
(o, l, r int)
main/edu/2/segmenttree1/step1/c/main.go:59
↓ 1 callersMethod_query
(o, l, r int)
main/edu/2/segmenttree1/step1/b/main.go:52
↓ 1 callersMethod_query
(o, l, x int)
main/edu/2/segmenttree1/step2/d/main.go:52
↓ 1 callersMethod_query
(o, x int)
main/edu/2/segmenttree1/step2/c/main.go:52
↓ 1 callersMethod_query
(o, k int)
main/edu/2/segmenttree1/step2/b/main.go:45
↓ 1 callersMethod_query
(o, l, r int)
main/edu/2/segmenttree1/step4/a/main.go:54
↓ 1 callersMethod_query
(o, l, r, upp int)
main/edu/2/segmenttree1/step4/e/main.go:44
↓ 1 callersMethod_query
(o, l, r int)
main/edu/2/segmenttree1/step4/c/main.go:56
↓ 1 callersMethod_query
(o, l, r int)
main/edu/2/segmenttree1/step4/b/main.go:44
↓ 1 callersMethod_query
(o, l, r int)
main/200-299/242E.go:62
↓ 1 callersMethod_query
(o, l, r int)
leetcode/season/2019fall/e/e.go:56
↓ 1 callersMethod_query
(o, l, r int)
leetcode/weekly/174/d_nlogn.go:40
↓ 1 callersMethod_query
(o, l, r int)
leetcode/weekly/186/d/d.go:41
↓ 1 callersMethod_query
(o, l, r int)
leetcode/weekly/187/c/c.go:45
↓ 1 callersMethod_queryKth
(o1, o2 *node1262, k int)
main/1200-1299/1262D2.go:44
↓ 1 callersMethod_rev
(o, l, r int)
main/200-299/242E.go:44
↓ 1 callersMethod_spread
(o int)
main/1300-1399/1321E.go:37
↓ 1 callersMethod_update
(o, l, r, add int)
main/1300-1399/1321E.go:48
↓ 1 callersMethod_update
(o, idx int, val int)
main/300-399/339D.go:39
↓ 1 callersMethod_update
(o *node1262, idx int)
main/1200-1299/1262D2.go:28
↓ 1 callersMethod_update
(o, l, r int)
main/900-999/920F.go:36
↓ 1 callersMethod_update
(o, i, v int)
main/900-999/914D.go:33
↓ 1 callersMethod_update
(o, l, r, mul int, orVal int64)
main/1100-1199/1114F.go:65
↓ 1 callersMethod_update
(o *pstNode813E, idx int, val int)
main/800-899/813E.go:32
↓ 1 callersMethod_update
(o, idx, val int)
main/edu/2/segmenttree1/step1/c/main.go:46
↓ 1 callersMethod_update
(o, idx, val int)
main/edu/2/segmenttree1/step1/b/main.go:39
↓ 1 callersMethod_update
(o, idx, val int)
main/edu/2/segmenttree1/step2/a/main.go:57
↓ 1 callersMethod_update
(o, idx, val int)
main/edu/2/segmenttree1/step2/d/main.go:39
↓ 1 callersMethod_update
(o, idx, val int)
main/edu/2/segmenttree1/step2/c/main.go:39
↓ 1 callersMethod_update
(o, idx int, val int)
main/edu/2/segmenttree1/step4/a/main.go:39
↓ 1 callersMethod_update
(o, i, v int)
main/edu/2/segmenttree1/step4/e/main.go:31
↓ 1 callersMethod_update
(o, i int, pre, cur int8)
main/edu/2/segmenttree1/step4/c/main.go:42
↓ 1 callersMethod_update
(o, l, r int, add int)
leetcode/season/2019fall/e/e.go:38
↓ 1 callersMethod_update
(o, idx, val int)
leetcode/weekly/174/d_nlogn.go:27
↓ 1 callersMethod_update
(o, idx, val int)
leetcode/weekly/186/d/d.go:28
↓ 1 callersFunctionabove
github.com/EndlessCheng/codeforces-go
leetcode/weekly/225/d/d.go:6
↓ 1 callersFunctionabs
(x int)
misc/acwing/weekly/20/b/b.go:50
↓ 1 callersFunctionabs
(x rune)
misc/nowcoder/9716/a/a.go:29
↓ 1 callersFunctionabs
(x int)
leetcode/biweekly/34/d/d.go:36
↓ 1 callersFunctionabs
(x int)
leetcode/biweekly/22/a/a.go:17
↓ 1 callersFunctionabs
(x int)
leetcode/biweekly/63/a/a.go:23
↓ 1 callersFunctionabs
(x int)
leetcode/biweekly/7/a/a.go:16
↓ 1 callersFunctionabs
(x int)
leetcode/weekly/239/a/a.go:14
↓ 1 callersFunctionabs
(x int)
leetcode/weekly/229/b/b.go:16
↓ 1 callersFunctionabs
(x int)
leetcode/weekly/259/c/c.go:35
↓ 1 callersFunctionabs
(x int)
leetcode/weekly/231/b/b.go:12
↓ 1 callersFunctionabs
(x int)
leetcode/weekly/262/b/b.go:66
↓ 1 callersFunctionabs65
(x int)
main/700-799/765F.go:103
↓ 1 callersFunctionabsPath
(path string)
copypasta/template/nowcoder/helper.go:33
↓ 1 callersFunctionabsPath
(path string)
copypasta/template/leetcode/helper.go:174
↓ 1 callersFunctionabsPath
(path string)
copypasta/template/atcoder/helper.go:5
↓ 1 callersMethodadd
(from, to int)
main/500-599/510C.go:15
↓ 1 callersMethodadd
(b matrix18)
main/700-799/718C.go:18
↓ 1 callersMethodadd
(begin, end int, val int64)
main/800-899/896C.go:47
↓ 1 callersMethodadd
(b vec)
misc/atcoder/abc139/f/f.go:16
↓ 1 callersMethodadd
(vecF)
copypasta/geometry.go:1101
↓ 1 callersMethodadd
(b poly)
copypasta/math_ntt.go:222
↓ 1 callersMethodadd
(i int)
leetcode/weekly/214/d/d.go:11
↓ 1 callersMethodaddBoth
(from, to int)
main/600-699/623A.go:21
↓ 1 callersMethodaddDep
(x int)
copypasta/union_find.go:347
↓ 1 callersMethodasin
多项式反三角函数 https://oi-wiki.org/math/poly/inv-tri-func/ 模板题 https://www.luogu.com.cn/problem/P5265
copypasta/math_ntt.go:467
↓ 1 callersMethodbeginSecond
移动前，蚂蚁们在自己所在点留下一些信息素
misc/luogu/p2586.go:111
↓ 1 callersFunctionbfsWithDepth
(g [][]int, st int, do func(v, dep int))
leetcode/weekly/170/c/c.go:5
← previousnext →901–1,000 of 8,098, ranked by callers