結果

問題 No.876 Range Compress Query
ユーザー ccppjsrb
提出日時 2019-11-09 15:29:20
言語 Go
(1.13)
結果
WA   .
実行時間 -
コード長 3,318 Byte
コンパイル時間 4,133 ms
使用メモリ 9,816 KB
最終ジャッジ日時 2019-11-09 15:29:28

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00_sample_01 AC 2 ms
7,080 KB
22_random_01 WA -
22_random_02 AC 5 ms
7,076 KB
22_random_03 WA -
22_random_04 AC 4 ms
7,076 KB
22_random_05 AC 5 ms
7,076 KB
22_random_06 AC 5 ms
8,912 KB
22_random_07 WA -
22_random_08 AC 5 ms
7,080 KB
22_random_09 WA -
22_random_10 AC 3 ms
7,076 KB
33_large_01 AC 272 ms
9,468 KB
33_large_02 AC 231 ms
9,460 KB
33_large_03 AC 227 ms
9,468 KB
33_large_04 AC 272 ms
9,468 KB
33_large_05 AC 222 ms
9,464 KB
43_max_01 AC 290 ms
9,696 KB
43_max_02 AC 289 ms
9,816 KB
43_max_03 AC 308 ms
9,812 KB
テストケース一括ダウンロード

ソースコード

diff #
package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 500001), 500000)
	return scanner
}

func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	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 getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(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

	if len(os.Args) > 1 {
		fp, _ = os.Open(os.Args[1])
		if len(os.Args) > 2 {
			wfp, _ = os.Create(os.Args[2])
		}
	}

	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)

	n := getNextInt(scanner)
	q := getNextInt(scanner)

	seg := Segment{}
	seg.init(n)
	seg2 := Segment{}
	seg2.init(n)

	for i := 0; i < n; i++ {
		seg.bucket[0][i] = getNextInt64(scanner)
		if i == 0 {
			continue
		}
		if seg.bucket[0][i] != seg.bucket[0][i-1] {
			seg2.add(i-1, 1)
		}
	}

	for i := 0; i < q; i++ {
		t := getNextInt(scanner)
		l := getNextInt(scanner) - 1
		r := getNextInt(scanner) - 1
		if t == 1 {
			seg.rangeAdd(l, r+1, getNextInt64(scanner))
			if l > 0 {
				if seg.get(l-1) != seg.get(l) {
					seg2.add(l-1, 1-seg2.bucket[0][l-1])
				} else {
					seg2.add(l-1, -seg2.bucket[0][l-1])
				}
			}
			if r < n-1 {
				if seg.get(r+1) != seg.get(r) {
					seg2.add(r, 1-seg2.bucket[0][r-1])
				} else {
					seg2.add(r, -seg2.bucket[0][r-1])
				}
			}
			continue
		}
		fmt.Fprintln(writer, seg2.rangeSum(l, r)+1)
	}
	writer.Flush()
}

// Segment ...
type Segment struct {
	n, h, i, chunk int
	unit           []int
	bucket         [][]int64
}

func (seg *Segment) init(n int) {
	seg.n = n
	seg.unit = make([]int, 1)
	seg.unit[0] = 1
	seg.bucket = make([][]int64, 1)
	seg.bucket[0] = make([]int64, n)

	chunk := 8
	for i := 0; n > 1; i++ {
		n = (n-1)/chunk + 1
		seg.bucket = append(seg.bucket, make([]int64, n))
		seg.unit = append(seg.unit, seg.unit[i]*chunk)
	}
	seg.h = len(seg.unit)
	seg.chunk = chunk
}

func (seg *Segment) get(index int) int64 {
	var value int64
	for seg.i = 0; seg.i < seg.h; seg.i++ {
		value += seg.bucket[seg.i][index/seg.unit[seg.i]]
		index /= seg.unit[seg.i]
	}
	return value
}

func (seg *Segment) rangeAdd(l, r int, value int64) {
	for index := l; index < r; index += seg.unit[seg.i] {
		for seg.i = 0; seg.i < seg.h-1 && index%seg.unit[seg.i+1] == 0; seg.i++ {
			if index+seg.unit[seg.i+1] >= r {
				break
			}
		}
		seg.bucket[seg.i][index/seg.unit[seg.i]] += value
	}
}

func (seg *Segment) add(index int, value int64) {
	for i := 0; i < seg.h; i++ {
		seg.bucket[i][index/seg.unit[i]] += value
	}
}

func (seg *Segment) rangeSum(l, r int) int64 {
	var value int64
	for index := l; index < r; index += seg.unit[seg.i] {
		for seg.i = 0; seg.i < seg.h-1 && index%seg.unit[seg.i+1] == 0; seg.i++ {
			if index+seg.unit[seg.i+1] >= r {
				break
			}
		}
		value += seg.bucket[seg.i][index/seg.unit[seg.i]]
	}
	return value
}
0