Merge remote-tracking branch 'origin/master'

Author: EndlessCheng

copypasta/deque.go

@@ -1,7 +1,7 @@
 package copypasta
 
 // 双端队列
-// 用两个 slice 拼在一起实现
+// 用两个 slice 头对头拼在一起实现
 // 另一种实现是 make 个两倍大小的 slice，然后用两个下标 s t 模拟
 // 应用见 graph.go 中的 01 最短路
 

go.mod

@@ -1,9 +1,8 @@
-module codeforces-go
+module github.com/EndlessCheng/codeforces-go
 
 go 1.17
 
 require (
-	github.com/EndlessCheng/codeforces-go v0.0.0-00010101000000-000000000000
 	github.com/emirpasic/gods v1.12.0
 	github.com/levigross/grequests v0.0.0-20190908174114-253788527a1a
 	github.com/skratchdot/open-golang v0.0.0-20200116055534-eef842397966
@@ -13,13 +12,12 @@ require (
 )
 
 require (
+	github.com/blend/go-sdk v1.20211025.3 // indirect
 	github.com/davecgh/go-spew v1.1.1 // indirect
 	github.com/golang/freetype v0.0.0-20170609003504-e2365dfdc4a0 // indirect
 	github.com/google/go-querystring v1.0.0 // indirect
-	github.com/kr/pretty v0.1.0 // indirect
 	github.com/pmezard/go-difflib v1.0.0 // indirect
 	golang.org/x/image v0.0.0-20210628002857-a66eb6448b8d // indirect
+	gopkg.in/check.v1 v1.0.0-20180628173108-788fd7840127 // indirect
 	gopkg.in/yaml.v3 v3.0.0-20200615113413-eeeca48fe776 // indirect
 )
-
-replace github.com/EndlessCheng/codeforces-go => ./

go.sum

@@ -46,8 +46,8 @@ github.com/beorn7/perks v0.0.0-20180321164747-3a771d992973/go.mod h1:Dwedo/Wpr24
 github.com/beorn7/perks v1.0.0/go.mod h1:KWe93zE9D1o94FZ5RNwFwVgaQK1VOXiVxmqh+CedLV8=
 github.com/bgentry/speakeasy v0.1.0/go.mod h1:+zsyZBPWlz7T6j88CTgSN5bM796AkVf0kBD4zp0CCIs=
 github.com/bketelsen/crypt v0.0.3-0.20200106085610-5cbc8cc4026c/go.mod h1:MKsuJmJgSg28kpZDP6UIiPt0e0Oz0kqKNGyRaWEPv84=
-github.com/blend/go-sdk v1.20210918.2 h1:YH7wBDTNPCFUr4W3cVVwp31LsEYFBSLriXE/oqzDxPs=
-github.com/blend/go-sdk v1.20210918.2/go.mod h1:nbmX7cdPm66JOqg6M3cKMtuqj6RzkE72sHZue61T5c0=
+github.com/blend/go-sdk v1.20211025.3 h1:3f8hYTMb9ufP8IkBtsflNohAqoKo4hEBbeR0s4bfBqI=
+github.com/blend/go-sdk v1.20211025.3/go.mod h1:nbmX7cdPm66JOqg6M3cKMtuqj6RzkE72sHZue61T5c0=
 github.com/blend/sentry-go v1.0.1/go.mod h1:hgyX3WXen2YBiA0NitlfsXsvS+9ly2YlEBmmmYDgrWY=
 github.com/census-instrumentation/opencensus-proto v0.2.1/go.mod h1:f6KPmirojxKA12rnyqOA5BBL4O983OfeGPqjHWSTneU=
 github.com/cespare/xxhash v1.1.0/go.mod h1:XrSqR1VqqWfGrhpAt58auRo0WTKS1nRRg3ghfAqPWnc=

main/1-99/25A.go

@@ -0,0 +1,30 @@
+package main
+
+import (
+	. "fmt"
+	"io"
+)
+
+// github.com/EndlessCheng/codeforces-go
+func CF25A(in io.Reader, out io.Writer) {
+	var n, c, tar int
+	Fscan(in, &n)
+	a := make([]int, n)
+	for i := range a {
+		Fscan(in, &a[i])
+		a[i] &= 1
+	}
+	for _, v := range a[:3] {
+		c += v
+	}
+	if c < 2 {
+		tar = 1
+	}
+	for i, v := range a {
+		if v == tar {
+			Fprint(out, i+1)
+		}
+	}
+}
+
+//func main() { CF25A(os.Stdin, os.Stdout) }

main/1-99/25A_test.go

@@ -0,0 +1,24 @@
+package main
+
+import (
+	"github.com/EndlessCheng/codeforces-go/main/testutil"
+	"testing"
+)
+
+// https://codeforces.com/problemset/problem/25/A
+// https://codeforces.com/problemset/status/25/problem/A
+func TestCF25A(t *testing.T) {
+	// just copy from website
+	rawText := `
+inputCopy
+5
+2 4 7 8 10
+outputCopy
+3
+inputCopy
+4
+1 2 1 1
+outputCopy
+2`
+	testutil.AssertEqualCase(t, rawText, 0, CF25A)
+}

main/1000-1099/1063B.go

@@ -0,0 +1,60 @@
+package main
+
+import (
+	"bufio"
+	. "fmt"
+	"io"
+)
+
+// github.com/EndlessCheng/codeforces-go
+type pair63 struct{ x, y, l, r int }
+type deque63 struct{ l, r []pair63 }
+
+func (q deque63) empty() bool     { return len(q.l) == 0 && len(q.r) == 0 }
+func (q *deque63) pushL(v pair63) { q.l = append(q.l, v) }
+func (q *deque63) pushR(v pair63) { q.r = append(q.r, v) }
+func (q *deque63) popL() (v pair63) {
+	if len(q.l) > 0 {
+		q.l, v = q.l[:len(q.l)-1], q.l[len(q.l)-1]
+	} else {
+		v, q.r = q.r[0], q.r[1:]
+	}
+	return
+}
+
+func CF1063B(_r io.Reader, out io.Writer) {
+	in := bufio.NewReader(_r)
+	dir4 := []struct{ x, y, l, r int }{{x: -1}, {x: 1}, {0, -1, 1, 0}, {0, 1, 0, 1}}
+
+	var n, m, sx, sy, ll, rr, ans int
+	Fscan(in, &n, &m, &sx, &sy, &ll, &rr)
+	sx--
+	sy--
+	g := make([][]byte, n)
+	for i := range g {
+		Fscan(in, &g[i])
+	}
+
+	q := deque63{}
+	q.pushL(pair63{sx, sy, 0, 0})
+	g[sx][sy] = 0
+	for !q.empty() {
+		ans++
+		p := q.popL()
+		for _, d := range dir4 {
+			x, y, l, r := p.x+d.x, p.y+d.y, p.l+d.l, p.r+d.r
+			if 0 <= x && x < n && 0 <= y && y < m && l <= ll && r <= rr && g[x][y] == '.' {
+				g[x][y] = 0
+				p := pair63{x, y, l, r}
+				if d.y == 0 {
+					q.pushL(p)
+				} else {
+					q.pushR(p)
+				}
+			}
+		}
+	}
+	Fprint(out, ans)
+}
+
+//func main() { CF1063B(os.Stdin, os.Stdout) }

main/1000-1099/1063B_test.go

@@ -0,0 +1,34 @@
+package main
+
+import (
+	"github.com/EndlessCheng/codeforces-go/main/testutil"
+	"testing"
+)
+
+// https://codeforces.com/problemset/problem/1063/B
+// https://codeforces.com/problemset/status/1063/problem/B
+func TestCF1063B(t *testing.T) {
+	// just copy from website
+	rawText := `
+inputCopy
+4 5
+3 2
+1 2
+.....
+.***.
+...**
+*....
+outputCopy
+10
+inputCopy
+4 4
+2 2
+0 1
+....
+..*.
+....
+....
+outputCopy
+7`
+	testutil.AssertEqualCase(t, rawText, 0, CF1063B)
+}

main/1100-1199/1190B.go

@@ -0,0 +1,38 @@
+package main
+
+import (
+	"bufio"
+	. "fmt"
+	"io"
+)
+
+// github.com/EndlessCheng/codeforces-go
+func CF1190B(_r io.Reader, out io.Writer) {
+	in := bufio.NewReader(_r)
+	var n, v int
+	Fscan(in, &n)
+	sum := int(int64(n) * int64(n-1) / 2 & 1)
+	cnt := make(map[int]int8, n)
+	for dup := false; n > 0; n-- {
+		Fscan(in, &v)
+		if cnt[v]++; cnt[v] > 1 {
+			if dup || v == 0 || cnt[v-1] > 0 {
+				Fprint(out, "cslnb")
+				return
+			}
+			dup = true
+		}
+		if cnt[v+1] > 1 {
+			Fprint(out, "cslnb")
+			return
+		}
+		sum ^= v & 1
+	}
+	if sum == 0 {
+		Fprint(out, "cslnb")
+	} else {
+		Fprint(out, "sjfnb")
+	}
+}
+
+//func main() { CF1190B(os.Stdin, os.Stdout) }

main/1100-1199/1190B_test.go

@@ -0,0 +1,44 @@
+package main
+
+import (
+	"github.com/EndlessCheng/codeforces-go/main/testutil"
+	"testing"
+)
+
+// https://codeforces.com/problemset/problem/1190/B
+// https://codeforces.com/problemset/status/1190/problem/B
+func TestCF1190B(t *testing.T) {
+	// just copy from website
+	rawText := `
+inputCopy
+1
+0
+outputCopy
+cslnb
+inputCopy
+2
+1 0
+outputCopy
+cslnb
+inputCopy
+2
+2 2
+outputCopy
+sjfnb
+inputCopy
+3
+2 3 1
+outputCopy
+sjfnb
+inputCopy
+3
+0 0 6
+outputCopy
+cslnb
+inputCopy
+3
+4 5 5
+outputCopy
+cslnb`
+	testutil.AssertEqualCase(t, rawText, 0, CF1190B)
+}

main/1200-1299/1225D.go

@@ -0,0 +1,47 @@
+package main
+
+import (
+	"bufio"
+	. "fmt"
+	"io"
+)
+
+// github.com/EndlessCheng/codeforces-go
+func CF1225D(_r io.Reader, out io.Writer) {
+	in := bufio.NewReader(_r)
+	const mx int = 1e5
+	lpf := [mx + 1]int{1: 1}
+	for i := 2; i <= mx; i++ {
+		if lpf[i] == 0 {
+			for j := i; j <= mx; j += i {
+				if lpf[j] == 0 {
+					lpf[j] = i
+				}
+			}
+		}
+	}
+
+	var n, k, v int
+	ans := int64(0)
+	cnt := map[string]int{} // 或者用 [6]int 来代替 string，下面改成 p<<8|e 和 p<<8|(k-e)
+	for Fscan(in, &n, &k); n > 0; n-- {
+		s := []byte{}
+		t := []byte{}
+		Fscan(in, &v)
+		for v > 1 {
+			p, e := lpf[v], 1
+			for v /= p; lpf[v] == p; v /= p {
+				e++
+			}
+			if e %= k; e > 0 {
+				s = append(s, byte(p>>16), byte(p>>8), byte(p), byte(e))
+				t = append(t, byte(p>>16), byte(p>>8), byte(p), byte(k-e))
+			}
+		}
+		ans += int64(cnt[string(t)])
+		cnt[string(s)]++
+	}
+	Fprint(out, ans)
+}
+
+//func main() { CF1225D(os.Stdin, os.Stdout) }