結果

問題 No.866 レベルKの正方形
ユーザー ccppjsrb
提出日時 2020-06-10 00:03:27
言語 Go
(1.23.4)
結果
AC  
実行時間 2,867 ms / 6,000 ms
コード長 2,828 bytes
コンパイル時間 18,783 ms
コンパイル使用メモリ 246,352 KB
実行使用メモリ 257,408 KB
最終ジャッジ日時 2025-01-03 10:49:24
合計ジャッジ時間 56,500 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package main
import (
"bufio"
"fmt"
"math/bits"
"os"
"strconv"
)
func configure(scanner *bufio.Scanner) {
scanner.Split(bufio.ScanWords)
scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
scanned := scanner.Scan()
if !scanned {
panic("scan failed")
}
return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
i, _ := strconv.Atoi(getNextString(scanner))
return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
i, _ := strconv.ParseFloat(getNextString(scanner), 64)
return i
}
func main() {
fp := os.Stdin
wfp := os.Stdout
extra := 0
if os.Getenv("I") == "IronMan" {
fp, _ = os.Open(os.Getenv("END_GAME"))
extra = 100
}
scanner := bufio.NewScanner(fp)
configure(scanner)
writer := bufio.NewWriter(wfp)
defer func() {
r := recover()
if r != nil {
fmt.Fprintln(writer, r)
}
writer.Flush()
}()
solve(scanner, writer)
for i := 0; i < extra; i++ {
fmt.Fprintln(writer, "-----------------------------------")
solve(scanner, writer)
}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
h := getNextInt(scanner)
w := getNextInt(scanner)
k := getNextInt(scanner)
ss := make([]string, h)
for i := 0; i < h; i++ {
ss[i] = getNextString(scanner)
}
sq := makeGrid(h, w)
for y := 0; y < h; y++ {
for x := 0; x < w; x++ {
sq[y][x].b[0] = sq[y][x].b[0] | uint32(1<<uint(ss[y][x]-'a'))
}
}
for i := 1; i < 16; i++ {
for y := 0; y < h && y+1<<uint(i) <= h; y++ {
for x := 0; x < w && x+1<<uint(i) <= w; x++ {
sq[y][x].b[i] = sq[y][x].b[i] | sq[y][x].b[i-1]
sq[y][x].b[i] = sq[y][x].b[i] | sq[y+1<<uint(i-1)][x].b[i-1]
sq[y][x].b[i] = sq[y][x].b[i] | sq[y][x+1<<uint(i-1)].b[i-1]
sq[y][x].b[i] = sq[y][x].b[i] | sq[y+1<<uint(i-1)][x+1<<uint(i-1)].b[i-1]
}
}
}
lowers := make([]int, 2)
var ans int64
for y := 0; y < h; y++ {
for x := 0; x < w; x++ {
for i := 0; i < 2; i++ {
l := 0
r := min(h-y, w-x) + 1
for l+1 < r {
m := (l + r) >> 1
z := 32 - bits.LeadingZeros32(uint32(m))
b := sq[y][x].b[z-1]
b = b | sq[y+m-1<<uint(z-1)][x].b[z-1]
b = b | sq[y][x+m-1<<uint(z-1)].b[z-1]
b = b | sq[y+m-1<<uint(z-1)][x+m-1<<uint(z-1)].b[z-1]
if bits.OnesCount32(b) < k+i {
l = m
continue
}
r = m
}
lowers[i] = r
}
ans += int64(lowers[1] - lowers[0])
}
}
fmt.Fprintln(writer, ans)
}
func min(a, b int) int {
if a < b {
return a
}
return b
}
type square struct {
b [16]uint32
}
func makeGrid(h, w int) [][]square {
index := make([][]square, h, h)
data := make([]square, h*w, h*w)
for i := 0; i < h; i++ {
index[i] = data[i*w : (i+1)*w]
}
return index
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0