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 callersMethodPush
(v interface{})
main/700-799/715B.go:20
↓ 1 callersMethodPush
(v interface{})
main/1500-1599/1526C2.go:14
↓ 1 callersMethodPush
(v interface{})
main/1500-1599/1572A.go:15
↓ 1 callersMethodPush
(v interface{})
main/900-999/965E.go:15
↓ 1 callersMethodPush
(v interface{})
main/1100-1199/1196F.go:20
↓ 1 callersMethodPush
(v interface{})
main/1100-1199/1106E.go:21
↓ 1 callersMethodPush
(v interface{})
main/400-499/449B.go:21
↓ 1 callersMethodPush
(v interface{})
main/400-499/416C.go:14
↓ 1 callersMethodPush
(v interface{})
main/1400-1499/1422D.go:18
↓ 1 callersMethodPush
(v interface{})
main/1400-1499/1486E.go:17
↓ 1 callersMethodPush
(v interface{})
main/1400-1499/1473E.go:20
↓ 1 callersMethodPush
(v interface{})
main/1400-1499/1493D_heap.go:19
↓ 1 callersMethodPush
(v interface{})
main/800-899/825E.go:15
↓ 1 callersMethodPush
(v interface{})
main/1000-1099/1076D.go:20
↓ 1 callersMethodPush
(v interface{})
main/1-99/13C.go:14
↓ 1 callersMethodPush
(v interface{})
misc/acwing/weekly/29/c/c.go:73
↓ 1 callersMethodPush
(v interface{})
misc/acwing/weekly/2/c/c.go:18
↓ 1 callersMethodPush
(v interface{})
misc/acwing/weekly/24/c/c.go:63
↓ 1 callersMethodPush
(v interface{})
misc/nowcoder/6629/c/c.go:11
↓ 1 callersMethodPush
(v interface{})
misc/nowcoder/9887/c/c.go:31
↓ 1 callersMethodPush
(v interface{})
misc/atcoder/abc170/f/f.go:17
↓ 1 callersMethodPush
(v interface{})
leetcode/biweekly/57/b/b.go:45
↓ 1 callersMethodPush
(v interface{})
leetcode/biweekly/64/b/b.go:29
↓ 1 callersMethodPush
(v interface{})
leetcode/biweekly/7/c/c.go:11
↓ 1 callersMethodPush
(v interface{})
leetcode/biweekly/51/b/b.go:11
↓ 1 callersMethodPush
(v interface{})
leetcode/weekly/221/b/b.go:12
↓ 1 callersMethodPush
(v interface{})
leetcode/weekly/180/d_pq.go:10
↓ 1 callersMethodPush
(v interface{})
leetcode/weekly/266/d/d.go:58
↓ 1 callersMethodPush
(v interface{})
leetcode/weekly/243/c/c.go:12
↓ 1 callersMethodPush
(v interface{})
leetcode/weekly/197/c/c.go:20
↓ 1 callersMethodPush
(v interface{})
leetcode/weekly/231/c/c.go:12
↓ 1 callersMethodPush
(v interface{})
leetcode/weekly/237/c/c.go:15
↓ 1 callersMethodPush
(v interface{})
leetcode/weekly/187/d/d.go:14
↓ 1 callersMethodPushBack
(v interface{})
copypasta/deque.go:23
↓ 1 callersMethodPushFront
(v int)
leetcode/biweekly/40/c/c.go:13
↓ 1 callersFunctionRunLeetCodeClass
(t *testing.T, constructor interface{}, rawInputs, rawOutputs []string)
leetcode/testutil/leetcode.go:481
↓ 1 callersMethodSet
(p int)
misc/acwing/weekly/31/c/c.go:15
↓ 1 callersMethodSet
(key string, value string, timestamp int)
leetcode/weekly/121/b/b.go:19
↓ 1 callersFunctionSolP1203
O(n) DP 做法 https://tracyqwerty.blog.luogu.org/solution-p1203 github.com/EndlessCheng/codeforces-go
misc/luogu/usaco/1.1/P1203.go:13
↓ 1 callersMethodStrInSet
StrInSet generates a random string with length in range [minLen, maxLen] and its chars in chars
main/testutil/rand.go:94
↓ 1 callersMethodString
()
copypasta/red_black_tree.go:238
↓ 1 callersMethodString
其余通用方法见 bst.go
copypasta/treap.go:166
↓ 1 callersMethodString
()
copypasta/treap.go:240
↓ 1 callersMethodString
其余和 BST 有关的方法见 bst.go 注意每次调用之前或之后都要执行一下 t.root = t.root.splay(t.rank(key))，以确保均摊复杂度为 O(logn) 注意 min max 哨兵对 rank() kth() 等方法的影响
copypasta/splay.go:191
↓ 1 callersMethodString
()
copypasta/splay.go:274
↓ 1 callersMethodString
()
copypasta/bst.go:344
↓ 1 callersMethodTreeWeightedEdges
TreeWeightedEdges generates a tree with n nodes, st-index, edge weights in range [minWeight, maxWeight]
main/testutil/rand.go:287
↓ 1 callersMethodUniquePoints
UniquePoints generates n unique int points, x in range [minX, maxX], y in range [minY, maxY]
main/testutil/rand.go:203
↓ 1 callersFunctionValues
(head *ListNode)
leetcode/testutil/predefined_type.go:271
↓ 1 callersMethod_build
(arr []int, o, l, r int)
main/500-599/522B.go:27
↓ 1 callersMethod_build
(a []pair1321, o, l, r int)
main/1300-1399/1321E.go:25
↓ 1 callersMethod_build
(arr []int, o, l, r int)
main/300-399/339D.go:25
↓ 1 callersMethod_build
(l, r int)
main/1200-1299/1262D2.go:17
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/900-999/920F.go:23
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/900-999/914D.go:21
↓ 1 callersMethod_build
(arr []int, o, l, r int)
main/900-999/961E.go:38
↓ 1 callersMethod_build
(a []int, ors []int64, o, l, r int)
main/1100-1199/1114F.go:34
↓ 1 callersMethod_build
(l, r int)
main/800-899/813E.go:20
↓ 1 callersMethod_build
(o, l, r int)
main/edu/2/segmenttree1/step3/b/main.go:14
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/edu/2/segmenttree1/step1/c/main.go:33
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/edu/2/segmenttree1/step1/b/main.go:27
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/edu/2/segmenttree1/step2/a/main.go:45
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/edu/2/segmenttree1/step2/d/main.go:27
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/edu/2/segmenttree1/step2/c/main.go:27
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/edu/2/segmenttree1/step2/b/main.go:20
↓ 1 callersMethod_build
(a []int, o, l, r int)
main/edu/2/segmenttree1/step4/a/main.go:27
↓ 1 callersMethod_build
(o, l, r int)
main/edu/2/segmenttree1/step4/e/main.go:21
↓ 1 callersMethod_build
(a []int8, o, l, r int)
main/edu/2/segmenttree1/step4/c/main.go:30
↓ 1 callersMethod_build
(a []mat, o, l, r int)
main/edu/2/segmenttree1/step4/b/main.go:32
↓ 1 callersMethod_build
(arr []int, pos uint8, o, l, r int)
main/200-299/242E.go:21
↓ 1 callersMethod_build
(o, l, r int)
leetcode/season/2019fall/e/e.go:17
↓ 1 callersMethod_build
(o, l, r int)
leetcode/weekly/174/d_nlogn.go:15
↓ 1 callersMethod_build
(o, l, r int)
leetcode/weekly/186/d/d.go:17
↓ 1 callersMethod_build
(a []int, o, l, r int)
leetcode/weekly/187/c/c.go:32
↓ 1 callersMethod_delete
(o *node527C, key int)
main/500-599/527C_treap.go:81
↓ 1 callersMethod_delete
(o *node58, l int)
main/500-599/558E.go:66
↓ 1 callersMethod_delete
(o *node55, key int)
main/500-599/555C.go:63
↓ 1 callersMethod_delete
(o *node98, key int)
main/1300-1399/1398E.go:86
↓ 1 callersMethod_delete
(o *node49, key int)
main/1200-1299/1249D2.go:64
↓ 1 callersMethod_delete
(o *node28, key int)
main/1500-1599/1528C.go:62
↓ 1 callersMethod_delete
(o *node60, key int)
main/900-999/960F.go:62
↓ 1 callersMethod_delete
(o *node15, l int)
main/900-999/915E.go:65
↓ 1 callersMethod_delete
(o *sNode840, key int)
main/800-899/840D.go:51
↓ 1 callersMethod_delete
(o *tpNode840, key, val int)
main/800-899/840D.go:145
↓ 1 callersMethod_delete
(o *node10, key int)
main/600-699/610D.go:73
↓ 1 callersMethod_delete
(o *node, key int)
main/gym/101628K.go:60
↓ 1 callersMethod_delete
(o *sgtNode, key int)
copypasta/scapegoat_tree.go:114
↓ 1 callersMethod_delete
(o *rbNode, key rbKeyType)
copypasta/red_black_tree.go:176
↓ 1 callersMethod_delete
删除一个键，返回删除后优先级最大的节点，若无节点返回 nil 因为 treap 满足堆性质，所以只需要把要删除的节点旋转到叶节点上，然后直接删除就可以了 具体的方法就是每次找到优先级最大的儿子，向与其相反的方向旋转，这样要删除的节点会不断下降直到叶节点，然后直接删除
copypasta/treap.go:131
↓ 1 callersMethod_delete
(o *node, key entry)
leetcode/biweekly/55/d/d.go:125
↓ 1 callersMethod_delete
(o *node, key int)
leetcode/biweekly/36/d/d.go:57
↓ 1 callersMethod_delete
(o *node, key int)
leetcode/weekly/180/d/d.go:55
↓ 1 callersMethod_delete
(o *node, key int)
leetcode/weekly/236/d/d.go:66
↓ 1 callersMethod_delete
(o *node, key int)
leetcode/weekly/194/c/c.go:54
↓ 1 callersMethod_delete
(o *node, key int)
leetcode/weekly/196/d/d.go:67
↓ 1 callersMethod_find
(x int)
copypasta/union_find.go:315
↓ 1 callersMethod_flip
(o, idx int)
main/edu/2/segmenttree1/step2/b/main.go:32
↓ 1 callersMethod_isBipartite
(v int)
main/600-699/623A.go:28
↓ 1 callersMethod_pushUp
(o int)
main/500-599/522B.go:22
↓ 1 callersMethod_pushUp
(o int)
main/900-999/961E.go:16
← previousnext →801–900 of 8,098, ranked by callers