結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー |
![]() |
提出日時 | 2020-09-21 15:22:34 |
言語 | Go (1.23.4) |
結果 |
AC
|
実行時間 | 609 ms / 2,000 ms |
コード長 | 4,833 bytes |
コンパイル時間 | 13,382 ms |
コンパイル使用メモリ | 237,820 KB |
実行使用メモリ | 22,628 KB |
最終ジャッジ日時 | 2024-06-24 11:33:56 |
合計ジャッジ時間 | 17,256 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
package mainimport ("bufio""fmt""math""os""sort""strconv""strings")func out(x ...interface{}) {fmt.Println(x...)}var sc = bufio.NewScanner(os.Stdin)func getInt() int {sc.Scan()i, e := strconv.Atoi(sc.Text())if e != nil {panic(e)}return i}func getInts(N int) []int {ret := make([]int, N)for i := 0; i < N; i++ {ret[i] = getInt()}return ret}func getString() string {sc.Scan()return sc.Text()}// min, max, asub, absなど基本関数func max(a, b int) int {if a > b {return a}return b}func min(a, b int) int {if a < b {return a}return b}func asub(a, b int) int {if a > b {return a - b}return b - a}func abs(a int) int {if a >= 0 {return a}return -a}func lowerBound(a []int, x int) int {idx := sort.Search(len(a), func(i int) bool {return a[i] >= x})return idx}func upperBound(a []int, x int) int {idx := sort.Search(len(a), func(i int) bool {return a[i] > x})return idx}// 平衡二分探索木var (y uint = 88172645463325252)const inf = math.MaxInt64func xorshift() uint {y ^= y << 7y ^= y >> 9return y}type treapNode struct {value intpriority uintcount intleft *treapNoderight *treapNode}func newTreapNode(v int) *treapNode {return &treapNode{v, xorshift(), 1, nil, nil}}func treapRotateRight(n *treapNode) *treapNode {l := n.leftn.left = l.rightl.right = nreturn l}func treapRotateLeft(n *treapNode) *treapNode {r := n.rightn.right = r.leftr.left = nreturn r}func treapInsert(n *treapNode, v int) *treapNode {if n == nil {return newTreapNode(v)}if n.value == v {n.count++return n}if n.value > v {n.left = treapInsert(n.left, v)if n.priority > n.left.priority {n = treapRotateRight(n)}} else {n.right = treapInsert(n.right, v)if n.priority > n.right.priority {n = treapRotateLeft(n)}}return n}func treapDelete(n *treapNode, v int) *treapNode {if n == nil {panic("node is not found!")}if n.value > v {n.left = treapDelete(n.left, v)return n}if n.value < v {n.right = treapDelete(n.right, v)return n}// n.value == vif n.count > 1 {n.count--return n}if n.left == nil && n.right == nil {return nil}if n.left == nil {n = treapRotateLeft(n)} else if n.right == nil {n = treapRotateRight(n)} else {// n.left != nil && n.right != nilif n.left.priority < n.right.priority {n = treapRotateRight(n)} else {n = treapRotateLeft(n)}}return treapDelete(n, v)}func treapCount(n *treapNode) int {if n == nil {return 0}return n.count + treapCount(n.left) + treapCount(n.right)}func treapString(n *treapNode) string {if n == nil {return ""}result := make([]string, 0)if n.left != nil {result = append(result, treapString(n.left))}result = append(result, fmt.Sprintf("%d:%d", n.value, n.count))if n.right != nil {result = append(result, treapString(n.right))}return strings.Join(result, " ")}func treapMin(n *treapNode) int {if n.left != nil {return treapMin(n.left)}return n.value}func treapLEMax(n *treapNode, v int) int {ret := -inft := nfor t != nil {if t.value <= v {ret = max(ret, t.value)}if t.value > v {t = t.left} else {t = t.right}}return ret}func treapGEMin(n *treapNode, v int) int {ret := inft := nfor t != nil {if t.value >= v {ret = min(ret, t.value)}if t.value < v {t = t.right} else {t = t.left}}return ret}func treapMax(n *treapNode) int {if n.right != nil {return treapMax(n.right)}return n.value}type treap struct {root *treapNodesize int}func (t *treap) Insert(v int) {t.root = treapInsert(t.root, v)t.size++}func (t *treap) Delete(v int) {t.root = treapDelete(t.root, v)t.size--}func (t *treap) String() string {return treapString(t.root)}func (t *treap) Count() int {return t.size}func (t *treap) Min() int {return treapMin(t.root)}func (t *treap) LEMax(v int) int {return treapLEMax(t.root, v)}func (t *treap) Max() int {return treapMax(t.root)}func (t *treap) GEMin(v int) int {return treapGEMin(t.root, v)}func main() {sc.Split(bufio.ScanWords)sc.Buffer([]byte{}, 1000000)N := getInt()A := getInts(N)lt := &treap{}rt := &treap{}lt.Insert(A[0])for i := 2; i < N; i++ {rt.Insert(A[i])}result := inffor i := 1; i < N-1; i++ {a := lt.Min()b := rt.Min()if a < A[i] && b < A[i] {result = min(result, a+b+A[i])}c := lt.GEMin(A[i])d := rt.GEMin(A[i])if c != inf && d != inf && c > A[i] && d > A[i] {result = min(result, c+d+A[i])}lt.Insert(A[i])rt.Delete(A[i+1])}if result == inf {out(-1)return}out(result)}