Functions — github.com/EndlessCheng/codeforces-go

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

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

⨍ Functions 8,098◇ Types & classes 911

Methodquery

(l, r int)

main/edu/2/segmenttree1/step1/b/main.go:68

Methodquery

(l, x int)

main/edu/2/segmenttree1/step2/d/main.go:69

Methodquery

(x int)

main/edu/2/segmenttree1/step2/c/main.go:67

Methodquery

(k int)

main/edu/2/segmenttree1/step2/b/main.go:57

Methodquery

(l, r int)

main/edu/2/segmenttree1/step4/a/main.go:74

Methodquery

(l, r, upp int)

main/edu/2/segmenttree1/step4/e/main.go:66

Methodquery

(l, r int)

main/edu/2/segmenttree1/step4/c/main.go:82

Methodquery

(l, r int)

main/edu/2/segmenttree1/step4/b/main.go:59

Methodquery

(l, r int)

main/200-299/242E.go:79

Methodquery

(o, l, r int)

main/1000-1099/1093G.go:63

misc/luogu/p3373.go:74

Methodquery

(o, l, r int)

misc/acwing/weekly/3/c/c.go:38

Methodquery

(o, l, r int)

misc/acwing/weekly/12/c/c.go:56

Methodquery

o=1 [l,r] 1<=l<=r<=n

misc/atcoder/abc185/f/f.go:49

Methodquery

(o, l, r int)

misc/atcoder/dp/w/w.go:56

Methodquery

求区间和 [l,r] 1<=l<=r<=n

copypasta/fenwick_tree.go:224

Methodquery

o=1 [l,r] 1<=l<=r<=n

copypasta/segment_tree.go:108

Methodquery

o=1 [l,r] 1<=l<=r<=n

copypasta/segment_tree.go:278

Methodquery

(l, r int)

copypasta/segment_tree.go:374

Methodquery

(l, r int)

copypasta/segment_tree.go:461

Methodquery

(l, r int)

copypasta/segment_tree.go:603

Methodquery

(x1, y1, x2, y2 int)

copypasta/kd_tree.go:155

Methodquery

(x1, y1, x2, y2 int)

copypasta/kd_tree.go:175

Methodquery

Mock query

copypasta/template/interactive_problem/main_test.go:62

Methodquery

(q request)

copypasta/template/interactive_problem/main.go:33

Methodquery

(o, l, r int)

leetcode/biweekly/37/d/d.go:64

Methodquery

(l, r int)

leetcode/season/2019fall/e/e.go:73

Methodquery

(l, r int)

leetcode/weekly/174/d_nlogn.go:58

Methodquery

(l, r int)

leetcode/weekly/214/d/d.go:22

Methodquery

(l, r int)

leetcode/weekly/186/d/d.go:59

Methodquery

(pos int)

leetcode/weekly/206/c/c.go:115

Methodquery

(l, r int)

leetcode/weekly/187/c/c.go:62

MethodqueryAll

()

copypasta/segment_tree.go:124

MethodqueryAll

()

copypasta/segment_tree.go:295

MethodqueryFirstLessPos

EXTRA: 查询整个区间小于 v 的最靠左的位置这里线段树维护的是区间最小值需要先判断 t[1].min < v

copypasta/segment_tree.go:135

MethodqueryFirstLessPosInRange

EXTRA: 查询 [l,r] 上小于 v 的最靠左的位置这里线段树维护的是区间最小值不存在时返回 0

copypasta/segment_tree.go:148

FunctionrangeBitwiseAnd

LC 201

leetcode/main.go:911

FunctionrangeMex

给一个数组 a 和一些询问 qs，对每个询问计算 mex(a[l..r]) a[i]>=0, 1<=l<=r<=n 遍历数组 a，记录 a[i] 最后一次出现的位置 lastPos 以及上一个 a[i] 的位置 prevPos 建立一个权值树状数组，维护 lastPos[v] 的前缀最小值树状数组

copypasta/fenwick_tree.go:148

FunctionrangeSum

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/30/b/b.go:6

Methodrank

求小于 s 的字符串个数此时 o.cnt 保存子树字符串个数

copypasta/trie.go:110

FunctionrankTeams

(votes []string)

leetcode/weekly/178/b/b.go:5

MethodrayIntersection

求射线 a b 交点，返回各自到首个交点所需的时间（射线速度由 .vec().len() 决定）无交点返回 -1 交点为 a.point(ta) 或 b.point(tb) 若题目给了方向向量和速度：https://codeforces.com/problemset/problem/1359/F

copypasta/geometry.go:410

MethodreadGraph

len(g[v]) 表示结点 v 在无向图上的度/有向图上的出度对于树来说叶结点有 len(g[v]) == 1

copypasta/graph.go:106

MethodreadGraphList

链式前向星 https://oi-wiki.org//graph/save/#_14

copypasta/graph.go:121

MethodreadInitData

Mock initData

copypasta/template/interactive_problem/main_test.go:36

MethodreadInitData

()

copypasta/template/interactive_problem/main.go:28

FunctionreadMatrix

* 矩阵加速 https://zh.wikipedia.org/wiki/%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97#%E7%B7%9A%E6%80%A7%E4%BB%A3%E6%95%B8%E8%A7%A3%E6%B3%95 htt

copypasta/math_matrix.go:30

FunctionrearrangeArray

* 将数组排序后从中间分开，错开一位合并。 */ github.com/EndlessCheng/codeforces-go

leetcode/weekly/254/b/b.go:12

FunctionrearrangeSticks

(n, k int)

leetcode/weekly/241/d/d.go:17

FunctionreconstructMatrix

(upper int, lower int, colsum []int)

leetcode/weekly/162/b/b.go:3

FunctionrecoverArray

* 枚举 higher[0] + 双指针将 $\textit{nums}$ 排序后，$\textit{lower}[0]$ 必然是 $\textit{nums}[0]$。我们可以在 $\textit{nums}$ 中枚举 $\textit{higher}[0]$ 的值，从而得到 $k=\dfra

leetcode/weekly/273/d/d.go:16

FunctionrecoverArray

github.com/EndlessCheng/codeforces-go

leetcode/weekly/255/d/d.go:9

FunctionrecoverTree

LC 99

leetcode/main.go:487

FunctionreductionOperations

github.com/EndlessCheng/codeforces-go

leetcode/weekly/244/b/b.go:6

Functionreformat

(S string)

leetcode/weekly/185/a/a.go:3

FunctionreformatDate

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/30/a/a.go:9

FunctionreformatNumber

github.com/EndlessCheng/codeforces-go

leetcode/weekly/220/a/a.go:6

FunctionregionsBySlashes

github.com/EndlessCheng/codeforces-go

leetcode/weekly/115/c/c.go:4

FunctionreinitializePermutation

github.com/EndlessCheng/codeforces-go

leetcode/weekly/234/b/b.go:4

Methodremove

(i int)

copypasta/heap.go:91

FunctionremoveCoveredIntervals

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/15/b/b.go:6

FunctionremoveDuplicateLetters

LC 316 / LC 1081 去除重复字母后字典序最小的子序列

leetcode/main.go:1059

FunctionremoveInterval

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/14/b/b.go:4

FunctionremoveLeafNodes

我的憨憨写法

leetcode/weekly/172/c/c.go:6

FunctionremoveLeafNodes2

优雅的写法

leetcode/weekly/172/c/c.go:27

FunctionremoveNthFromEnd

LC 19

leetcode/main.go:44

FunctionremoveOccurrences

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/55/b/b.go:6

FunctionremovePalindromeSub

(s string)

leetcode/weekly/173/a/a.go:3

FunctionremoveSubfolders

(folder []string)

leetcode/weekly/159/b/b.go:8

FunctionremoveVowels

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/4/b/b.go:6

FunctionremoveZeroSumSublists

** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */

leetcode/weekly/151/c/c.go:14

FunctionrenameInputArgs

替换常见变量名（数组、字符串等）

copypasta/template/leetcode/helper.go:71

FunctionreorderSpaces

github.com/EndlessCheng/codeforces-go

leetcode/weekly/207/a/a.go:6

FunctionreplaceDigits

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/51/a/a.go:4

FunctionreplaceElements

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/16/a/a.go:4

FunctionrestoreArray

github.com/EndlessCheng/codeforces-go

leetcode/weekly/226/b/b.go:4

FunctionrestoreMatrix

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/36/c/c.go:4

FunctionrestoreString

(s string, indices []int)

leetcode/weekly/199/a/a.go:3

FunctionreverseEvenLengthGroups

github.com/EndlessCheng/codeforces-go

leetcode/weekly/267/b/b.go:6

FunctionreverseParentheses

(s string)

leetcode/main.go:1681

FunctionreversePrefix

模拟 github.com/EndlessCheng/codeforces-go

leetcode/weekly/258/a/a.go:8

Functionrobot

(command string, obstacles [][]int, endX, endY int)

leetcode/season/2019fall/c/c.go:3

Methodrotate

(d int)

main/800-899/840D.go:90

MethodrotateCCW

顺时针旋转 90° 逆时针旋转，传入旋转的弧度

copypasta/geometry.go:208

MethodrotateCCW90

()

copypasta/geometry.go:204

MethodrotateCW90

逆时针旋转 90°

copypasta/geometry.go:205

FunctionrotateGrid

github.com/EndlessCheng/codeforces-go

leetcode/weekly/247/b/b.go:4

FunctionrotateMatrix

顺时针转 90°

copypasta/math_matrix.go:51

FunctionrotateTheBox

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/52/c/c.go:4

Functionrun1

github.com/EndlessCheng/codeforces-go

misc/gcj/2018/2/c/c.go:11

FunctionrunAC

(_r io.Reader, _w io.Writer)

misc/gcj/2020/1b/a/a_test.go:26

FunctionrunG

github.com/EndlessCheng/codeforces-go

main/gym/101234/G.go:11

FunctionrunI

github.com/EndlessCheng/codeforces-go

main/gym/101309/I.go:10

FunctionrunningSum

(a []int)

leetcode/weekly/193/a/a.go:3

Methodsame

(x, y int)

copypasta/union_find.go:280

MethodsccTarjan

SCC Tarjan 常数比 Kosaraju 略小（在 AtCoder 上的测试显示，5e5 的数据下比 Kosaraju 快了约 100ms） https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algor

copypasta/graph.go:2751

FunctionscoreOfParentheses

github.com/EndlessCheng/codeforces-go

leetcode/weekly/90/b/b.go:4

FunctionscoreOfStudents

github.com/EndlessCheng/codeforces-go

leetcode/weekly/260/d/d.go:4

FunctionsearchCollection

* 状态空间一个实际问题的各种可能情况构成的集合由小及大：当状态空间位于边界上或某个小范围内等特殊情形，该状态空间的解往往是已知的。若能将此解的应用场景扩大到原问题的状态空间，并且扩展过程的每个步骤具有相似性，就可以考虑使用递推或递归求解。换句话说，程序在每个步骤上应该面对相同种类的问题，这

copypasta/search.go:56

← previous next →7,801–7,900 of 8,098, ranked by callers