#635438 (Go) No.1441 MErGe

• 問題: No.1441 MErGe
• ユーザー: c-yan
• 提出日時: 2021-03-28 22:50:33
• 言語: Go (1.22.1)
• 結果: TLE
• 実行時間: -
• コード長: 2,279 bytes
• コンパイル時間: 14,160 ms
• コンパイル使用メモリ: 218,468 KB
• 実行使用メモリ: 11,264 KB
• 最終ジャッジ日時: 2024-11-29 09:28:28
• 合計ジャッジ時間: 26,257 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 10,496 KB
testcase_01	AC	1 ms; 11,264 KB
testcase_02	AC	1 ms; 10,496 KB
testcase_03	AC	3 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	8 ms; 5,248 KB
testcase_06	AC	8 ms; 5,248 KB
testcase_07	AC	8 ms; 5,248 KB
testcase_08	AC	95 ms; 5,248 KB
testcase_09	AC	97 ms; 5,248 KB
testcase_10	AC	159 ms; 5,248 KB
testcase_11	AC	140 ms; 5,248 KB
testcase_12	AC	159 ms; 5,248 KB
testcase_13	AC	420 ms; 7,808 KB
testcase_14	AC	430 ms; 7,808 KB
testcase_15	AC	572 ms; 7,680 KB
testcase_16	AC	399 ms; 7,808 KB
testcase_17	AC	394 ms; 7,680 KB
testcase_18	AC	336 ms; 7,168 KB
testcase_19	AC	376 ms; 7,936 KB
testcase_20	AC	299 ms; 6,912 KB
testcase_21	AC	260 ms; 6,272 KB
testcase_22	AC	398 ms; 6,784 KB
testcase_23	AC	549 ms; 8,448 KB
testcase_24	AC	541 ms; 8,320 KB
testcase_25	AC	606 ms; 8,448 KB
testcase_26	AC	540 ms; 8,320 KB
testcase_27	AC	559 ms; 8,448 KB
testcase_28	TLE	-
testcase_29	TLE	-

ソースコード

package main

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

type rangeAddSegmentTree struct {
	size   int
	offset int
	data   []int
}

func newRangeAddSegmentTree(n int) rangeAddSegmentTree {
	var result rangeAddSegmentTree
	result.size = n
	t := 1
	for t < n {
		t *= 2
	}
	result.offset = t - 1
	result.data = make([]int, 2*t-1)
	return result
}

func (st rangeAddSegmentTree) rangeAdd(start, stop, value int) {
	l := start + st.offset
	r := stop + st.offset
	for l < r {
		if l&1 == 0 {
			st.data[l] += value
		}
		if r&1 == 0 {
			st.data[r-1] += value
		}
		l /= 2
		r = (r - 1) / 2
	}
}

func (st rangeAddSegmentTree) get(index int) int {
	i := index + st.offset
	result := st.data[i]
	for i > 0 {
		i = (i - 1) / 2
		result += st.data[i]
	}
	return result
}

func (st rangeAddSegmentTree) set(index, value int) {
	st.rangeAdd(index, index+1, value-st.get(index))
}

func (st rangeAddSegmentTree) bisectLeft(value int) int {
	return sort.Search(st.size, func(i int) bool { return st.get(i) >= value })
}

func main() {
	defer flush()

	N := readInt()
	Q := readInt()

	A := make([]int, N)
	for i := 0; i < N; i++ {
		A[i] = readInt()
		if i != 0 {
			A[i] += A[i-1]
		}
	}

	st := newRangeAddSegmentTree(N + 1)
	for i := 0; i < N+1; i++ {
		st.rangeAdd(i, i+1, i)
	}

	for i := 0; i < Q; i++ {
		T := readInt()
		l := readInt() - 1
		r := readInt() - 1

		x := st.bisectLeft(l)
		y := st.bisectLeft(r+1) - 1
		if T == 1 {
			j := st.bisectLeft(l + 1)
			for k := j; k < y+1; k++ {
				st.set(k, st.get(x))
			}
			st.rangeAdd(y+1, N+1, l-r)
		} else if T == 2 {
			if x != 0 {
				println(A[y] - A[x-1])
			} else {
				println(A[y])
			}
		}
	}
}

const (
	ioBufferSize = 1 * 1024 * 1024 // 1 MB
)

var stdinScanner = func() *bufio.Scanner {
	result := bufio.NewScanner(os.Stdin)
	result.Buffer(make([]byte, ioBufferSize), ioBufferSize)
	result.Split(bufio.ScanWords)
	return result
}()

func readString() string {
	stdinScanner.Scan()
	return stdinScanner.Text()
}

func readInt() int {
	result, err := strconv.Atoi(readString())
	if err != nil {
		panic(err)
	}
	return result
}

var stdoutWriter = bufio.NewWriter(os.Stdout)

func flush() {
	stdoutWriter.Flush()
}

func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(stdoutWriter, args...)
}