ynzwtks

func solve() {
	n, k := 5, 3
	perm := make([]int, k)
	for i := 0; i < k; i++ {
		perm[i] = i
	}

	var f func() bool
	f = func() bool {
		for ti := k - 1; ti >= 0; ti-- {

ynzwtks

package main

import (
	"fmt"
	"math/bits"
)

const (
	INF = 1 << 60
)

ynzwtks

package main

import "fmt"

const (
	INF = 1 << 60
)

type Note[T any] struct {
	page *Page[T]

ynzwtks

package main

import (
	"fmt"
	"golang.org/x/exp/constraints"
	"sort"
)

const (
	INF = 1 << 60

ynzwtks

package main

import (
	"fmt"
	"golang.org/x/exp/constraints"
)

const (
	INF = 1 << 60
)

ynzwtks

package main

import (
	"fmt"
	"golang.org/x/exp/constraints"
)

// 汎用Priority Queue

type PQ[T comparable] struct {

ynzwtks

package main

import (
	"fmt"
	"golang.org/x/exp/constraints"
	"sort"
)

const (
	INF = 1 << 60

ynzwtks

package main

import (
	"fmt"
)

//-------------------- BitVector (1ビットを圧縮保持) --------------------//

type BitVector struct {
	n      int      // ベクトル長

ynzwtks

package main

import "fmt"

// ABC344 E Insert or Erase
// https://atcoder.jp/contests/abc344/tasks/abc344_e

// List　双方向リンクリスト
type List[T comparable] struct {
	first                *element[T]

ynzwtks

package main

import (
	"fmt"
)

const (
	INF = 1 << 60
)