結果

問題 No.877 Range ReLU Query
ユーザー ccppjsrb
提出日時 2019-11-09 19:47:51
言語 Go
(1.13)
結果
AC  
実行時間 611 ms
コード長 3,536 Byte
コンパイル時間 591 ms
使用メモリ 17,476 KB
最終ジャッジ日時 2019-11-09 19:47:59

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00_sample_01 AC 3 ms
7,060 KB
22_random_01 AC 5 ms
9,036 KB
22_random_02 AC 4 ms
7,060 KB
22_random_03 AC 6 ms
7,060 KB
22_random_04 AC 4 ms
7,068 KB
22_random_05 AC 3 ms
7,068 KB
22_random_06 AC 4 ms
7,064 KB
22_random_07 AC 4 ms
7,064 KB
22_random_08 AC 6 ms
7,060 KB
22_random_09 AC 3 ms
7,064 KB
22_random_10 AC 4 ms
7,060 KB
33_large_01 AC 466 ms
15,480 KB
33_large_02 AC 402 ms
15,456 KB
33_large_03 AC 320 ms
13,336 KB
33_large_04 AC 364 ms
13,336 KB
33_large_05 AC 496 ms
15,484 KB
43_max_01 AC 553 ms
15,464 KB
43_max_02 AC 526 ms
15,600 KB
43_max_03 AC 534 ms
15,476 KB
99_challenge01.txt AC 611 ms
17,476 KB
テストケース一括ダウンロード

ソースコード

diff #
package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"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)

	aa := make(AA, n)
	qq := make(QQ, q)
	for i := 0; i < n; i++ {
		aa[i].a = getNextInt64(scanner)
		aa[i].i = i
	}

	for i := 0; i < q; i++ {
		t := getNextInt(scanner)
		l := getNextInt(scanner) - 1
		r := getNextInt(scanner)
		x := getNextInt64(scanner)
		if t == 1 {
			qq[i].i = i
			qq[i].l = l
			qq[i].r = r
			qq[i].x = x
		}
	}

	sort.Sort(aa)
	sort.Sort(qq)
	ai := 0
	ans := make([]int64, q)
	for i := 0; i < q; i++ {
		for ai < n && aa[ai].a > qq[i].x {
			seg.add(aa[ai].i, aa[ai].a)
			seg2.add(aa[ai].i, 1)
			ai++
		}
		ans[qq[i].i] = seg.rangeSum(qq[i].l, qq[i].r) - seg2.rangeSum(qq[i].l, qq[i].r)*qq[i].x
	}

	for i := 0; i < q; i++ {
		fmt.Fprintln(writer, ans[i])
	}

	writer.Flush()
}

type A struct {
	a int64
	i int
}

type AA []A

func (a AA) Len() int           { return len(a) }
func (a AA) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }
func (a AA) Less(i, j int) bool { return a[i].a > a[j].a }

type Q struct {
	i, l, r int
	x       int64
}

type QQ []Q

func (a QQ) Len() int           { return len(a) }
func (a QQ) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }
func (a QQ) Less(i, j int) bool { return a[i].x > a[j].x }

// 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) 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