#549468 (Go) No.649 ここでちょっとQK！

• 問題: No.649 ここでちょっとQK！
• ユーザー: ccppjsrb
• 提出日時: 2020-09-07 09:07:04
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 378 ms / 3,000 ms
• コード長: 6,628 bytes
• コンパイル時間: 12,894 ms
• コンパイル使用メモリ: 238,124 KB
• 実行使用メモリ: 17,408 KB
• 最終ジャッジ日時: 2024-05-06 23:26:46
• 合計ジャッジ時間: 19,286 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	23 ms; 5,376 KB
testcase_04	AC	183 ms; 17,408 KB
testcase_05	AC	183 ms; 17,408 KB
testcase_06	AC	180 ms; 17,408 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	149 ms; 8,960 KB
testcase_13	AC	132 ms; 8,960 KB
testcase_14	AC	148 ms; 9,088 KB
testcase_15	AC	144 ms; 9,088 KB
testcase_16	AC	151 ms; 9,216 KB
testcase_17	AC	167 ms; 9,984 KB
testcase_18	AC	218 ms; 10,624 KB
testcase_19	AC	242 ms; 11,136 KB
testcase_20	AC	258 ms; 11,776 KB
testcase_21	AC	275 ms; 12,288 KB
testcase_22	AC	298 ms; 13,184 KB
testcase_23	AC	314 ms; 13,696 KB
testcase_24	AC	348 ms; 14,336 KB
testcase_25	AC	371 ms; 14,976 KB
testcase_26	AC	378 ms; 15,616 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	133 ms; 8,704 KB
testcase_31	AC	133 ms; 9,088 KB
testcase_32	AC	1 ms; 5,376 KB
testcase_33	AC	1 ms; 5,376 KB
testcase_34	AC	1 ms; 5,376 KB
testcase_35	AC	1 ms; 5,376 KB

ソースコード

package main

import (
	"bufio"
	"fmt"
	"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) {
	q := getNextInt(scanner)
	k := getNextInt(scanner)
	t := newMultiKeyTree(func(a, b interface{}) int {
		aa := a.(int64)
		bb := b.(int64)
		if aa == bb {
			return 0
		}
		if aa < bb {
			return -1
		}
		return 1
	})
	cnt := 0
	for i := 0; i < q; i++ {
		ord := getNextInt(scanner)
		if ord == 1 {
			t.Put(getNextInt64(scanner), 1)
			cnt++
			continue
		}
		if cnt < k {
			fmt.Fprintln(writer, -1)
			continue
		}
		v, _ := t.At(k)
		fmt.Fprintln(writer, v.Key)
		t.Remove(v.Key)
		cnt--
	}
}

type tree struct {
	Root          *node
	Comparator    func(a, b interface{}) int
	allowMultiKey bool
}
type node struct {
	Left, Right, Parent *node
	Key                 interface{}
	Value               interface{}
	size                int
}

func newTreeWithIntComparator() *tree {
	return newTree(func(a, b interface{}) int {
		aa := a.(int)
		bb := b.(int)
		if aa == bb {
			return 0
		}
		if aa < bb {
			return -1
		}
		return 1
	})
}
func newTree(comparator func(interface{}, interface{}) int) *tree {
	return &tree{Root: nil, Comparator: comparator}
}
func newMultiKeyTree(comparator func(interface{}, interface{}) int) *tree {
	return &tree{Root: nil, Comparator: comparator, allowMultiKey: true}
}
func newNode(parent *node, key, value interface{}) *node {
	return &node{Parent: parent, Key: key, Value: value, size: 1}
}
func (n *node) IsRoot() bool {
	return n.Parent == nil
}
func (n *node) IsLeft() bool {
	return !n.IsRoot() && n.Parent.Left == n
}
func (n *node) IsRight() bool {
	return !n.IsRoot() && n.Parent.Right == n
}
func (n *node) Update() {
	n.size = 1 + n.Left.Size() + n.Right.Size()
}
func (n *node) Size() int {
	if n == nil {
		return 0
	}
	return n.size
}
func (n *node) MaximumNode() *node {
	if n == nil {
		return n
	}
	if n.Right == nil {
		return n
	}
	return n.Right.MaximumNode()
}
func (n *node) MinimumNode() *node {
	if n == nil {
		return n
	}
	if n.Left == nil {
		return n
	}
	return n.Left.MinimumNode()
}
func (n *node) AppendLeft(m *node) {
	if n == nil {
		return
	}
	n.Left = m
	n.Update()
	if m == nil {
		return
	}
	m.Parent = n
}
func (n *node) AppendRight(m *node) {
	if n == nil {
		return
	}
	n.Right = m
	n.Update()
	if m == nil {
		return
	}
	m.Parent = n
}
func (t *tree) Put(key, value interface{}) {
	if t.Root == nil {
		t.Root = newNode(nil, key, value)
		return
	}
	now := t.Root
	for {
		compared := t.Comparator(key, now.Key)
		if compared > 0 {
			if now.Right == nil {
				now.Right = newNode(now, key, value)
				t.Update(now)
				return
			}
			now = now.Right
			continue
		}
		if compared < 0 || t.allowMultiKey {
			if now.Left == nil {
				now.Left = newNode(now, key, value)
				t.Update(now)
				return
			}
			now = now.Left
			continue
		}
		now.Value = value
		break
	}
}
func (t *tree) Get(key interface{}) (interface{}, bool) {
	now := t.Lookup(key)
	if now == nil {
		return nil, false
	}
	return now.Value, true
}
func (t *tree) Lookup(key interface{}) *node {
	now := t.Root
	for now != nil {
		compared := t.Comparator(key, now.Key)
		switch {
		case compared == 0:
			return now
		case compared < 0:
			now = now.Left
		case compared > 0:
			now = now.Right
		}
	}
	return nil
}
func (t *tree) Remove(key interface{}) {
	now := t.Lookup(key)
	if now == nil {
		return
	}
	for now.Size() > 1 {
		replace := now.Left.MaximumNode()
		if replace == nil {
			replace = now.Right.MinimumNode()
		}
		now.Key = replace.Key
		now.Value = replace.Value
		now = replace
	}
	parent := now.Parent
	switch {
	case now.IsRoot():
		t.Root = nil
	case now.IsLeft():
		parent.Left = nil
	case now.IsRight():
		parent.Right = nil
	}
	for parent != nil {
		parent.Update()
		parent = parent.Parent
	}
}
func (t *tree) Update(now *node) {
	for now != nil {
		now.Update()
		parent := now.Parent
		switch {
		case now.Left.Size() > now.Right.Size():
			t.Rotate(now.Left)
		case now.Left.Size() < now.Right.Size():
			t.Rotate(now.Right)
		}
		now = parent
	}
}
func (t *tree) Rotate(now *node) {
	parent := now.Parent
	grand := parent.Parent
	switch {
	case now.IsRight():
		parent.AppendRight(now.Left)
		now.AppendLeft(parent)
	case now.IsLeft():
		parent.AppendLeft(now.Right)
		now.AppendRight(parent)
	}
	switch {
	case grand == nil:
		t.Root = now
		now.Parent = nil
	case grand.Left == parent:
		grand.AppendLeft(now)
	case grand.Right == parent:
		grand.AppendRight(now)
	}
}
func (t *tree) Right() *node {
	return t.Root.MaximumNode()
}
func (t *tree) Left() *node {
	return t.Root.MinimumNode()
}
func (t *tree) Floor(key interface{}) (*node, bool) {
	now := t.Root
	var n *node
	for now != nil {
		compared := t.Comparator(key, now.Key)
		switch {
		case compared == 0:
			return now, true
		case compared < 0:
			now = now.Left
		case compared > 0:
			n = now
			now = now.Right
		}
	}
	return n, n != nil
}
func (t *tree) Ceiling(key interface{}) (*node, bool) {
	now := t.Root
	var n *node
	for now != nil {
		compared := t.Comparator(key, now.Key)
		switch {
		case compared == 0:
			return now, true
		case compared < 0:
			n = now
			now = now.Left
		case compared > 0:
			now = now.Right
		}
	}
	return n, n != nil
}
func (t *tree) Empty() bool {
	return t.Root == nil
}
func (t *tree) At(i int) (*node, bool) {
	var n *node
	now := t.Root
	for now != nil && i > 0 {
		if i <= now.Left.Size() {
			now = now.Left
			continue
		}
		i -= now.Left.Size() + 1
		if i <= 0 {
			n = now
		}
		now = now.Right
	}
	return n, n != nil
}