kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
mikhail-dvorkin__competitions__3095312/codeforces/round901/a.kt | package codeforces.round901
private fun solve(): Long {
val (_, _, k) = readInts()
val (a, b) = List(2) { readInts().toMutableList() }
val moves = mutableListOf<Long>()
var i = 0
while (i < k) {
val move = if (i % 2 == 0) makeMove(a, b) else makeMove(b, a)
moves.add(move)
if (i >= 4 && moves[moves.size - 1] == moves[moves.size - 3] && moves[moves.size - 2] == moves[moves.size - 4]) {
i += maxOf((k - 1 - i) / 2 * 2, 0)
}
i++
}
return a.sumOf { it.toLong() }
}
private fun makeMove(a: MutableList<Int>, b: MutableList<Int>): Long {
val aMin = a.min()
val bMax = b.max()
if (aMin >= bMax) return 0
a.remove(aMin); a.add(bMax)
b.add(aMin); b.remove(bMax)
return aMin with bMax
}
private infix fun Int.with(that: Int) = (toLong() shl 32) or that.toLong()
fun main() = repeat(readInt()) { println(solve()) }
private fun readInt() = readln().toInt()
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/round901/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class codeforces.round901.AKt {\n private static final long solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n 3... |
mikhail-dvorkin__competitions__3095312/codeforces/round901/d.kt | package codeforces.round901
private fun solve(): Double {
val (n, m) = readInts()
val d = List(n + 1) { DoubleArray(m - n + 1) }
for (i in 1..n) {
var kPrevBest = 0
for (s in d[i].indices) {
val range = maxOf(kPrevBest - 56, 0)..minOf(kPrevBest + 1, s)
val (kBest, best) = range.minByAndValue { k -> (i + s - 1.0 - k) / (1 + k) + d[i - 1][s - k] }
d[i][s] = best
kPrevBest = kBest
}
}
return d[n][m - n] * 2 + n
}
private inline fun <T, R : Comparable<R>> Iterable<T>.minByAndValue(crossinline selector: (T) -> R) = asSequence().map { it to selector(it) }.minBy { it.second }
fun main() = repeat(1) { println(solve()) }
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/round901/DKt$solve$$inlined$minByAndValue$1.class",
"javap": "Compiled from \"d.kt\"\npublic final class codeforces.round901.DKt$solve$$inlined$minByAndValue$1 implements kotlin.jvm.functions.Function1<java.lang.Integer, kotlin.Pair<? extend... |
mikhail-dvorkin__competitions__3095312/codeforces/round752/c.kt | package codeforces.round752
const val M = 998244353
private fun solve(): Long {
readLn()
val a = readInts()
val memoNext = IntArray(a.size)
val memoValue = LongArray(a.size)
fun solve(i: Int, next: Int): Long {
if (i == -1) return 0
if (memoNext[i] == next) return memoValue[i]
val countHere = (a[i] + next - 1) / next
val res = (i + 1L) * (countHere - 1) + solve(i - 1, a[i] / countHere)
memoNext[i] = next
memoValue[i] = res
return res
}
return a.indices.sumOf { solve(it - 1, a[it]) % M } % M
}
fun main() = repeat(readInt()) { println(solve()) }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/round752/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class codeforces.round752.CKt {\n public static final int M;\n\n private static final long solve();\n Code:\n 0: invokestatic #10 // Method readL... |
mikhail-dvorkin__competitions__3095312/codeforces/kotlinheroes6/practice/g.kt | package codeforces.kotlinheroes6.practice
fun main() {
val (_, m) = readInts()
val a = readLongs()
val capital = a.withIndex().minByOrNull { it.value }!!.index
data class Edge(val u: Int, val v: Int, val weight: Long)
val edges = List(m) {
val (uIn, vIn, weight) = readLongs()
Edge((uIn - 1).toInt(), (vIn - 1).toInt(), weight)
} + List(a.size) {
Edge(it, capital, a[it] + a[capital])
}
val dsu = DisjointSetUnion(a.size)
var ans = 0L
for (edge in edges.sortedBy { it.weight }) {
if (dsu[edge.u] == dsu[edge.v]) continue
dsu.unite(edge.u, edge.v)
ans += edge.weight
}
println(ans)
}
class DisjointSetUnion(n: Int) {
val p: IntArray = IntArray(n) { it }
val r = java.util.Random(566)
operator fun get(v: Int): Int = if (p[v] == v) v else { p[v] = get(p[v]); p[v] }
fun unite(v: Int, u: Int) = if (r.nextBoolean()) p[get(v)] = get(u) else p[get(u)] = get(v)
}
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
private fun readLongs() = readStrings().map { it.toLong() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/kotlinheroes6/practice/GKt$main$Edge.class",
"javap": "Compiled from \"g.kt\"\npublic final class codeforces.kotlinheroes6.practice.GKt$main$Edge {\n private final int u;\n\n private final int v;\n\n private final long weight;\n\n public... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2022/qual/d1.kt | package codeforces.vk2022.qual
const val VALUES = "6789TJQKA"
const val SUITS = "CDSH"
val INIT = VALUES.indexOf('9')
fun main() {
val totalCards = VALUES.length * SUITS.length
val allCardsList = (0 until totalCards).toList()
val aliceList = readStrings().map { parseCard(it) }
val bobList = allCardsList - aliceList.toSet()
val moveBit = 1L shl totalCards
val allMask = moveBit - 1
val aliceMask = aliceList.sumOf { 1L shl it }
val bobMask = bobList.sumOf { 1L shl it }
val memo = mutableMapOf<Long, Boolean>()
val initial = allMask
fun solve(position: Long): Boolean = memo.getOrPut(position) {
val move = (position shr totalCards) > 0
val otherMove = if (move) 0 else moveBit
val present = position and allMask
val me = present and (if (move) bobMask else aliceMask)
var canMove = false
for (suit in SUITS.indices) {
for (dir in -1..1 step 2) {
var canPlayValue = INIT
while (true) {
val isPresent = present.hasBit (suit * VALUES.length + canPlayValue)
if (isPresent) break
canPlayValue += dir
if (canPlayValue == VALUES.length) canPlayValue = -1
if (canPlayValue == -1) break
}
if (canPlayValue == -1) continue
if (canPlayValue == INIT && dir < 0) continue
val canPlay = suit * VALUES.length + canPlayValue
val canPlayBit = 1L shl canPlay
if ((me and canPlayBit) == 0L) continue
if (me == canPlayBit) return@getOrPut move
canMove = true
if (solve(otherMove or present xor canPlayBit) == move) return@getOrPut move
}
}
if (!canMove) solve(otherMove or present) else !move
}
println(if (solve(initial)) "Bob" else "Alice")
}
fun parseCard(card: String) = SUITS.indexOf(card[1]) * VALUES.length + VALUES.indexOf(card[0])
private fun Long.bit(index: Int) = shr(index) and 1
private fun Long.hasBit(index: Int) = bit(index) != 0L
private fun readStrings() = readln().split(" ")
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2022/qual/D1Kt.class",
"javap": "Compiled from \"d1.kt\"\npublic final class codeforces.vk2022.qual.D1Kt {\n public static final java.lang.String VALUES;\n\n public static final java.lang.String SUITS;\n\n private static final int INIT;... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2022/qual/c.kt | package codeforces.vk2022.qual
private fun solve() {
readln()
val a = readInts()
var ans = 1
var nextHigh = a.last() + 1
val seen = mutableSetOf<Pair<Int, Int>>()
for (i in a.indices.reversed()) {
for (t in 1 downTo 0) {
val high = a[i] + t
if (high > nextHigh) continue
nextHigh = nextHigh.coerceAtMost(high - 1)
var j = i
var low = high
while (true) {
if (!seen.add(low to j)) break
while (j > 0 && a[j] > low) j--
if (j < 0 || a[j] < low - 1 || a[j] > low) break
low--
j--
}
ans = ans.coerceAtLeast(high - low)
}
}
println(ans)
}
fun main() = repeat(readInt()) { solve() }
private fun readInt() = readln().toInt()
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2022/qual/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class codeforces.vk2022.qual.CKt {\n private static final void solve();\n Code:\n 0: invokestatic #12 // Method kotlin/io/ConsoleKt.readln:()Lj... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2022/round1/c.kt | package codeforces.vk2022.round1
const val M = 26
private fun solve() {
readln()
val s = readln().map { it - 'a' }.toIntArray()
val count = IntArray(M)
for (c in s) count[c]++
val byFreq = count.indices.sortedByDescending { count[it] }
var answer = s.size + 1
var answerString = ""
val a = IntArray(s.size)
val aCount = IntArray(M)
for (diff in 1..M) {
if (s.size % diff != 0) continue
val need = s.size / diff
val use = byFreq.take(diff).toSet()
a.fill(-1)
aCount.fill(0)
var current = s.size
for (i in s.indices) {
if (s[i] in use && aCount[s[i]] < need) {
a[i] = s[i]
aCount[s[i]]++
current--
}
}
if (current < answer) {
answer = current
var j = 0
for (i in s.indices) {
if (a[i] != -1) continue
while (j !in use || aCount[j] == need) j++
a[i] = j
aCount[j]++
}
answerString = a.joinToString("") { ('a'.code + it).toChar().toString() }
}
}
println(answer)
println(answerString)
}
fun main() = repeat(readInt()) { solve() }
private fun readInt() = readln().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2022/round1/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class codeforces.vk2022.round1.CKt {\n public static final int M;\n\n private static final void solve();\n Code:\n 0: invokestatic #12 // Me... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2022/round1/h1_to_upsolve.kt | package codeforces.vk2022.round1
import kotlin.time.ExperimentalTime
import kotlin.time.measureTime
private fun solve() {
val (h, w, k) = readInts()
val zero = 0.toModular()
val one = 1.toModular()
val broken = List(k) { readInts().map { it - 1 } }
val powerOfTwo = Array(h * w + 1) { one }
for (i in 1 until powerOfTwo.size) {
powerOfTwo[i] = 2 * powerOfTwo[i - 1]
}
var ans = 0.toModular()
for (hei in 1..h) for (wid in 1..w) {
for (y0 in 0 until hei) for (y1 in 0 until hei) for (x0 in 0 until wid) for (x1 in 0 until wid) {
if ((x0 == 0) xor (y0 == 0)) continue
if ((x1 == wid - 1) xor (y1 == hei - 1)) continue
// if ((x0 == wid - 1) && (y1 != 0)) continue
// if ((y0 == hei - 1) && (x1 != 0)) continue
val emptyByBorders = (if (y0 == 0) 0 else (y0 + x0 - 1)) + (if (y1 == hei - 1) 0 else (hei - y1 + wid - x1 - 3))
val borderImportant = setOf(0 to x0, y0 to 0, hei - 1 to x1, y1 to wid - 1)
val variable = hei * wid - emptyByBorders - borderImportant.size
// println("$hei $wid $y0 $y1 $x0 $x1 -> $variable")
// ans += powerOfTwo[variable]
}
}
println(ans)
}
@OptIn(ExperimentalTime::class)
fun main() {
measureTime {
repeat(readInt()) { solve() }
}.also { System.err.println(it) }
}
//private fun Int.toModular() = toDouble(); typealias Modular = Double
private fun Int.toModular() = Modular1(this)//toDouble()
private class Modular1 {
companion object {
const val M = 998244353
}
val x: Int
@Suppress("ConvertSecondaryConstructorToPrimary")
constructor(value: Int) { x = (value % M).let { if (it < 0) it + M else it } }
operator fun plus(that: Modular1) = Modular1((x + that.x) % M)
operator fun minus(that: Modular1) = Modular1((x + M - that.x) % M)
operator fun times(that: Modular1) = (x.toLong() * that.x % M).toInt().toModular()
private fun modInverse() = Modular1(x.toBigInteger().modInverse(M.toBigInteger()).toInt())
operator fun div(that: Modular1) = times(that.modInverse())
override fun toString() = x.toString()
}
private operator fun Int.plus(that: Modular1) = Modular1(this) + that
private operator fun Int.minus(that: Modular1) = Modular1(this) - that
private operator fun Int.times(that: Modular1) = Modular1(this) * that
private operator fun Int.div(that: Modular1) = Modular1(this) / that
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2022/round1/H1_to_upsolveKt.class",
"javap": "Compiled from \"h1_to_upsolve.kt\"\npublic final class codeforces.vk2022.round1.H1_to_upsolveKt {\n private static final void solve();\n Code:\n 0: invokestatic #10 /... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2022/round1/d.kt | package codeforces.vk2022.round1
import kotlin.math.roundToLong
import kotlin.math.sqrt
private fun solve() {
readln()
val a = readInts()
var ans = 1
val toTest = mutableSetOf<Long>()
for (i in a.indices) for (j in 0 until i) {
val ba = a[i] - a[j]
for (d in 1..ba) {
if (d * d > ba) break
if (ba % d != 0) continue
val e = ba / d
if (((d xor e) and 1) != 0) continue
val q = (d + e) / 2
val x = q.toLong() * q - a[i]
if (x >= 0) toTest.add(x)
}
}
for (x in toTest) {
val current = a.count { b ->
val y = b + x
val z = sqrt(y.toDouble()).roundToLong()
y == z * z
}
ans = ans.coerceAtLeast(current)
}
println(ans)
}
fun main() = repeat(readInt()) { solve() }
private fun readInt() = readln().toInt()
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2022/round1/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class codeforces.vk2022.round1.DKt {\n private static final void solve();\n Code:\n 0: invokestatic #12 // Method kotlin/io/ConsoleKt.readln:... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2022/round1/f.kt | package codeforces.vk2022.round1
fun main() {
val (n, qIn) = readInts()
val pOpenClose = qIn / 10_000.toModular()
val one = 1.toModular()
val pCloseOpen = one - pOpenClose
val cnk = List(n + 1) { i -> Array(i + 1) { one } }
for (i in cnk.indices) {
for (j in 1 until i) {
cnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j]
}
}
val fact2 = Array(n + 1) { one }
fun fact2(i: Int) = fact2[i]
for (i in 1..n) {
fact2[i] = ((2 * i - 1) * fact2(i - 1))
}
val pPaired = List(n + 1) { i -> Array(i) { one } }
for (i in 0..n) {
for (k in 0 until i) {
val kk = i - 1 - k
pPaired[i][k] = ((cnk[i][k + 1] * fact2(k) * fact2(kk)) / fact2(i))
}
}
val pAtLeast = List(n + 1) { i -> Array(i) { one } }
fun pAtLeast(i: Int, j: Int): Modular {
if (j >= i) return one
return pAtLeast[i][j]
}
for (i in 0..n) {
for (j in 0 until i) {
if (i + j > n) continue
var pij = 0.toModular()
for (k in 0 until i) {
val kk = i - 1 - k
var pBalance = pAtLeast(k, j + 1) * pOpenClose
if (j >= 1) {
pBalance = (pAtLeast(k, j - 1) * pCloseOpen) + pBalance
}
pij = pPaired[i][k] * pAtLeast(kk, j) * pBalance + pij
}
pAtLeast[i][j] = pij
}
}
println(pAtLeast(n, 0))
}
//private fun Int.toModular() = toDouble(); typealias Modular = Double
private fun Int.toModular() = Modular(this)//toDouble()
private class Modular {
companion object {
const val M = 998244353
}
val x: Int
@Suppress("ConvertSecondaryConstructorToPrimary")
constructor(value: Int) { x = (value % M).let { if (it < 0) it + M else it } }
operator fun plus(that: Modular) = Modular((x + that.x) % M)
operator fun minus(that: Modular) = Modular((x + M - that.x) % M)
operator fun times(that: Modular) = (x.toLong() * that.x % M).toInt().toModular()
private fun modInverse() = Modular(x.toBigInteger().modInverse(M.toBigInteger()).toInt())
operator fun div(that: Modular) = times(that.modInverse())
override fun toString() = x.toString()
}
private operator fun Int.plus(that: Modular) = Modular(this) + that
private operator fun Int.minus(that: Modular) = Modular(this) - that
private operator fun Int.times(that: Modular) = Modular(this) * that
private operator fun Int.div(that: Modular) = Modular(this) / that
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2022/round1/FKt.class",
"javap": "Compiled from \"f.kt\"\npublic final class codeforces.vk2022.round1.FKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2021/qual/e12.kt | package codeforces.vk2021.qual
private fun permutation(comparisons: List<Boolean>, n: Int): Pair<Int, List<Int>> {
var pos = 0
fun permutation(m: Int): List<Int> {
if (m <= 1) return List(m) { 0 }
val left = m / 2
val right = m - left
val permutationLeft = permutation(left)
val permutationRight = permutation(right)
val leftNumbers = mutableListOf<Int>()
val rightNumbers = mutableListOf<Int>()
for (i in 0 until m) {
val half = if (leftNumbers.size < left && rightNumbers.size < right) {
if (comparisons.getOrElse(pos++) { false }) rightNumbers else leftNumbers
} else if (leftNumbers.size < left) leftNumbers else rightNumbers
half.add(i)
}
return permutationLeft.map { leftNumbers[it] } + permutationRight.map { rightNumbers[it] }
}
val permutation = permutation(n)
return pos - comparisons.size to permutation
}
private fun solve(comparisons: List<Boolean>): List<Int> {
var low = 0
var high = comparisons.size + 2
while (low + 1 < high) {
val n = (low + high) / 2
val (error, permutation) = permutation(comparisons, n)
if (error == 0) return permutation
if (error < 0) low = n else high = n
}
for (d in 0..comparisons.size) for (sign in -1..1 step 2) {
val n = low + sign * d
if (n <= 0) continue
val (error, permutation) = permutation(comparisons, n)
if (error == 0) return permutation
}
error("")
}
fun main() {
val comparisons = readLn().map { it == '1' }
val permutation = solve(comparisons)
println(permutation.size)
println(permutation.joinToString(" ") { (it + 1).toString() })
}
private fun readLn() = readLine()!!
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2021/qual/E12Kt.class",
"javap": "Compiled from \"e12.kt\"\npublic final class codeforces.vk2021.qual.E12Kt {\n private static final kotlin.Pair<java.lang.Integer, java.util.List<java.lang.Integer>> permutation(java.util.List<java.lang.Bo... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2021/qual/ad.kt | package codeforces.vk2021.qual
fun main() {
val words = "lock, unlock, red, orange, yellow, green, blue, indigo, violet".split(", ")
val wordsMap = words.withIndex().associate { it.value to it.index }
val init = List(readInt()) { wordsMap[readLn()]!! }
val st = SegmentsTreeSimple(init.size)
for (i in init.indices) {
st[i] = init[i]
}
fun answer() {
val ans = st.answer()
println(words[ans])
}
answer()
repeat(readInt()/*0*/) {
val (indexString, word) = readLn().split(" ")
val index = indexString.toInt() - 1
val newWord = wordsMap[word]!!
st[index] = newWord
answer()
}
}
private class SegmentsTreeSimple(var n: Int) {
var lock: IntArray
private var colorIfLocked: IntArray
private var colorIfUnlocked: IntArray
var size = 1
init {
while (size <= n) {
size *= 2
}
lock = IntArray(2 * size)
colorIfLocked = IntArray(2 * size)
colorIfUnlocked = IntArray(2 * size)
}
operator fun set(index: Int, value: Int) {
var i = size + index
if (value >= 2) {
colorIfUnlocked[i] = value
colorIfLocked[i] = 0
lock[i] = 0
} else {
colorIfUnlocked[i] = 0
colorIfLocked[i] = 0
if (value == 0) lock[i] = 1 else lock[i] = -1
}
while (i > 1) {
i /= 2
val colorIfLockedLeft = colorIfLocked[2 * i]
val colorIfUnlockedLeft = colorIfUnlocked[2 * i]
val lockLeft = lock[2 * i]
val colorIfLockedRight = colorIfLocked[2 * i + 1]
val colorIfUnlockedRight = colorIfUnlocked[2 * i + 1]
val lockRight = lock[2 * i + 1]
lock[i] = if (lockRight != 0) lockRight else if (lockLeft != 0) lockLeft else 0
run { // locked
var c = colorIfLockedLeft
val l = if (lockLeft == 0) 1 else lockLeft
if (l == -1 && colorIfUnlockedRight != 0) c = colorIfUnlockedRight
if (l == 1 && colorIfLockedRight != 0) c = colorIfLockedRight
colorIfLocked[i] = c
}
run { // unlocked
var c = colorIfUnlockedLeft
val l = if (lockLeft == 0) -1 else lockLeft
if (l == -1 && colorIfUnlockedRight != 0) c = colorIfUnlockedRight
if (l == 1 && colorIfLockedRight != 0) c = colorIfLockedRight
colorIfUnlocked[i] = c
}
}
}
fun answer(): Int {
if (colorIfUnlocked[1] == 0) return 6
return colorIfUnlocked[1]
}
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2021/qual/AdKt.class",
"javap": "Compiled from \"ad.kt\"\npublic final class codeforces.vk2021.qual.AdKt {\n public static final void main();\n Code:\n 0: ldc #8 // String lock, unlock, red, orange, yel... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2021/qual/e3_slow.kt | package codeforces.vk2021.qual
import kotlin.math.log2
import kotlin.math.roundToInt
private fun permutation(comparisons: List<Boolean>, n: Int): Pair<Int, List<Int>> {
var pos = 0
fun permutation(m: Int): List<Int> {
if (m <= 1) return List(m) { 0 }
val left = m / 2
val right = m - left
val permutationLeft = permutation(left)
val permutationRight = permutation(right)
val leftNumbers = mutableListOf<Int>()
val rightNumbers = mutableListOf<Int>()
for (i in 0 until m) {
val half = if (leftNumbers.size < left && rightNumbers.size < right) {
if (comparisons.getOrElse(pos++) { false }) rightNumbers else leftNumbers
} else if (leftNumbers.size < left) leftNumbers else rightNumbers
half.add(i)
}
return permutationLeft.map { leftNumbers[it] } + permutationRight.map { rightNumbers[it] }
}
val permutation = permutation(n)
return pos - comparisons.size to permutation
}
private fun solve(comparisons: List<Boolean>): List<Int> {
if (comparisons.size < 1000) {
for (n in 1..comparisons.size + 2) {
val (error, permutation) = permutation(comparisons, n)
if (error == 0) return permutation
}
error("")
}
var low = comparisons.size / (log2(comparisons.size.toDouble()).roundToInt() + 1)
var high = (low + 8) * 3
val tried = BooleanArray(high)
while (low + 1 < high) {
val n = (low + high) / 2
val (error, permutation) = permutation(comparisons, n)
if (error == 0) return permutation
tried[n] = true
if (error < 0) low = n else high = n
}
error("")
}
fun main() {
val comparisons = readLn().map { it == '1' }
val permutation = solve(comparisons)
println(permutation.size)
println(permutation.joinToString(" ") { (it + 1).toString() })
}
private fun readLn() = readLine()!!
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2021/qual/E3_slowKt.class",
"javap": "Compiled from \"e3_slow.kt\"\npublic final class codeforces.vk2021.qual.E3_slowKt {\n private static final kotlin.Pair<java.lang.Integer, java.util.List<java.lang.Integer>> permutation(java.util.List<... |
mikhail-dvorkin__competitions__3095312/codeforces/vk2021/round1/d.kt | package codeforces.vk2021.round1
import kotlin.random.Random
import kotlin.system.exitProcess
private fun solveSmart(a: List<Int>): List<Int> {
val used = BooleanArray(a.size)
val ans = IntArray(a.size) { -1 }
for (i in a.indices) {
if (a[i] == i) continue
if (used[a[i]]) continue
used[a[i]] = true
ans[i] = a[i]
}
val unused = used.indices.filter { !used[it] }.toMutableList()
val weakIndices = ans.indices.filter { ans[it] == -1 }
for (i in weakIndices) {
ans[i] = unused.last()
unused.removeAt(unused.lastIndex)
}
for (i in weakIndices) {
if (ans[i] == i) {
val j = if (weakIndices.size > 1) {
weakIndices.first { it != i }
} else {
val jj = ans.indices.firstOrNull { it != i && ans[it] == a[i] }
jj ?: ans.indices.first { it != i && ans[it] != i }
}
val t = ans[i]; ans[i] = ans[j]; ans[j] = t
break
}
}
return ans.toList()
}
private fun solve() {
readLn()
val a = readInts().map { it - 1 }
val ans = solveSmart(a)
println(a.indices.count { a[it] == ans[it] })
println(ans.map { it + 1 }.joinToString(" "))
}
fun main() {
// stress()
repeat(readInt()) { solve() }
}
private fun solveDumb(a: List<Int>): List<Int> {
var bestCommon = -1
var best: List<Int>? = null
fun search(prefix: List<Int>) {
if (prefix.size == a.size) {
val common = a.indices.count { a[it] == prefix[it] }
if (common > bestCommon) {
bestCommon = common
best = prefix
}
return
}
for (i in a.indices - prefix - listOf(prefix.size)) {
search(prefix + i)
}
}
search(listOf())
return best!!
}
@Suppress("unused")
private fun stress() {
val r = Random(566)
while (true) {
val n = 2 + r.nextInt(5)
val a = List(n) { r.nextInt(n) }
val smart = solveSmart(a)
val dumb = solveDumb(a)
println(a)
println(smart)
println(dumb)
fun quality(b: List<Int>): Int {
return b.indices.count { b[it] == a[it] }
}
if (quality(smart) != quality(dumb)) {
exitProcess(0)
}
}
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/codeforces/vk2021/round1/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class codeforces.vk2021.round1.DKt {\n private static final java.util.List<java.lang.Integer> solveSmart(java.util.List<java.lang.Integer>);\n Code:\n 0: aloa... |
mikhail-dvorkin__competitions__3095312/marathons/icpcchallenge/y2020_huaweiGraphMining/a.kt | package marathons.icpcchallenge.y2020_huaweiGraphMining
import java.io.BufferedReader
import java.io.FileReader
import java.io.PrintWriter
import java.util.*
import kotlin.math.pow
import kotlin.random.asJavaRandom
fun solve(fileName: String, nei: List<IntArray>) {
val outputFile = "$fileName.out"
val auxFile = "$fileName.aux"
val n = nei.size
val edges = nei.sumOf { it.size } / 2
val r = kotlin.random.Random(566)
println("$fileName $n ${2.0 * edges / n}")
fun eval(color: IntArray): Double {
val map = mutableMapOf<Int, Int>()
for (c in color) if (c !in map) map[c] = map.size
val parts = map.size
val eIn = IntArray(parts)
val eOut = IntArray(parts)
val size = IntArray(parts)
val sumDeg = IntArray(parts)
for (u in nei.indices) {
val cu = map[color[u]]!!
size[cu]++
sumDeg[cu] += nei[u].size
for (v in nei[u]) {
if (map[color[v]] == cu) eIn[cu]++ else eOut[cu]++
}
}
val modularity = eIn.indices.sumOf { eIn[it] * 0.5 / edges - (sumDeg[it] * 0.5 / edges).pow(2) }
val regularization = 0.5 * (eIn.indices.sumOf { if (size[it] == 1) 1.0 else eIn[it].toDouble() / (size[it] * (size[it] - 1)) } / parts - parts.toDouble() / n)
// println("$modularity $regularization $res")
return (1 + modularity + regularization) * 1e5
}
fun randomCenters(parts: Int) = nei.indices.shuffled(r).take(parts).toIntArray()
fun byCenters(centers: IntArray): IntArray {
val inf = n + 1
val queue = IntArray(n)
val dist = IntArray(n) { inf }
val which = IntArray(n) { inf }
// val size = IntArray(n) { 0 }
var low = 0; var high = 0
for (c in centers) {
dist[c] = 0
which[c] = c
// size[c] = 1
queue[high++] = c
}
while (low < high) {
val u = queue[low++]
for (v in nei[u]) {
if (dist[v] < inf) continue
dist[v] = dist[u] + 1
which[v] = which[u]
// size[which[v]]++
queue[high++] = v
}
}
return which
}
@Suppress("unused")
fun bestParts(): Int {
return (10000..60000 step 1000).maxByOrNull { parts ->
val q = List(8) { eval(byCenters(randomCenters(parts))) }.maxOrNull()!!
println("$parts $q")
q
}!!
}
val bestParts = mapOf("a1" to 21000, "a2" to 29000, "a3" to 29000)
val parts = bestParts[fileName] ?: error("")
// val centers = randomCenters(parts)
val centers = BufferedReader(FileReader(auxFile)).readLine().split(" ").map { it.toInt() }.toIntArray()
var answer = byCenters(centers)
var best = eval(answer)
fun improve1() {
val index = r.nextInt(centers.size)
val oldValue = centers[index]
val centersSet = centers.toMutableSet()
centersSet.remove(oldValue)
while (true) {
centers[index] = r.nextInt(n)
if (centers[index] in centersSet) continue
centersSet.add(centers[index])
break
}
val new = byCenters(centers)
val score = eval(new)
print("$best -> $score")
if (score > best) {
best = score
answer = new
print(" YES")
} else {
centersSet.remove(centers[index])
centers[index] = oldValue
centersSet.add(oldValue)
}
println()
}
fun improve2() {
val old = centers.clone()
val level = 256
for (i in centers.indices) {
if (r.nextInt(level) == 0) centers[i] = -1
}
val set = centers.toMutableSet()
for (i in centers.indices) {
if (centers[i] != -1) continue
while (true) {
centers[i] = r.nextInt(n)
if (centers[i] in set) continue
set.add(centers[i])
break
}
}
val new = byCenters(centers)
val score = eval(new)
print("$best -> $score")
if (score > best) {
best = score
answer = new
print(" YES")
} else {
for (i in centers.indices) centers[i] = old[i]
}
print(" $level")
println()
}
class Centers(val a: IntArray) {
private val energy: Double = eval(byCenters(a))
fun energy(): Double = energy
fun randomInstance(random: Random): Centers {
val list = ArrayList<Int>()
for (i in 0 until n) {
list.add(i)
}
list.shuffle(random)
for (i in 0 until parts) {
a[i] = list[i]
}
return Centers(a)
}
fun vary(): Centers {
val new: IntArray = a.clone()
val level = 256
for (i in new.indices) {
if (r.nextInt(level) == 0) new[i] = -1
}
val set = new.toMutableSet()
for (i in new.indices) {
if (new[i] != -1) continue
while (true) {
new[i] = r.nextInt(n)
if (new[i] in set) continue
set.add(new[i])
break
}
}
return Centers(new)
}
}
class Settings constructor(var globalIterations: Int = 1024, var iterations: Int = 8192, var probStartWithPrevious: Double = 1 - 1.0 / 16, var recessionLimit: Int = Int.MAX_VALUE, var desiredEnergy: Double = -Double.MAX_VALUE, var temp0: Double = 1.0)
repeat(10) {
improve1()
improve2()
}
fun simulatedAnnealing(item: Centers, settings: Settings, r1: Random): Centers? {
var item = item
var energy = item!!.energy()
var answerEnergy = Double.MAX_VALUE
var answer: Centers? = null
for (glob in 0 until settings.globalIterations) {
if (glob > 0 && r1.nextDouble() >= settings.probStartWithPrevious) {
item = item!!.randomInstance(r1)
energy = item.energy()
}
var end = settings.iterations
var iter = 1
var recession = 0
while (true) {
if (energy < answerEnergy) {
answerEnergy = energy
answer = item
println(answerEnergy)
if (answerEnergy <= settings.desiredEnergy) {
return answer
}
end = Math.max(end, iter + settings.iterations)
}
if (iter > end) {
break
}
var nextEnergy: Double
var next: Centers? = null
next = item!!.vary()!!
nextEnergy = next.energy()
val dEnergy = nextEnergy - energy
var accept: Boolean
if (dEnergy < 0) {
accept = true
recession = 0
} else {
recession++
if (recession == settings.recessionLimit) {
break
}
val barrier = Math.exp(-1.0 * dEnergy * iter / settings.temp0)
accept = r1.nextDouble() < barrier
}
if (accept) {
assert(next != null)
item = next!!
energy = nextEnergy
} else {
}
iter++
}
}
return answer
}
val settings = Settings()
val item = Centers(centers)
val q: Centers = simulatedAnnealing(item, settings, r.asJavaRandom()) as Centers
for (i in centers.indices) centers[i] = q.a[i]
val output = PrintWriter(outputFile)
val aux = PrintWriter(auxFile)
answer.indices.groupBy { answer[it] }.values.sortedBy { it.size }.forEach { output.println(it.joinToString(" ")) }
aux.println(centers.joinToString(" "))
output.close()
aux.close()
}
fun main() {
for (test in 1..3) {
val fileName = "a$test"
val input = BufferedReader(FileReader("${fileName}.in"))
val edges = generateSequence { input.readLine()?.split(" ")?.map { it.toInt() } }.toList()
val n = edges.flatten().maxOrNull()!! + 1
val nei = List(n) { mutableListOf<Int>() }
for ((u, v) in edges) { nei[u].add(v); nei[v].add(u) }
solve(fileName, nei.map { it.toIntArray() })
}
}
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/marathons/icpcchallenge/y2020_huaweiGraphMining/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class marathons.icpcchallenge.y2020_huaweiGraphMining.AKt {\n public static final void solve(java.lang.String, java.util.List<int[]>);\n Code... |
mikhail-dvorkin__competitions__3095312/marathons/icpcchallenge/y2020_huaweiGraphMining/practice/b.kt | package marathons.icpcchallenge.y2020_huaweiGraphMining.practice
import java.io.*
import kotlin.random.Random
private fun solve(edges: List<List<Int>>): BooleanArray {
val n = edges.flatten().maxOrNull()!! + 1
val nei = List(n) { mutableListOf<Int>() }
for ((u, v) in edges) { nei[u].add(v); nei[v].add(u) }
val r = Random(566)
@Suppress("unused")
fun greedy() {
val set = BooleanArray(n)
val add = IntArray(n) { r.nextInt(n) }
for (u in nei.indices.sortedBy { nei[it].size * n + add[it] }) {
set[u] = nei[u].none { set[it] }
}
}
val status = IntArray(n) { 2 }
val s = 64
val deg = IntArray(n) { nei[it].size * s + r.nextInt(s) }
val byDeg = List(deg.maxOrNull()!! + 1) { mutableSetOf<Int>() }
for (u in nei.indices) byDeg[deg[u]].add(u)
while (true) {
val u = byDeg.firstOrNull { it.isNotEmpty() }?.first() ?: break
byDeg[deg[u]].remove(u)
status[u] = 1
for (v in nei[u]) {
if (status[v] < 2) continue
status[v] = 0
byDeg[deg[v]].remove(v)
for (w in nei[v]) {
if (status[w] < 2) continue
byDeg[deg[w]].remove(w)
deg[w] -= s
byDeg[deg[w]].add(w)
}
}
}
return BooleanArray(n) { status[it] == 1 }
}
fun main() {
for (test in 1..4) {
val filename = "b$test"
val input = BufferedReader(FileReader("$filename.in"))
val output = PrintWriter("$filename.out")
fun readLn() = input.readLine()
fun readStrings() = readLn().split(" ")
fun readInts() = readStrings().map { it.toInt() }
val (_, m) = readInts()
val edges = List(m) { readInts().map { it - 1 } }
val ans = solve(edges).map { if (it) 1 else 0 }
output.println(ans.sum())
output.println(ans.joinToString(" "))
output.close()
}
}
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/marathons/icpcchallenge/y2020_huaweiGraphMining/practice/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class marathons.icpcchallenge.y2020_huaweiGraphMining.practice.BKt {\n private static final boolean[] solve(java.util.List<? extends ja... |
mikhail-dvorkin__competitions__3095312/marathons/atcoder/ahc21_toyota2023_pyramidSorting/pyramidSorting.kt | package marathons.atcoder.ahc21_toyota2023_pyramidSorting
import kotlin.random.Random
private fun solve(f: List<IntArray>) {
val answers = mutableListOf<List<String>>()
for (mode in 0 until 5 + 12) {
answers.add(solveGreedy(f.map { it.clone() }, mode))
}
val ans = answers.minBy { it.size }
println("" + ans.size + "\n" + ans.joinToString("\n"))
System.err.println(answers.map { it.size })
}
private fun solveGreedy(f: List<IntArray>, mode: Int): List<String> {
val n = f.size
val ans = mutableListOf<String>()
fun makeMove(y: Int, x: Int, d: Int) {
val yy = y + DY[d]; val xx = x + DX[d]
ans.add("$y $x $yy $xx")
val t = f[y][x]; f[y][x] = f[yy][xx]; f[yy][xx] = t
}
val penaltyLarge = when (mode % 4) {
0 -> 10
1 -> 100
2 -> 10_000
else -> 0
}
val penaltyRandom = when (mode / 4 % 3) {
0 -> 50
1 -> 500
else -> 0
}
val random = Random(mode)
val dp = List(n) { IntArray(it + 1) }
val dpHow = List(n) { IntArray(it + 1) }
while (true) {
var maxScore = Int.MIN_VALUE
var bestMove: Triple<Int, Int, Int>? = null
for (y in 0 until n) for (x in 0..y) for (d in 1..2) {
val yy = y + DY[d]; val xx = x + DX[d]
if (yy < 0 || yy >= n || xx < 0 || xx > yy) continue
val v = f[y][x]
val vv = f[yy][xx]
val diff = v - vv
if (diff < 0) continue
val score = when (mode) {
0 -> diff
1 -> v
2 -> vv
3 -> -v
else -> -vv
} * 1000 + diff
if (score > maxScore) {
maxScore = score
bestMove = Triple(y, x, d)
}
}
if (maxScore == Int.MIN_VALUE) break
val (yBest, xBest, dBest) = bestMove!!
if (mode < 5) {
makeMove(yBest, xBest, dBest)
continue
}
val y0 = yBest + DY[dBest]
val x0 = xBest + DX[dBest]
dp[y0].fill(-1)
dp[y0][x0] = 0
for (y in y0 - 1 downTo 0) {
var x1 = -1
for (x in 0..y) {
dp[y][x] = -1
if (f[y][x] < f[y0][x0]) continue
var scoreHere = f[y][x]
if (penaltyLarge > 0) {
for (d in 0..5) {
val yy = y + DY[d]; val xx = x + DX[d]
if (yy < 0 || yy >= n || xx < 0 || xx > yy) continue
if (f[yy][xx] < f[y][x]) scoreHere += penaltyLarge
}
}
if (penaltyRandom > 0) {
scoreHere += random.nextInt(penaltyRandom)
}
for (d in 1..2) {
val yy = y + DY[d]; val xx = x + DX[d]
if (dp[yy][xx] == -1) continue
val new = dp[yy][xx] + scoreHere
if (new > dp[y][x]) {
dp[y][x] = new
dpHow[y][x] = d
}
}
if (dp[y][x] == -1) continue
var found = true
for (d in 4..5) {
val yy = y + DY[d]; val xx = x + DX[d]
if (yy >= 0 && xx in 0..yy && f[yy][xx] > f[y0][x0]) found = false
}
if (found) {
if (x1 == -1 || dp[y][x] > dp[y][x1]) x1 = x
}
}
if (x1 != -1) {
fun moveTo(yDest: Int, xDest: Int) {
if (yDest == y0) return
val d = dpHow[yDest][xDest]
moveTo(yDest + DY[d], xDest + DX[d])
makeMove(yDest, xDest, d)
}
moveTo(y, x1)
break
}
}
}
return ans
}
private val DY = intArrayOf(0, 1, 1, 0, -1, -1)
private val DX = intArrayOf(1, 0, 1, -1, 0, -1)
private fun solve(n: Int = 30) = solve(List(n) { readInts().toIntArray() })
fun main() = solve()
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/marathons/atcoder/ahc21_toyota2023_pyramidSorting/PyramidSortingKt.class",
"javap": "Compiled from \"pyramidSorting.kt\"\npublic final class marathons.atcoder.ahc21_toyota2023_pyramidSorting.PyramidSortingKt {\n private static final int[] DY;\n\n pri... |
mikhail-dvorkin__competitions__3095312/marathons/atcoder/ahc3_shortestPathQueries/shortestPathQueries.kt | package marathons.atcoder.ahc3_shortestPathQueries
import kotlin.random.Random
private fun solve(queries: Int = 1000, size: Int = 30, averageEdge: Int = 5000) {
val noiseLevel = 0.2
val random = Random(566)
fun vertexId(y: Int, x: Int) = y * size + x
data class Edge(val from: Int, val to: Int, val label: Char, val id: Int)
val vertices = size * size
val nei = List(vertices) { mutableListOf<Edge>() }
var edges = 0
for (y in 0 until size) for (x in 0 until size) {
val id = vertexId(y, x)
for (d in 0..1) {
val (yy, xx) = y + DY[d] to x + DX[d]
if (yy >= size || xx >= size) continue
val id2 = vertexId(yy, xx)
nei[id].add(Edge(id, id2, DIR[d], edges))
nei[id2].add(Edge(id2, id, DIR[d xor 2], edges))
edges++
}
}
val noise = DoubleArray(edges)
val edgeSum = DoubleArray(edges) { 1.0 }
val edgeNum = IntArray(edges) { 1 }
val mark = BooleanArray(vertices)
val dist = DoubleArray(vertices)
val how = Array<Edge?>(vertices) { null }
val inf = 1e20
fun edgeLength(id: Int): Double {
return edgeSum[id] / edgeNum[id] + noise[id]
}
fun shortestPath(from: Int, to: Int): List<Edge> {
mark.fill(false)
dist.fill(inf)
dist[from] = 0.0
val queue = sortedMapOf(0.0 to from)
while (true) {
val vDist = queue.firstKey()!!
val v = queue.remove(vDist)!!
if (v == to) break
mark[v] = true
for (e in nei[v]) {
val u = e.to
val newDist = vDist + edgeLength(e.id)
if (newDist < dist[u]) {
queue.remove(dist[u])
queue[newDist] = u
dist[u] = newDist
how[u] = e
}
}
}
val path = mutableListOf<Edge>()
var v = to
while (v != from) {
path.add(how[v]!!)
v = how[v]!!.from
}
return path.reversed()
}
repeat(queries) {
val (yFrom, xFrom, yTo, xTo) = readInts()
val (from, to) = vertexId(yFrom, xFrom) to vertexId(yTo, xTo)
for (i in noise.indices) noise[i] = random.nextDouble() * noiseLevel
val path = shortestPath(from, to)
println(path.joinToString("") { "" + it.label })
val pathLength = readInt().toDouble() / averageEdge / path.size
for (e in path) {
edgeNum[e.id]++
edgeSum[e.id] += pathLength
}
}
}
fun main() = solve()
val DX = intArrayOf(1, 0, -1, 0)
val DY = intArrayOf(0, 1, 0, -1)
const val DIR = "RDLU"
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/marathons/atcoder/ahc3_shortestPathQueries/ShortestPathQueriesKt$solve$Edge.class",
"javap": "Compiled from \"shortestPathQueries.kt\"\npublic final class marathons.atcoder.ahc3_shortestPathQueries.ShortestPathQueriesKt$solve$Edge {\n private final in... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/round3/c_small.kt | package gcj.y2022.round3
private fun solve(letters: String = "ACDEHIJKMORST"): String {
val n = readInt()
val exits = List(2) { readInts().map { it - 1 } }
val dist1 = List(n) { v -> listOf(exits[0][v], exits[1][v]) }
val dist2 = List(n) { v -> val d1 = dist1[v]; dist1[d1[0]] + dist1[d1[1]] }
val dist12 = List(n) { v -> dist1[v] + dist2[v] }
for (i in 0 until n) {
if (i in dist2[i]) return "IMPOSSIBLE"
}
val ans = IntArray(n) { -1 }
val forbid = List(n) { mutableSetOf<Int>() }
for (i in 0 until n) {
val fi = forbid[i]
for (j in dist12[i]) fi.add(ans[j])
ans[i] = letters.indices.first { it !in fi }
for (j in dist12[i]) forbid[j].add(ans[i])
}
return ans.map { letters[it] }.joinToString("")
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/round3/C_smallKt.class",
"javap": "Compiled from \"c_small.kt\"\npublic final class gcj.y2022.round3.C_smallKt {\n private static final java.lang.String solve(java.lang.String);\n Code:\n 0: invokestatic #10 // Meth... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/round3/b_small.kt | package gcj.y2022.round3
private fun solve(): Long {
val (n, colors) = readInts()
val constraints = List(colors) { readInts() }
val hats = readInts().map { it - 1 }
val byColor = List(colors) { mutableListOf<Int>() }
val indexInColor = IntArray(colors)
for (i in hats.indices) {
byColor[hats[i]].add(i)
}
val x = IntArray(colors)
val y = IntArray(colors)
val z = IntArray(colors)
fun fillXYZ(c: Int, start: Int) {
val (lowIn, highIn) = constraints[c]
val ofC = byColor[c]
if (ofC.size == 0) {
x[c] = 2 * n; y[c] = -1; z[c] = -1
return
}
val low = maxOf(lowIn, 1)
val high = minOf(highIn, ofC.size)
if (start > 0) indexInColor[c]++
val index = indexInColor[c]
fun get(i: Int) = if (i < ofC.size) ofC[i] else (ofC[i - ofC.size] + n)
x[c] = get(index) + 1
if (ofC.size < low) {
y[c] = -1; z[c] = -1
} else {
y[c] = get(index + low - 1) + 1
z[c] = if (high >= ofC.size) 2 * n else get(index + high) + 1
}
}
val good = IntArray(2 * n)
fun add(from: Int, to: Int, value: Int) {
if (from >= to) return
for (k in from until to) good[k] += value
}
fun count(start: Int): Int {
var perfects = 0
for (k in 2 until n) if (good[start + k] == colors) perfects++
return perfects
}
for (c in constraints.indices) {
fillXYZ(c, 0)
add(0, x[c], 1)
add(y[c], z[c], 1)
}
var ans = count(0).toLong()
for (i in 0..n - 2) {
val c = hats[i]
add(0, x[c], -1)
add(y[c], z[c], -1)
fillXYZ(c, i + 1)
add(0, x[c], 1)
add(y[c], z[c], 1)
ans += count(i + 1)
}
return ans
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/round3/B_smallKt.class",
"javap": "Compiled from \"b_small.kt\"\npublic final class gcj.y2022.round3.B_smallKt {\n private static final long solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/Lis... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/round2/a.kt | package gcj.y2022.round2
private fun solve(): String {
val (n, k) = readInts()
var x = 1
var w = n - 1
val ans = mutableListOf<String>()
var toCut = n * n - 1 - k
var where = 1
while (w > 0) {
val y = x + 4 * w
repeat(4) { i ->
val from = x + i * w + 1
val to = y + i * (w - 2)
val cut = to - from - 1
if (cut in 1..toCut && from >= where) {
ans.add("$from $to")
toCut -= cut
where = to
}
}
w -= 2
x = y
}
if (toCut != 0) return "IMPOSSIBLE"
return "" + ans.size + "\n" + ans.joinToString("\n")
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/round2/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class gcj.y2022.round2.AKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/round2/c_small.kt | package gcj.y2022.round2
private fun solve(): String {
val n = readInt()
val kids = List(n) { readInts() }
val sweets = List(n + 1) { readInts() }
fun sqr(x: Int) = x.toLong() * x
fun dist(i: Int, j: Int) = sqr(kids[i][0] - sweets[j][0]) + sqr(kids[i][1] - sweets[j][1])
val dist = List(n) { i -> LongArray(n + 1) { j -> dist(i, j) } }
val can = BooleanArray(1 shl (2 * n + 1))
val howMask = IntArray(1 shl (2 * n + 1))
val howI = IntArray(1 shl (2 * n + 1))
val howJ = IntArray(1 shl (2 * n + 1))
val maskInit = 1 shl n
can[maskInit] = true
val maxMaskKids = maskInit - 1
for (mask in can.indices) {
val maskKids = mask and maxMaskKids
val maskSweets = mask and maxMaskKids.inv()
val m = maskKids.countOneBits()
if (maskSweets.countOneBits() != m + 1 || m == 0) continue
for (i in 0 until n) {
if (!mask.hasBit(i)) continue
var minDist = Long.MAX_VALUE
for (j in 0..n) {
if (!mask.hasBit(n + j)) continue
minDist = minOf(minDist, dist[i][j])
}
for (j in 0..n) {
if (j == 0 || !mask.hasBit(n + j) || dist[i][j] != minDist) continue
val newMask = mask xor (1 shl i) xor (1 shl (n + j))
if (can[newMask]) {
can[mask] = true
howMask[mask] = newMask
howI[mask] = i
howJ[mask] = j
}
}
}
}
var mask = can.lastIndex
if (!can[mask]) return "IMPOSSIBLE"
val ans = mutableListOf<String>()
while (mask != maskInit) {
ans.add("${howI[mask] + 1} ${howJ[mask] + 1}")
mask = howMask[mask]
}
return "POSSIBLE\n" + ans.joinToString("\n")
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
private fun Int.bit(index: Int) = shr(index) and 1
private fun Int.hasBit(index: Int) = bit(index) != 0
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/round2/C_smallKt.class",
"javap": "Compiled from \"c_small.kt\"\npublic final class gcj.y2022.round2.C_smallKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #10 // Method readInt:()I\n... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/round2/b_wip.kt | package gcj.y2022.round2
import kotlin.math.floor
import kotlin.math.round
import kotlin.math.sqrt
private fun rFloor(x: Int, y: Int) = floor(sqrt(1.0 * x * x + 1.0 * y * y)).toInt()
private fun y(x: Int, r: Int): Int {
return round(sqrt(1.0 * r * r - 1.0 * x * x)).toInt()
}
private fun skips(rFloor: Int, x: Int, y: Int): Boolean {
val y1 = y(x, rFloor)
val y2 = y(x, rFloor + 1)
return (y1 < y) and (y < y2)
}
private fun research2(m: Int): Int {
/*
val a = List(m + 2) { BooleanArray(m + 2) }
val b = List(m + 2) { BooleanArray(m + 2) }
for (r in 0..m) {
for (x in 0..r) {
val y = round(sqrt(1.0 * r * r - 1.0 * x * x)).toInt()
b[x][y] = true
b[y][x] = true
}
}
// println(m)
// var res = 0
for (x in 0..m + 1) for (y in 0..m + 1) {
if (y == 0) println(x)
a[x][y] = round(sqrt(1.0 * x * x + 1.0 * y * y)) <= m
if (a[x][y] != b[x][y]) {
// println("$x $y ${a[x][y]} ${b[x][y]}")
require(a[x][y])
// res += 1
}
}
*/
val holes = IntArray(m + 1)
for (y in 0..m) {
if (y % 1000 == 0) System.err.println(y)
for (x in 0..m) {
val rFloor = rFloor(x, y)
if (rFloor > m) break
val skips = skips(rFloor, x, y) and skips(rFloor, y, x)
if (skips) {
val rFull = round(sqrt(1.0 * x * x + 1.0 * y * y)).toInt()
if (rFull > m) continue
holes[rFull]++
println("$x $y")
// if (b[x][y] || !a[x][y]) {
// println("$x $y ${a[x][y]} ${b[x][y]}")
// }
}
}
}
println(holes.contentToString())
// var s = 0
// for (x in holes) {
// s += x
// println(s)
// }
return 0
}
private fun solve(): Long {
return 777L
// return research(readInt()) * 4L
}
fun main() {
// for (r in 1..100) {
// val v = research(r)
// println("$r $v")
// println(research(r) - research(r-1))
// }
// System.setIn(java.io.File("input.txt").inputStream())
// System.setOut(java.io.PrintStream("output.txt"))
research2(500)
// repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/round2/B_wipKt.class",
"javap": "Compiled from \"b_wip.kt\"\npublic final class gcj.y2022.round2.B_wipKt {\n private static final int rFloor(int, int);\n Code:\n 0: dconst_1\n 1: iload_0\n 2: i2d\n 3: dmul\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/round2/b_small.kt | package gcj.y2022.round2
import kotlin.math.round
import kotlin.math.sqrt
private fun dumb(m: Int): Int {
val a = List(m + 2) { BooleanArray(m + 2) }
val b = List(m + 2) { BooleanArray(m + 2) }
for (r in 0..m) {
for (x in 0..r) {
val y = round(sqrt(1.0 * r * r - x * x)).toInt()
b[x][y] = true
b[y][x] = true
}
}
var res = 0
for (x in 0..m + 1) for (y in 0..m + 1) {
a[x][y] = round(sqrt(1.0 * x * x + y * y)) <= m
if (a[x][y] != b[x][y]) {
require(a[x][y])
res += 1
}
}
return res
}
private fun solve() = dumb(readInt()) * 4L
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/round2/B_smallKt.class",
"javap": "Compiled from \"b_small.kt\"\npublic final class gcj.y2022.round2.B_smallKt {\n private static final int dumb(int);\n Code:\n 0: iload_0\n 1: iconst_2\n 2: iadd\n 3: istore_2\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/kickstart_c/c.kt | package gcj.y2022.kickstart_c
private fun solve(): String {
val (n, len) = readInts()
val ants = List(n) { readInts() }
val falls = ants.map { ant ->
(if (ant[1] == 0) ant[0] else len - ant[0]) to ant[1]
}.sortedBy { it.first }
val order = ants.withIndex().sortedBy { it.value[0] }.map { it.index }
var low = 0
var high = n
val timeOfFall = IntArray(n)
for (fall in falls) {
if (fall.second == 0) {
timeOfFall[order[low]] = fall.first
low++
} else {
high--
timeOfFall[order[high]] = fall.first
}
}
return timeOfFall.indices.sortedBy { timeOfFall[it] }.map { it + 1 }.joinToString(" ")
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/kickstart_c/CKt$solve$$inlined$sortedBy$2.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class gcj.y2022.kickstart_c.CKt$solve$$inlined$sortedBy$2<T> implements java.util.Comparator {\n public gcj.y2022.kickstart_c.CKt$solv... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/kickstart_c/d.kt | package gcj.y2022.kickstart_c
const val M = 1000000007
private fun solve(): Int {
val n = readInt()
val s = readLn()
val a = List(n + 1) { List(n + 1) { IntArray(n + 1) } }
for (i in n downTo 0) for (j in i..n) for (k in 0..j - i) {
if (k == 0) {
a[i][j][k] = 1
continue
}
if (k == 1) {
a[i][j][k] = j - i
continue
}
a[i][j][k] = (a[i][j - 1][k].toModular() + a[i + 1][j][k].toModular() - a[i + 1][j - 1][k].toModular()).x
if (s[i] == s[j - 1]) {
a[i][j][k] = (a[i][j][k].toModular() + a[i + 1][j - 1][k - 2].toModular()).x
}
}
val cnk = List(n + 1) { IntArray(n + 1) }
for (i in cnk.indices) {
cnk[i][0] = 1
cnk[i][i] = 1
for (j in 1 until i) cnk[i][j] = (cnk[i - 1][j - 1].toModular() + cnk[i - 1][j].toModular()).x
}
var ans = 0.toModular()
for (i in 0 until n) {
ans += a[0][n][i].toModular().div(cnk[n][i].toModular())
}
return ans.x
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun Int.toModular() = Modular(this)//toDouble()
private class Modular {
val x: Int
@Suppress("ConvertSecondaryConstructorToPrimary")
constructor(value: Int) { x = (value % M).let { if (it < 0) it + M else it } }
operator fun plus(that: Modular) = Modular((x + that.x) % M)
operator fun minus(that: Modular) = Modular((x + M - that.x) % M)
operator fun times(that: Modular) = (x.toLong() * that.x % M).toInt().toModular()
private fun modInverse() = Modular(x.toBigInteger().modInverse(M.toBigInteger()).toInt())
operator fun div(that: Modular) = times(that.modInverse())
override fun toString() = x.toString()
}
private operator fun Int.plus(that: Modular) = Modular(this) + that
private operator fun Int.minus(that: Modular) = Modular(this) - that
private operator fun Int.times(that: Modular) = Modular(this) * that
private operator fun Int.div(that: Modular) = Modular(this) / that
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/kickstart_c/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class gcj.y2022.kickstart_c.DKt {\n public static final int M;\n\n private static final int solve();\n Code:\n 0: invokestatic #9 // Method re... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/round1b/c_easy.kt | package gcj.y2022.round1b
private fun solve(m: Int = 8) {
fun ask(asked: Int): Int {
println(asked.toString(2).padStart(m, '0'))
return readInt()
}
val masks = 1 shl m
fun rotate(mask: Int, shift: Int): Int {
return (((mask shl m) or mask) shr shift) and (masks - 1)
}
val initOnes = ask(0)
var ones = initOnes
if (ones == 0) return; if (ones == m) { ask(masks - 1); return }
val possible = BooleanArray(masks) { mask ->
mask.countOneBits() == initOnes
}
val memo = mutableMapOf<Int, List<Int>>()
while (true) {
val possibleBefore = possible.count { it }
var bestWorstGroup = masks + 1
var bestTries: List<Int>? = null
val id = possible.contentHashCode()
if (id !in memo) {
for (tried in 0 until masks / 2) /*for (tried2 in possible.indices)*/ {
val receivable = mutableSetOf<Int>()
for (secret in possible.indices) {
if (!possible[secret]) continue
for (shift in 0 until m) for (shift2 in 0 until m) {
receivable.add(secret xor rotate(tried, shift) /*xor rotate(tried2, shift2)*/)
}
}
val worstGroup = receivable.groupBy { it.countOneBits() }.maxOf { it.value.size }
if (worstGroup < bestWorstGroup) {
bestWorstGroup = worstGroup
bestTries = listOf(tried/*, tried2*/)
}
}
memo[id] = bestTries!!
}
bestTries = memo[id]!!
if (ones % 2 == 0) bestTries = listOf(1)
if (possibleBefore == m) {
bestTries = listOf(1)
}
for (tried in bestTries) {
val coincidence = ask(tried)
ones = coincidence
if (ones == 0) return; if (ones == m) { ask(masks - 1); return }
val receivable = mutableSetOf<Int>()
for (secret in possible.indices) {
if (!possible[secret]) continue
for (shift in 0 until m) {
val new = secret xor rotate(tried, shift)
if (new.countOneBits() == coincidence) receivable.add(new)
}
}
for (mask in possible.indices) {
possible[mask] = mask in receivable
}
}
}
}
fun main() {
repeat(readInt()) { solve() }
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/round1b/C_easyKt.class",
"javap": "Compiled from \"c_easy.kt\"\npublic final class gcj.y2022.round1b.C_easyKt {\n private static final void solve(int);\n Code:\n 0: iconst_1\n 1: iload_0\n 2: ishl\n 3: istore_1\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2022/round1b/b.kt | package gcj.y2022.round1b
import kotlin.math.abs
private fun solve(): Long {
val (n, _) = readInts()
val lists = List(n) { readInts() }
var pLow = 0
var pHigh = 0
var costLow = 0L
var costHigh = 0L
for (list in lists) {
val pLowNew = list.minOrNull()!!
val pHighNew = list.maxOrNull()!!
val costLowNew = minOf(costLow + abs(pLow - pHighNew), costHigh + abs(pHigh - pHighNew)) + pHighNew - pLowNew
val costHighNew = minOf(costLow + abs(pLow - pLowNew), costHigh + abs(pHigh - pLowNew)) + pHighNew - pLowNew
pLow = pLowNew; pHigh = pHighNew; costLow = costLowNew; costHigh = costHighNew
}
return minOf(costLow, costHigh)
}
fun main() {
repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2022/round1b/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class gcj.y2022.round1b.BKt {\n private static final long solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n 3: ic... |
mikhail-dvorkin__competitions__3095312/gcj/y2023/farewell_d/e_to_upsolve.kt | package gcj.y2023.farewell_d
import kotlin.random.Random
fun generate(n: Int, m: Int): MutableList<Pair<Int, Int>> {
var toAdd = m
val list = mutableListOf<Pair<Int, Int>>()
fun addEdge(v: Int, u: Int) {
toAdd--
list.add(v to u)
}
for (i in 0 until n) {
addEdge(i, (i + 1) % n)
}
for (i in 2 until n) {
// val canAdd = i - 1
// if (canAdd >= toAdd) {
// for (j in 0..i - 2) addEdge(i, j)
// continue
// }
for (j in i - 2 downTo 0) {
if (toAdd == 0) break
addEdge(i, j)
}
}
return list
}
private fun solve(nei: List<MutableList<Int>>): MutableList<Int> {
val n = nei.size
val s = nei.indices.minBy { nei[it].size }
val used = BooleanArray(n)
val path = mutableListOf(s)
used[s] = true
fun grow() {
while (nei[path.last()].size == 2) {
val v = nei[path.last()].firstOrNull { !used[it] } ?: break
path.add(v)
used[v] = true
}
}
grow()
path.reverse()
grow()
fun grow2() {
while (path.size < n) {
val v = nei[path.last()].firstOrNull { !used[it] } ?: error("")
path.add(v)
used[v] = true
}
}
// if (nei[path.last()].size < nei[path.first()].size) path.reverse()
grow2()
// for (i in path.indices) if (!nei[path[i]].contains(path[(i + 1) % n])) {
// System.setOut(java.io.PrintStream("shit.txt"))
// println(nei)
// println(path)
// println()
// for (i in 0 until n) for (j in 0 until i) if (nei[i].contains(j)) println("${i + 1} ${j + 1}")
// System.out.flush()
// System.exit(1)
// }
return path
}
private fun solve() {
val (n, m) = readInts()
val generated = generate(n, m)
println(generated.joinToString("\n") { "${it.first + 1} ${it.second + 1}" })
val nei = List(n) { mutableListOf<Int>() }
fun addEdge(v: Int, u: Int) {
nei[v].add(u); nei[u].add(v)
}
repeat(m) {
val (u, v) = readInts().map { it - 1 }
addEdge(u, v)
}
val path = solve(nei)
println(path.map { it + 1 }.joinToString(" "))
}
fun main() {
repeat(readInt()) { solve() }
// research(6, 10, 10000)
// for (n in 3..20) for (m in n..n * (n - 1) / 2) research(n, m)
// for (n in 1000..1000) for (m in n..n+10) research(n, m)
}
fun research(n: Int, m: Int, times: Int = 100) {
val graph = generate(n, m)
repeat(times) {
val random = Random(it)
val p = (0 until n).toList().shuffled(random)
println("//" + p)
val nei = List(n) { mutableListOf<Int>() }
fun addEdge(v: Int, u: Int) {
nei[v].add(u); nei[u].add(v)
}
for (edge in graph) {
addEdge(p[edge.first], p[edge.second])
}
val path = solve(nei)
require(path.size == n)
require(path.toSet() == (0 until n).toSet())
for (i in path.indices) require(nei[path[i]].contains(path[(i + 1) % n]))
println(path.map { it + 1 }.joinToString(" "))
}
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2023/farewell_d/E_to_upsolveKt.class",
"javap": "Compiled from \"e_to_upsolve.kt\"\npublic final class gcj.y2023.farewell_d.E_to_upsolveKt {\n public static final java.util.List<kotlin.Pair<java.lang.Integer, java.lang.Integer>> generate(int, int... |
mikhail-dvorkin__competitions__3095312/gcj/y2023/farewell_d/b_small_to_upsolve.kt | package gcj.y2023.farewell_d
private fun solve(): String {
val (a, b, qIn) = readLn().split(" ")
val leftMost = HashMap<Long, Int>(a.length * a.length)
for (i in a.indices) {
var h = 0L
for (j in i until a.length) {
h = mix(h + a[j].code)
leftMost.putIfAbsent(h, j + 1)
}
}
val ans = List(qIn.toInt()) {
val (aLen, bLen) = readInts()
val bStart = b.length - bLen
var h = 0L
for (j in bStart until b.length) {
h = mix(h + b[j].code)
val pos = leftMost.get(h) ?: (a.length + 1)
if (pos > aLen) {
return@List j - bStart
}
}
bLen
}
return ans.joinToString(" ")
}
fun mix(x: Long): Long {
var y = x
y = y xor (y ushr 33)
y *= -0xae502812aa7333L
// y = y xor (y ushr 33)
// y *= -0x3b314601e57a13adL
// y = y xor (y ushr 33)
return y
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2023/farewell_d/B_small_to_upsolveKt.class",
"javap": "Compiled from \"b_small_to_upsolve.kt\"\npublic final class gcj.y2023.farewell_d.B_small_to_upsolveKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #9... |
mikhail-dvorkin__competitions__3095312/gcj/y2023/farewell_d/d_small.kt | package gcj.y2023.farewell_d
private fun solve(): Modular {
val s = readLn()
val dp = ModularArray(s.length) { 0.toModularUnsafe() }
var ans = 0.toModularUnsafe()
for (i in s.indices) {
if (s[i] !in ".o") continue
if (s.take(i).all { it in ".>" }) dp[i] = 1.toModularUnsafe()
for (j in 0 until i) {
var good = true
if (s[j] !in ".o") continue
for (k in j+1 until i) {
val desired = if (2 * k == i + j) '=' else if (2 * k < i + j) '<' else '>'
if (s[k] != desired && s[k] != '.') good = false
}
if (good) dp[i] += dp[j]
}
if (s.drop(i + 1).all { it in ".<" }) ans += dp[i]
}
return ans
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
//typealias Modular = Double; fun Number.toModular() = toDouble(); fun Number.toModularUnsafe() = toDouble()
//typealias ModularArray = DoubleArray; val ModularArray.data; get() = this
@JvmInline
@Suppress("NOTHING_TO_INLINE")
private value class Modular(val x: Int) {
companion object {
const val M = 1000000007; val MOD_BIG_INTEGER = M.toBigInteger()
}
inline operator fun plus(that: Modular) = Modular((x + that.x).let { if (it >= M) it - M else it })
inline operator fun minus(that: Modular) = Modular((x - that.x).let { if (it < 0) it + M else it })
inline operator fun times(that: Modular) = Modular((x.toLong() * that.x % M).toInt())
inline operator fun div(that: Modular) = times(that.inverse())
inline fun inverse() = Modular(x.toBigInteger().modInverse(MOD_BIG_INTEGER).toInt())
override fun toString() = x.toString()
}
private fun Int.toModularUnsafe() = Modular(this)
private fun Int.toModular() = Modular(if (this >= 0) { if (this < Modular.M) this else this % Modular.M } else { Modular.M - 1 - inv() % Modular.M })
private fun Long.toModular() = Modular((if (this >= 0) { if (this < Modular.M) this else this % Modular.M } else { Modular.M - 1 - inv() % Modular.M }).toInt())
private fun java.math.BigInteger.toModular() = Modular(mod(Modular.MOD_BIG_INTEGER).toInt())
private fun String.toModular() = Modular(fold(0L) { acc, c -> (c - '0' + 10 * acc) % Modular.M }.toInt())
@JvmInline
private value class ModularArray(val data: IntArray) {
operator fun get(index: Int) = data[index].toModularUnsafe()
operator fun set(index: Int, value: Modular) { data[index] = value.x }
}
private inline fun ModularArray(n: Int, init: (Int) -> Modular) = ModularArray(IntArray(n) { init(it).x })
private val factorials = mutableListOf(1.toModularUnsafe())
private fun factorial(n: Int): Modular {
while (n >= factorials.size) factorials.add(factorials.last() * factorials.size.toModularUnsafe())
return factorials[n]
}
private fun cnk(n: Int, k: Int) = factorial(n) / factorial(k) / factorial(n - k)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2023/farewell_d/D_smallKt.class",
"javap": "Compiled from \"d_small.kt\"\npublic final class gcj.y2023.farewell_d.D_smallKt {\n private static final java.util.List<gcj.y2023.farewell_d.Modular> factorials;\n\n private static final int solve();\n... |
mikhail-dvorkin__competitions__3095312/gcj/y2023/farewell_d/a_small.kt | package gcj.y2023.farewell_d
private fun solve(): String {
val (nLeft, nRight, c) = readInts()
val (leftIn, rightIn) = List(2) { readInts().map { it - 1 } }
val n = nLeft + nRight
return List(c) {
val (cu, cvIn) = readInts().map { it - 1 }
val cv = nLeft + cvIn
val nei = List(n) { mutableListOf<Int>() }
fun addEdge(u: Int, v: Int) { nei[u].add(v); nei[v].add(u) }
addEdge(cu, cv)
for (i in leftIn.indices) addEdge(i, leftIn[i])
for (i in rightIn.indices) addEdge(nLeft + i, nLeft + rightIn[i])
// val all = LongArray(n)
// val down = LongArray(n)
var ans = 0L
val size = IntArray(n) { 1 }
fun dfs(v: Int, p: Int) {
for (u in nei[v]) if (u != p) {
dfs(u, v)
size[v] += size[u]
ans += size[u].toLong() * (n - size[u])
// down[v] += down[u] + size[u]
}
}
dfs(0, -1)
ans * 2.0 / (n * (n - 1L))
}.joinToString(" ")
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2023/farewell_d/A_smallKt.class",
"javap": "Compiled from \"a_small.kt\"\npublic final class gcj.y2023.farewell_d.A_smallKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #10 // Method readI... |
mikhail-dvorkin__competitions__3095312/gcj/y2019/round3/a.kt | package gcj.y2019.round3
import java.util.TreeSet
private const val M = 1_000_000_000_000L
private const val S = 10_000_000_000L
private fun play() {
val ranges = mutableSetOf(1..M)
fun makeMove(p: Long) {
val removed = ranges.first { p in it }
ranges.remove(removed)
val added = listOf(removed.first until p, p + S..removed.last)
ranges.addAll(added.filter { it.size() >= S })
}
while (true) {
val p = readLong()
if (p < 0) { return }
makeMove(p)
val xor = ranges.map(::getGrundy).fold(0, Int::xor)
val q = if (xor == 0) ranges.first().first else {
val range = ranges.first { getGrundy(it) xor xor < getGrundy(it) }
val wantedValue = getGrundy(range) xor xor
range.first + possibleMoves.first {
getGrundy(it) xor getGrundy(range.size() - S - it) == wantedValue
}
}
println(q)
makeMove(q)
}
}
private val grundy = grundy()
private val possibleMoves = grundy.keys.flatMap { listOf(it.first, it.last).distinct() }
private fun getGrundy(x: Long) : Int = grundy.entries.first { x in it.key }.value
private fun getGrundy(range: LongRange) : Int = getGrundy(range.size())
private fun grundy(): Map<LongRange, Int> {
data class Event(val x: Long, val value: Int, val delta: Int) : Comparable<Event> {
override fun compareTo(other: Event): Int =
compareValuesBy(this, other, { it.x }, { System.identityHashCode(it) })
}
val events = TreeSet<Event>()
val ranges = mutableMapOf((0 until S) to 0)
val reachable = mutableMapOf<Int, Int>().withDefault { 0 }
while (true) {
val (rangeA, valueA) = ranges.entries.maxByOrNull { it.key.first }!!
for ((rangeB, valueB) in ranges) {
val valueC = valueA xor valueB
events.add(Event(rangeA.first + rangeB.first + S, valueC, +1))
events.add(Event(rangeA.last + rangeB.last + 1 + S, valueC, -1))
}
val low = rangeA.last + 1
if (low > M) { break }
while (events.first().x <= low) {
val event = events.pollFirst()
@Suppress("RECEIVER_NULLABILITY_MISMATCH_BASED_ON_JAVA_ANNOTATIONS")
reachable[event.value] = reachable.getValue(event.value) + event.delta
}
val high = minOf(events.first().x, low + S)
val value = (0..reachable.size).first { reachable.getValue(it) == 0 }
if (valueA == value) {
ranges.remove(rangeA)
ranges[rangeA.first until high] = value
} else {
ranges[low until high] = value
}
}
return ranges
}
fun main() {
repeat(readInts()[0]) { play() }
}
private fun LongRange.size(): Long = this.last - this.first + 1
private fun readLn() = readLine()!!
private fun readLong() = readLn().toLong()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2019/round3/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class gcj.y2019.round3.AKt {\n private static final long M;\n\n private static final long S;\n\n private static final java.util.Map<kotlin.ranges.LongRange, java.lang.Intege... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round1a/b.kt | package gcj.y2020.round1a
private fun solve(n: Int) = (0..n).first { solve(n.toLong(), it, true) }
private fun solve(n: Long, p: Int, dir: Boolean): Boolean {
if (p < 0) return true
if (n <= p || n >= 1L shl (p + 1)) return false
val order = if (dir) 0..p else p downTo 0
when {
solve(n - (1L shl p), p - 1, !dir) -> order
solve(n - 1, p - 1, dir) -> order.last..order.last
else -> return false
}.forEach { println("${p + 1} ${it + 1}") }
return true
}
fun main() = repeat(readInt()) { println("Case #${it + 1}:"); solve(readInt()) }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round1a/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class gcj.y2020.round1a.BKt {\n private static final int solve(int);\n Code:\n 0: new #8 // class kotlin/ranges/IntRange\n 3: dup\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round1a/a.kt | package gcj.y2020.round1a
private fun solve(impossible: String = "*"): String {
return List(readInt()) { readLn() }.fold("**") { s, t ->
val split = listOf(s, t).map { it.split("*") }
val prefix = unite(split.map { it[0] }, String::startsWith) ?: return impossible
val suffix = unite(split.map { it.last() }, String::endsWith) ?: return impossible
prefix + "*" + split.flatMap { it.drop(1).dropLast(1) }.joinToString("") + "*" + suffix
}.replace("*", "")
}
fun unite(s: List<String>, f: (String, String, Boolean) -> Boolean): String? {
return s.maxByOrNull { it.length }!!.takeIf { res -> s.all { f(res, it, false) } }
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round1a/AKt$solve$2$prefix$2.class",
"javap": "Compiled from \"a.kt\"\nfinal class gcj.y2020.round1a.AKt$solve$2$prefix$2 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function3<java.lang.String, java.lang.... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round1a/c.kt | package gcj.y2020.round1a
private fun solve(): Long {
val (hei, wid) = readInts()
val a = List(hei) { readInts().toMutableList() }
val nei = List(DX.size) { d -> List(hei) { x -> MutableList(wid) { y ->
val xx = x + DX[d]; val yy = y + DY[d]
a.getOrNull(xx)?.getOrNull(yy)?.let { xx to yy }
} } }
var ans = 0L
var sum = a.flatten().fold(0L, Long::plus)
var toCheck = (0 until hei).flatMap { x -> (0 until wid).map { y -> x to y } }
while (true) {
ans += sum
val eliminated = toCheck.filter { (x, y) ->
val neighbors = nei.mapNotNull { it[x][y] }.map { (xx, yy) -> a[xx][yy] }
a[x][y] * neighbors.size < neighbors.sum()
}.takeIf { it.isNotEmpty() } ?: return ans
toCheck = eliminated.flatMap { (x, y) ->
sum -= a[x][y]
a[x][y] = 0
DX.indices.mapNotNull { d ->
val (xx, yy) = nei[d xor 2][x][y] ?: return@mapNotNull null
nei[d][xx][yy] = nei[d][x][y]
xx to yy
}
}.toSet().minus(eliminated).toList()
}
}
private val DX = intArrayOf(1, 0, -1, 0)
private val DY = intArrayOf(0, 1, 0, -1)
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round1a/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class gcj.y2020.round1a.CKt {\n private static final int[] DX;\n\n private static final int[] DY;\n\n private static final long solve();\n Code:\n 0: invokestatic ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round1a/c_small.kt | package gcj.y2020.round1a
private fun solve(): Long {
val (hei, wid) = readInts()
val a = List(hei) { readInts().toIntArray() }
var ans = 0L
while (true) {
val eliminated = mutableListOf<Pair<Int, Int>>()
for (x in 0 until hei) for (y in 0 until wid) if (a[x][y] > 0) {
fun nei(d: Int): Int? {
var xx = x; var yy = y
while (true) {
xx += DX[d]; yy += DY[d]
val v = a.getOrNull(xx)?.getOrNull(yy) ?: return null
if (v > 0) return v
}
}
val found: List<Int> = DX.indices.mapNotNull { nei(it) }
if (a[x][y] * found.size < found.sum()) eliminated.add(x to y)
}
ans += a.sumBy { it.sum() }
eliminated.forEach { (x, y) -> a[x][y] = 0 }
if (eliminated.isEmpty()) break
}
return ans
}
private val DX = intArrayOf(1, 0, -1, 0)
private val DY = intArrayOf(0, 1, 0, -1)
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round1a/C_smallKt.class",
"javap": "Compiled from \"c_small.kt\"\npublic final class gcj.y2020.round1a.C_smallKt {\n private static final int[] DX;\n\n private static final int[] DY;\n\n private static final long solve();\n Code:\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/qual/c.kt | package gcj.y2020.qual
private fun solve(initials: String = "CJ", impossible: String = "IMPOSSIBLE"): String {
data class Activity(val start: Int, val end: Int, val id: Int)
val activities = List(readInt()) { val (start, end) = readInts(); Activity(start, end, it) }
val ans = IntArray(activities.size)
val free = IntArray(2)
activities.sortedBy { it.start }.forEach {
val who = free.indices.minByOrNull { i -> free[i] }!!
if (free[who] > it.start) return impossible
free[who] = it.end
ans[it.id] = who
}
return ans.map { initials[it] }.joinToString("")
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/qual/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class gcj.y2020.qual.CKt {\n private static final java.lang.String solve(java.lang.String, java.lang.String);\n Code:\n 0: invokestatic #10 // Method r... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/qual/e.kt | package gcj.y2020.qual
private fun solve(possible: String = "POSSIBLE", impossible: String = "IMPOSSIBLE"): String {
// for (n in 2..50) { solveDiagonal(n, 0, 0); solveDiagonal(n, 1, 1); solveDiagonal(n, 1, 2) }
val (n, trace) = readInts()
for (i in 1..n) for (j in 1..n) for (k in 1..n) {
if ((i == j) xor (i == k) || (n - 2) * i + j + k != trace) continue
val d0 = setOf(i, j).size - 1
val d1 = setOf(i, j, k).size - 1
val a = solveDiagonal(n, d0, d1) ?: continue
val switch = IntArray(n) { -1 }
switch[0] = i
switch[d0] = j
switch[d1] = k
for (x in a.indices) if (switch[x] == -1) switch[x] = (1..n).first { it !in switch }
return possible + "\n" + a.joinToString("\n") { row -> row.joinToString(" ") { switch[it].toString() } }
}
return impossible
}
private val memo = mutableMapOf<String, List<IntArray>?>()
private fun solveDiagonal(n: Int, d0: Int, d1: Int): List<IntArray>? {
val code = "$n $d0 $d1"
if (code in memo) return memo[code]
val a = List(n) { IntArray(n) { -1 } }
a.indices.forEach { i -> a[i][i] = 0 }
a[0][0] = d0
a[1][1] = d1
memo[code] = if (d1 >= n) null else search(a)
return memo[code]
}
private fun search(a: List<IntArray>, magic: Int = 3): List<IntArray>? {
val n = a.size
for (x in magic until n) for (y in magic until n) a[x][y] = (y - x + n) % n
for (x in magic until n - magic) {
a[0][x] = x - 1
a[x][0] = n + 1 - x
a[x][1] = n + 2 - x
a[x][2] = n - x
}
val p = List(n) { LongArray(n) { -1L } }
while (true) {
for (i in a.indices) for (j in a.indices) {
val v = a[i][j]
if (v == -1) continue
for (x in a.indices) {
if (x != i) p[x][j] = p[x][j] and (1L shl v).inv()
if (x != j) p[i][x] = p[i][x] and (1L shl v).inv()
if (x != v) p[i][j] = p[i][j] and (1L shl x).inv()
}
}
var improved = false
for (x in a.indices) {
for (y in a.indices) {
var f = a.indices.filter { ((p[x][it] shr y) and 1) > 0 }
if (f.isEmpty()) return null
if (f.size == 1 && a[x][f.first()] == -1) {
a[x][f.first()] = y
improved = true
}
f = a.indices.filter { ((p[it][x] shr y) and 1) > 0 }
if (f.isEmpty()) return null
if (f.size == 1 && a[f.first()][x] == -1) {
a[f.first()][x] = y
improved = true
}
f = a.indices.filter { ((p[x][y] shr it) and 1) > 0 }
if (f.isEmpty()) return null
if (f.size == 1 && a[x][y] == -1) {
a[x][y] = f.first()
improved = true
}
}
}
if (!improved) break
}
for (i in a.indices) for (j in a.indices) {
if (a[i][j] >= 0) continue
for (v in a.indices) {
if (((p[i][j] shr v) and 1) == 0L) continue
val b = a.map { it.clone() }
b[i][j] = v
val res = search(b)
if (res != null) return res
}
return null
}
return a
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/qual/EKt.class",
"javap": "Compiled from \"e.kt\"\npublic final class gcj.y2020.qual.EKt {\n private static final java.util.Map<java.lang.String, java.util.List<int[]>> memo;\n\n private static final java.lang.String solve(java.lang.String,... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/qual/d.kt | package gcj.y2020.qual
private fun solve(n: Int, period: Int = 10) {
val a = IntArray(n)
var iter = 0
fun ask(index: Int): Int {
iter++
println(index + 1)
return readInt()
}
val first = IntArray(2) { -1 }
val negated = IntArray(2) { -1 }
fun fetchNegated(d: Int) {
negated[d] = if (first[d] == -1) 0 else ask(first[d]) xor a[first[d]]
}
for (i in 0 until n / 2) {
val j = n - 1 - i
a[i] = ask(i); a[j] = ask(j)
val d = a[i] xor a[j]
if (first[d] == -1) {
first[d] = i
negated[d] = 0
}
if (negated[d] == -1) fetchNegated(d)
a[i] = a[i] xor negated[d]; a[j] = a[j] xor negated[d]
val needed = if (-1 in negated) 3 else 2
if (iter + needed > period) {
while (iter < period) ask(0)
iter = 0
negated.fill(-1)
}
}
repeat(2) { fetchNegated(it) }
val flipped = negated[0] xor negated[1]
val ans = List(n) { a[if (flipped == 0) it else (n - 1 - it)] xor negated[0] }
println(ans.joinToString(""))
}
fun main() {
val (tests, n) = readInts()
repeat(tests) {
solve(n)
assert(readLn() == "Y")
}
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/qual/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class gcj.y2020.qual.DKt {\n private static final void solve(int, int);\n Code:\n 0: iload_0\n 1: newarray int\n 3: astore_2\n 4: new ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round3/a.kt | package gcj.y2020.round3
private fun solve(): String {
val (s, t) = readStrings()
val way = generateSequence(t) { x -> prev(s, x) }.toList()
return way[way.size / 2]
}
private fun prev(s: String, t: String): String? {
if (s == t) return null
val d = List(s.length + 1) { IntArray(t.length + 1) }
for (i in s.indices) d[i + 1][0] = i + 1
for (j in t.indices) d[0][j + 1] = j + 1
for (i in s.indices) for (j in t.indices) {
if (s[i] == t[j]) {
d[i + 1][j + 1] = d[i][j]
continue
}
d[i + 1][j + 1] = minOf(d[i][j], d[i + 1][j], d[i][j + 1]) + 1
}
var i = s.length
var j = t.length
val ansLast = StringBuilder()
while (i > 0 && j > 0 && s[i - 1] == t[j - 1]) {
ansLast.append(s[i - 1])
i--; j--
}
val ans: String
ans = if (i == 0) t.substring(1, j) else if (j == 0) s.substring(0, 1) else {
if (d[i][j] == d[i - 1][j - 1] + 1) {
t.substring(0, j - 1) + s[i - 1]
} else if (d[i][j] == d[i - 1][j] + 1) {
t.substring(0, j) + s[i - 1]
} else {
t.substring(0, j - 1)
}
}
return ans + ansLast.toString().reversed()
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round3/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class gcj.y2020.round3.AKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #10 // Method readStrings:()Ljava/util/List;\... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round3/b_small.kt | package gcj.y2020.round3
private fun solve(): Int {
val (c, n) = readInts()
val xIn = readInts()
val x = (xIn.map { it - xIn[0] } + c).map { it * 2 }
readLn()
var maxMask = (1 shl (2 * c + 1)) - 1
for (v in x) maxMask = maxMask xor (1 shl v)
var ans = 2 * n
var mask = maxMask
while (mask > 0) {
if (mask.countOneBits() > ans) {
mask = (mask - 1) and maxMask
continue
}
val indices = (0 until 2 * c).filter { ((mask shr it) and 1) == 1 }
if (indices.toSet().intersect(x).isNotEmpty()) {
mask = (mask - 1) and maxMask
continue
}
var good = indices.first() == (2 * c - indices.last())
if (!good) {
mask = (mask - 1) and maxMask
continue
}
for (i in 1 until x.size) {
val inside = (x[i - 1] + 1) until x[i]
if (inside.toSet().intersect(indices).isEmpty()) good = false
}
if (!good) {
mask = (mask - 1) and maxMask
continue
}
for (i in 1..x.size - 2) {
val prev = indices.last { it < x[i] }
val next = indices.first { it > x[i] }
if (prev + next != 2 * x[i]) good = false
}
if (good) ans = minOf(ans, indices.size)
mask = (mask - 1) and maxMask
}
return ans
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun Int.countOneBits(): Int = Integer.bitCount(this)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round3/B_smallKt.class",
"javap": "Compiled from \"b_small.kt\"\npublic final class gcj.y2020.round3.B_smallKt {\n private static final int solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round2/b.kt | package gcj.y2020.round2
private fun solve(): String {
val (n, m) = readInts()
val data = (listOf(0) + readInts()).toIntArray()
val edges = List(m) { readInts().map { it - 1 } }
val added = IntArray(n)
data.withIndex().filter { it.value < 0 }.forEach { entry ->
added[(-entry.value until n).first { added[it] == 0 }] = entry.index
}
val byTime = data.indices.minus(added.toSet()).sortedBy { data[it] }.toMutableList()
for (i in 1 until n) if (added[i] == 0) added[i] = byTime.removeAt(0)
var x = 1
while (x < n) {
if (data[added[x]] > 0) { x++; continue }
val y = (x + 1 until n).firstOrNull { data[added[it]] != data[added[x]] } ?: n
for (i in x until y) data[added[i]] = data[added[x - 1]] + 1
x = y
}
return edges.joinToString(" ") { (u, v) -> (data[u] - data[v]).abs().coerceAtLeast(1).toString() }
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun Int.abs() = kotlin.math.abs(this)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round2/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class gcj.y2020.round2.BKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round2/c.kt | package gcj.y2020.round2
private fun solve(): Int {
val n = readInt()
data class Point(val x: Int, val y: Int)
val points = List(n) { val (x, y) = readInts(); Point(x, y) }
val dirs = points.cartesianTriangle().map { (p, q) ->
val (x, y) = dividedByGcd(p.x - q.x, p.y - q.y)
if (x > 0 || (x == 0 && y > 0)) (x to y) else (-x to -y)
}.toSet()
return dirs.map { (x, y) ->
val sizes = points.groupBy { it.x.toLong() * y - it.y.toLong() * x }.map { it.value.size }
val bad = sizes.count { it == 1 } + sizes.filter { it > 1 }.sum() % 2
sizes.sum() - maxOf(bad - 2, 0)
}.maxOrNull() ?: 1
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun dividedByGcd(a: Int, b: Int) = gcd(a.abs(), b.abs()).let { a / it to b / it }
private tailrec fun gcd(a: Int, b: Int): Int = if (a == 0) b else gcd(b % a, a)
private fun Int.abs() = kotlin.math.abs(this)
private fun <T> Iterable<T>.cartesianTriangle() = withIndex().flatMap { x -> take(x.index).map { x.value to it } }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round2/CKt$solve$Point.class",
"javap": "Compiled from \"c.kt\"\npublic final class gcj.y2020.round2.CKt$solve$Point {\n private final int x;\n\n private final int y;\n\n public gcj.y2020.round2.CKt$solve$Point(int, int);\n Code:\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round2/a.kt | package gcj.y2020.round2
import kotlin.math.pow
fun solvePancakes(aIn: Long, bIn: Long): String {
var a = aIn; var b = bIn
var i = 1L
val maxN = (a.toDouble() + b + 100).pow(0.5).toLong() * 2
fun step(): String? {
if (maxOf(a, b) < i) return "${i - 1} $a $b"
if (a >= b) a -= i else b -= i
i++
return null
}
fun take(amount: Long) = (i - 1..maxN).binarySearch { j -> sum(i, j) >= amount } - 1
val takeA = take(a - b)
a -= sum(i, takeA)
i = takeA + 1
step()?.also { return it }
val takeB = take(b - a)
b -= sum(i, takeB)
i = takeB + 1
if (b > a) { step()?.also { return it } }
val takeAB = (take(a + b) - i) / 2
a -= (i + takeAB - 1) * takeAB
b -= (i + takeAB) * takeAB
i += 2 * takeAB
while (true) { step()?.also { return it } }
}
private fun solve(): String {
val (a, b) = readLongs()
return solvePancakes(a, b)
}
private fun sum(start: Long, end: Long) = (start + end) * (end + 1 - start) / 2
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun LongRange.binarySearch(predicate: (Long) -> Boolean): Long {
var (low, high) = this.first to this.last // must be false .. must be true
while (low + 1 < high) (low + (high - low) / 2).also { if (predicate(it)) high = it else low = it }
return high // first true
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readLongs() = readStrings().map { it.toLong() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round2/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class gcj.y2020.round2.AKt {\n public static final java.lang.String solvePancakes(long, long);\n Code:\n 0: new #9 // class kotlin/jvm/inte... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_b/c.kt | package gcj.y2020.kickstart_b
const val M = 1000000000
val DX = intArrayOf(1, 0, M - 1, 0)
val DY = intArrayOf(0, 1, 0, M - 1)
const val DIR_ROSE = "ESWN"
private fun solve(): String {
val s = "1(" + readLn() + ")"
var i = 0
fun readMove(): Pair<Int, Int> {
val c = s[i++]
if (c in DIR_ROSE) return DIR_ROSE.indexOf(c).let { DX[it] to DY[it] }
i++
var x = 0
var y = 0
while (s[i] != ')') {
val (moveX, moveY) = readMove()
x = (x + moveX) % M
y = (y + moveY) % M
}
val (moveX, moveY) = listOf(x, y).map { (it.toLong() * (c - '0') % M).toInt() }
i++
return moveX to moveY
}
val (x, y) = readMove()
return "${x + 1} ${y + 1}"
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_b/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class gcj.y2020.kickstart_b.CKt {\n public static final int M;\n\n private static final int[] DX;\n\n private static final int[] DY;\n\n public static final java.lang.... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_b/d.kt | package gcj.y2020.kickstart_b
import kotlin.math.pow
private fun solve(): Double {
val (w, h, x1, y1, x2, y2) = readInts()
return solve(x1 - 1, y2 - 1, h) + solve(y1 - 1, x2 - 1, w)
}
private fun solve(x: Int, y: Int, h: Int): Double {
if (y + 1 >= h) return 0.0
var res = 0.0
var c = 1.0
var p = x + y
for (i in 0 until x) {
res += c * (2.0).pow(-p)
c *= x + y - i
c /= i + 1
while (c < 1) { p++; c *= 2 }
while (c > 1) { p--; c /= 2 }
}
return res
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
operator fun <T> List<T>.component6(): T = get(5)
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_b/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class gcj.y2020.kickstart_b.DKt {\n private static final double solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_d/c.kt | package gcj.y2020.kickstart_d
private fun solve(): Double {
val (n, a, b) = readInts()
val p = listOf(0, 0) + readInts()
val p1 = probs(p, a)
val p2 = probs(p, b)
val x = (1 until p.size).map { p1[it].toLong() * p2[it] }.sum()
return p.size - 1 - x / (p.size - 1.0) / (p.size - 1)
}
private fun probs(p: List<Int>, a: Int): IntArray {
val q = 22
val n = p.size
val r = List(q) { IntArray(n) }
for (i in p.indices) r[0][i] = p[i]
for (j in 1 until q) {
for (i in p.indices) r[j][i] = r[j - 1][r[j - 1][i]]
}
val up = IntArray(n) { i ->
var k = i
for (j in 0 until q) {
if (((a shr j) and 1) == 0) continue
k = r[j][k]
}
k
}
val below = IntArray(n)
for (i in below.indices.reversed()) {
below[i]++
below[up[i]] += below[i]
}
return IntArray(n) { n - 1 - below[it] }
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ").filter { it.isNotEmpty() }
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_d/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class gcj.y2020.kickstart_d.CKt {\n private static final double solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_d/d.kt | package gcj.y2020.kickstart_d
private fun solve(): String {
val (n, q) = readInts()
val d = readInts().toIntArray()
val maxD = d.maxOrNull()!!
val st = SparseTable(d)
fun canWalk(s: Int, t: Int): Pair<Int, Int> {
var low = s
var high = n
while (low + 1 < high) {
val mid = (low + high) / 2
val maxDoor = st.max(s, mid)
if (maxDoor <= t) low = mid else high = mid
}
val ans1 = low - s
low = s
high = -1
while (low - 1 > high) {
val mid = (low + high) / 2
val maxDoor = st.max(mid, s)
if (maxDoor <= t) low = mid else high = mid
}
val ans2 = s - low
return ans1 to ans2
}
val ans = IntArray(q) {
val (sIn, k) = readInts()
val s = sIn -1
if (k == 1) return@IntArray s
var low = 0
var high = maxD
while (low + 1 < high) {
val mid = (low + high) / 2
val cw = canWalk(s, mid)
if (cw.first + cw.second + 1 >= k) high = mid else low = mid
}
val cw = canWalk(s, high)
val cwp = canWalk(s, high - 1)
if (cw.first != cwp.first) s - cw.first else s + cw.second
high
}
return ans.joinToString(" ")
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
class SparseTable(a: IntArray) {
var min: Array<IntArray>
var max: Array<IntArray>
fun min(from: Int, to: Int): Int {
val j = Integer.SIZE - 1 - Integer.numberOfLeadingZeros(to - from)
return Math.min(min[j][from], min[j][to - (1 shl j)])
}
fun max(from: Int, to: Int): Int {
val j = Integer.SIZE - 1 - Integer.numberOfLeadingZeros(to - from)
return Math.max(max[j][from], max[j][to - (1 shl j)])
}
init {
val n = a.size
var t = 1
while (1 shl t <= n) {
t++
}
min = Array(t) { IntArray(n) }
max = Array(t) { IntArray(n) }
System.arraycopy(a, 0, min[0], 0, n)
System.arraycopy(a, 0, max[0], 0, n)
for (j in 1 until t) {
var i = 0
while (i + (1 shl j) <= n) {
min[j][i] = Math.min(min[j - 1][i], min[j - 1][i + (1 shl j - 1)])
max[j][i] = Math.max(max[j - 1][i], max[j - 1][i + (1 shl j - 1)])
i++
}
}
}
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_d/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class gcj.y2020.kickstart_d.DKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_c/d.kt | package gcj.y2020.kickstart_c
private fun solve(): Long {
val (n, q) = readInts()
val ft = FenwickTree(n)
val ftCoef = FenwickTree(n)
fun set(i: Int, value: Int) {
ft[i] = minusOnePow(i) * value
ftCoef[i] = minusOnePow(i) * value * (i + 1)
}
fun query(start: Int, end: Int) = (ftCoef.sum(start, end) - ft.sum(start, end) * start) * minusOnePow(start)
readInts().forEachIndexed(::set)
var ans = 0L
repeat(q) {
val (op, xIn, yIn) = readStrings()
val x = xIn.toInt() - 1; val y = yIn.toInt()
if (op == "U") set(x, y) else ans += query(x, y)
}
return ans
}
class FenwickTree(n: Int) {
val t = LongArray(n)
fun add(i: Int, value: Long) {
var j = i
while (j < t.size) {
t[j] += value
j += j + 1 and -(j + 1)
}
}
fun sum(i: Int): Long {
var j = i - 1
var res = 0L
while (j >= 0) {
res += t[j]
j -= j + 1 and -(j + 1)
}
return res
}
fun sum(start: Int, end: Int): Long = sum(end) - sum(start)
operator fun get(i: Int): Long = sum(i, i + 1)
operator fun set(i: Int, value: Int) = add(i, value - get(i))
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
fun minusOnePow(i: Int) = 1 - ((i and 1) shl 1)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/kickstart_c/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class gcj.y2020.kickstart_c.DKt {\n private static final long solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round1b/b.kt | package gcj.y2020.round1b
import kotlin.math.abs
private const val SIZE = 1_000_000_000
private fun solve() {
val grid = listOf(-SIZE / 3, SIZE / 3).cartesianSquare()
val (xInit, yInit) = grid.first { (x, y) -> hit(x, y) }
val (xLeft, _) = furthestInside(xInit, yInit, -1, 0)
val (xRight, _) = furthestInside(xInit, yInit, 1, 0)
val xCenter = (xLeft + xRight) / 2
val (_, yUp) = furthestInside(xCenter, yInit, 0, 1)
val (_, yDown) = furthestInside(xCenter, yInit, 0, -1)
hit(xCenter, (yUp + yDown) / 2)
}
private fun furthestInside(x: Int, y: Int, dx: Int, dy: Int): Pair<Int, Int> {
val r = (0..2 * SIZE + 1).binarySearch { !hit(x + dx * it, y + dy * it) } - 1
return x + dx * r to y + dy * r
}
private fun hit(x: Int, y: Int): Boolean {
if (maxOf(abs(x), abs(y)) > SIZE) return false
println("$x $y")
return "HIT" == readLn().also { if (it == "CENTER") throw Found() }
}
private class Found : Exception()
fun main() = repeat(readLn().split(" ")[0].toInt()) { try { solve() } catch (_: Found) {} }
private fun IntRange.binarySearch(predicate: (Int) -> Boolean): Int {
var (low, high) = this.first to this.last
while (low + 1 < high) (low + (high - low) / 2).also { if (predicate(it)) high = it else low = it }
return high
}
private fun readLn() = readLine()!!
private fun <T> Iterable<T>.cartesianSquare() = flatMap { x -> map { y -> x to y } }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round1b/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class gcj.y2020.round1b.BKt {\n private static final int SIZE;\n\n private static final void solve();\n Code:\n 0: iconst_2\n 1: anewarray #8 ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round1b/c.kt | package gcj.y2020.round1b
private fun greedy(init: List<Int>): String {
var a = init
val moves = mutableListOf<String>()
while (a.zipWithNext().any { it.first > it.second }) {
val pairs = mutableMapOf<Int, Pair<Int, Int>>()
loop@for (i in 1 until a.size) for (j in i + 1 until a.size) {
val score = sequenceOf(a[0] != a[j - 1], a[i - 1] == a[i], a[i - 1] != a[j], a[j - 1] == a[j]).count { it }
pairs[score] = i to j
if (score == 0) break@loop
}
val (i, j) = pairs[pairs.keys.minOrNull()]!!
a = a.subList(i, j) + a.take(i) + a.drop(j)
moves.add("$i ${j - i}")
}
return "${moves.size}\n${moves.joinToString("\n")}"
}
private fun solve(): String {
val (r, s) = readInts()
val a = List(s) { List(r) { it } }.flatten()
return greedy(a)
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round1b/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class gcj.y2020.round1b.CKt {\n private static final java.lang.String greedy(java.util.List<java.lang.Integer>);\n Code:\n 0: aload_0\n 1: astore_1\n 2: ... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round1b/a.kt | package gcj.y2020.round1b
private fun solve(): String {
var (x, y) = readInts()
val steps = (x.abs() + y.abs()).countSignificantBits()
return (steps - 1 downTo 0).map { i ->
val dir = DX.indices.maxByOrNull { x * DX[it] + y * DY[it] }!!
x -= DX[dir] shl i; y -= DY[dir] shl i
DIR_ROSE[dir]
}.joinToString("").reversed().takeIf { x == 0 && y == 0 } ?: "IMPOSSIBLE"
}
private val DX = intArrayOf(1, 0, -1, 0)
private val DY = intArrayOf(0, 1, 0, -1)
private const val DIR_ROSE = "ENWS"
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun Int.countSignificantBits() = Int.SIZE_BITS - Integer.numberOfLeadingZeros(this)
private fun Int.abs() = kotlin.math.abs(this)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round1b/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class gcj.y2020.round1b.AKt {\n private static final int[] DX;\n\n private static final int[] DY;\n\n private static final java.lang.String DIR_ROSE;\n\n private static fi... |
mikhail-dvorkin__competitions__3095312/gcj/y2020/round1b/c_small.kt | package gcj.y2020.round1b
private fun search(init: List<Int>): String {
val queue = mutableListOf(init)
val dist = mutableMapOf(init to 0)
val how = mutableMapOf<List<Int>, Way?>()
var index = 0
while (true) {
val a = queue[index++]
if (a.zipWithNext().all { it.first <= it.second }) return "${dist[a]}\n${how[a]}"
for (i in 1 until a.size) for (j in i + 1..a.size) {
val b = a.subList(i, j) + a.take(i) + a.drop(j)
if (b in dist) continue
dist[b] = dist[a]!! + 1
how[b] = Way(i, j, how[a])
queue.add(b)
}
}
}
private data class Way(val i: Int, val j: Int, val prev: Way?) {
override fun toString(): String = (if (prev == null) "" else prev.toString() + "\n") + "$i ${j - i}"
}
private fun solve(): String {
val (r, s) = readInts()
val a = List(s) { List(r) { it } }.flatten()
return search(a)
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/gcj/y2020/round1b/C_smallKt.class",
"javap": "Compiled from \"c_small.kt\"\npublic final class gcj.y2020.round1b.C_smallKt {\n private static final java.lang.String search(java.util.List<java.lang.Integer>);\n Code:\n 0: iconst_1\n 1: a... |
mikhail-dvorkin__competitions__3095312/facebook/y2023/qual/c.kt | package facebook.y2023.qual
private fun solve(): Int {
readInt()
val a = readInts().sorted()
if (a.size == 1) return 1
val inf = Int.MAX_VALUE
val ans = listOf(a[0] + a.last(), a[0] + a[a.size - 2], a[1] + a.last()).minOf { sum ->
val pool = a.groupBy {it}.mapValues { it.value.size }.toMutableMap()
fun remove(v: Int) {
if (pool[v] == 1) pool.remove(v) else pool[v] = pool[v]!! - 1
}
val unpaired = mutableListOf<Int>()
while (pool.isNotEmpty()) {
val v = pool.iterator().next().key
remove(v)
val u = sum - v
if (u in pool) {
remove(u)
continue
}
unpaired.add(v)
}
if (unpaired.size != 1) return@minOf inf
(sum - unpaired[0]).takeIf { it > 0 } ?: inf
}
return if (ans == inf) -1 else ans
}
fun main() {
System.setIn(java.io.File("input.txt").inputStream())
System.setOut(java.io.PrintStream("output.txt"))
repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
}
private fun readInt() = readln().toInt()
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2023/qual/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class facebook.y2023.qual.CKt {\n private static final int solve();\n Code:\n 0: invokestatic #9 // Method readInt:()I\n 3: pop\n 4: ... |
mikhail-dvorkin__competitions__3095312/facebook/y2023/round1/b.kt | package facebook.y2023.round1
private fun precalc(s: Int = 41): List<MutableMap<Int, Sequence<Int>>> {
val dp = List(s + 1) { List(it + 1) { mutableMapOf<Int, Sequence<Int>>() } }
dp[0][0][1] = emptySequence()
for (sum in 0 until s) {
for (count in 0..sum) {
for (entry in dp[sum][count]) {
for (x in 1..s - sum) {
dp[sum + x][count + 1][entry.key * x] = sequenceOf(x) + entry.value
}
}
}
}
return dp[s]
}
private val precalc = precalc()
private fun solve(): List<Int> {
val p = readInt()
val map = precalc.firstOrNull { p in it }
?: return listOf(-1)
return map[p]!!.toList().let { listOf(it.size) + it }
}
fun main() {
System.setIn(java.io.File("input.txt").inputStream())
System.setOut(java.io.PrintStream("output.txt"))
repeat(readInt()) { println("Case #${it + 1}: ${solve().joinToString(" ")}") }
}
private fun readInt() = readln().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2023/round1/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class facebook.y2023.round1.BKt {\n private static final java.util.List<java.util.Map<java.lang.Integer, kotlin.sequences.Sequence<java.lang.Integer>>> precalc;\n\n priv... |
mikhail-dvorkin__competitions__3095312/facebook/y2019/qual/d.kt | package facebook.y2019.qual
import kotlin.random.Random
private fun solve(): String {
val (n, m) = readInts()
val requirements = List(m) { readInts().map { it - 1 } }
val ans = IntArray(n)
try {
construct(ans, -1, List(n) { it }, requirements)
} catch (_: IllegalArgumentException) {
return "Impossible"
}
return ans.map { it + 1 }.joinToString(" ")
}
private fun construct(ans: IntArray, parent: Int, vertices: Collection<Int>, requirements: List<List<Int>>) {
val possibleRoots = vertices.toMutableSet()
for (r in requirements) {
repeat(2) {
if (r[it] != r[2]) {
possibleRoots.remove(r[it])
}
}
}
fun canBeRoot(root: Int): Pair<Int, DisjointSetUnion>? {
val different = mutableListOf<Pair<Int, Int>>()
val dsu = DisjointSetUnion(ans.size)
for (r in requirements) {
if (r[2] == root) {
if ((r[0] != root) and (r[1] != root)) {
different.add(Pair(r[0], r[1]))
}
continue
}
dsu.unite(r[0], r[1])
dsu.unite(r[0], r[2])
}
for ((a, b) in different) {
if (dsu[a] == dsu[b]) {
return null
}
}
return Pair(root, dsu)
}
val (root, dsu) = possibleRoots.mapNotNull(::canBeRoot).firstOrNull() ?: throw IllegalArgumentException()
ans[root] = parent
val children = vertices.filter { (dsu[it] == it) and (it != root) }
val requirementsByChild = requirements.filter { it[2] != root }.groupBy { dsu[it[0]] }
val verticesByChild = vertices.minus(root).groupBy { dsu[it] }
for (v in children) {
construct(ans, root, verticesByChild.getValue(v), requirementsByChild.getOrElse(v) { listOf() })
}
}
class DisjointSetUnion(n: Int) {
internal val p: IntArray = IntArray(n) { it }
internal val r = Random(566)
internal operator fun get(v: Int): Int {
if (p[v] == v) {
return v
}
p[v] = get(p[v])
return p[v]
}
internal fun unite(v: Int, u: Int) {
val a = get(v)
val b = get(u)
if (r.nextBoolean()) {
p[a] = b
} else {
p[b] = a
}
}
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2019/qual/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class facebook.y2019.qual.DKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #12 // Method readInts:()Ljava/util/Lis... |
mikhail-dvorkin__competitions__3095312/facebook/y2019/round1/c.kt | package facebook.y2019.round1
private fun solve(): Int {
val (n, hei) = readInts()
data class Ladder(val id: Int, val x: Int, val yFrom: Int, val yTo: Int)
val ladders = List(n) { val (x, yFrom, yTo) = readInts(); Ladder(it, x, yFrom, yTo) }
val e = Array(n + 2) { IntArray(n + 2) }
val ys = ladders.flatMap { listOf(it.yFrom, it.yTo) }.toSet().sorted()
for ((y, yNext) in ys.zipWithNext()) {
val idsOrdered = ladders.filter { (it.yFrom <= y) && (y < it.yTo) }.sortedBy { it.x }.map { it.id }
for ((i, j) in idsOrdered.zipWithNext()) {
e[i][j] += yNext - y
e[j][i] += yNext - y
}
}
val inf = n * hei
ladders.forEach {
if (it.yFrom == 0) { e[n][it.id] = inf }
if (it.yTo == hei) { e[it.id][n + 1] = inf }
}
return edmonsKarp(e, n, n + 1).takeIf { it < inf } ?: -1
}
fun edmonsKarp(c: Array<IntArray>, s: Int, t: Int): Int {
val n = c.size
val f = Array(n) { IntArray(n) }
val queue = IntArray(n)
val prev = IntArray(n)
var res = 0
while (true) {
queue[0] = s
var low = 0
var high = 1
prev.fill(-1)
prev[s] = s
while (low < high && prev[t] == -1) {
val v = queue[low]
low++
for (u in 0 until n) {
if (prev[u] != -1 || f[v][u] == c[v][u]) {
continue
}
prev[u] = v
queue[high] = u
high++
}
}
if (prev[t] == -1) {
break
}
var flow = Int.MAX_VALUE
var u = t
while (u != s) {
flow = minOf(flow, c[prev[u]][u] - f[prev[u]][u])
u = prev[u]
}
u = t
while (u != s) {
f[prev[u]][u] += flow
f[u][prev[u]] -= flow
u = prev[u]
}
res += flow
}
return res
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private val isOnlineJudge = System.getProperty("ONLINE_JUDGE") == "true"
@Suppress("unused")
private val stdStreams = (false to false).apply { if (!isOnlineJudge) {
if (!first) System.setIn(java.io.File("input.txt").inputStream())
if (!second) System.setOut(java.io.PrintStream("output.txt"))
}}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2019/round1/CKt$solve$Ladder.class",
"javap": "Compiled from \"c.kt\"\npublic final class facebook.y2019.round1.CKt$solve$Ladder {\n private final int id;\n\n private final int x;\n\n private final int yFrom;\n\n private final int yTo;\n\... |
mikhail-dvorkin__competitions__3095312/facebook/y2019/round1/a.kt | package facebook.y2019.round1
private const val INF = Int.MAX_VALUE / 3
private fun solve(): String {
val (n, m) = readInts()
val edgesInput = List(m) { readInts() }
val graph = Array(n) { IntArray(n) { INF } }
for ((aInput, bInput, d) in edgesInput) {
val a = aInput - 1
val b = bInput - 1
graph[a][b] = d
graph[b][a] = d
}
val e = graph.copy()
for (k in 0 until n) {
for (i in 0 until n) {
for (j in 0 until n) {
e[i][j] = minOf(e[i][j], e[i][k] + e[k][j])
if ((e[i][j] < graph[i][j]) && (graph[i][j] < INF)) { return "Impossible" }
}
}
}
return "$m\n${edgesInput.joinToString("\n") { it.joinToString(" ") }}"
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun Array<IntArray>.copy() = Array(size) { get(it).clone() }
private val isOnlineJudge = System.getProperty("ONLINE_JUDGE") == "true"
@Suppress("unused")
private val stdStreams = (false to false).apply { if (!isOnlineJudge) {
print(java.io.File(".").canonicalPath)
if (!first) System.setIn(java.io.File("input.txt").inputStream())
if (!second) System.setOut(java.io.PrintStream("output.txt"))
}}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2019/round1/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class facebook.y2019.round1.AKt {\n private static final int INF;\n\n private static final boolean isOnlineJudge;\n\n private static final kotlin.Pair<java.lang.Boolean... |
mikhail-dvorkin__competitions__3095312/facebook/y2019/round1/d.kt | package facebook.y2019.round1
private fun solve(): Int {
val (n, h, v) = readInts()
val (x, y) = List(2) {
val (x1, x2, ax, bx, cx, dx) = readInts()
val x = IntArray(n)
x[0] = x1
x[1] = x2
for (i in 2 until n) {
x[i] = ((ax * 1L * x[i - 2] + bx * 1L * x[i - 1] + cx) % dx + 1).toInt()
}
x
}
val sorted = listOf(x to y, y to x).map { (x, y) ->
val longs = List(n) { (x[it].toLong() shl 32) + y[it].toLong() }.sorted()
longs.map { (it shr 32).toInt() } to longs.map { it.toInt() }
}
return if (h + v < n) -1 else List(2) { t ->
solveVertical(sorted[t].second, sorted[t].first, sorted[1 - t].first, listOf(h, v)[t])
}.minOrNull()!!
}
fun solveVertical(x: List<Int>, y: List<Int>, xSorted: List<Int>, v: Int): Int {
val n = x.size
var ans = y.last() + if (v < n) xSorted.last() else 0
val xAffordable = xSorted.getOrElse(n - v - 1) { 0 }
var xMaxAbove = 0
var xMax = 0
for (i in n - 1 downTo 0) {
xMax = maxOf(xMax, x[i])
if (i > 0 && y[i] == y[i - 1]) continue
if (xMaxAbove <= xMax) {
ans = minOf(ans, y[i] + maxOf(xAffordable, xMaxAbove))
xMaxAbove = xMax
}
if (i < v) break
xMax = 0
}
return ans
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private operator fun <T> List<T>.component6(): T { return get(5) }
private val isOnlineJudge = System.getProperty("ONLINE_JUDGE") == "true"
@Suppress("unused")
private val stdStreams = (false to false).apply { if (!isOnlineJudge) {
if (!first) System.setIn(java.io.File("input.txt").inputStream())
if (!second) System.setOut(java.io.PrintStream("output.txt"))
}}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2019/round1/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class facebook.y2019.round1.DKt {\n private static final boolean isOnlineJudge;\n\n private static final kotlin.Pair<java.lang.Boolean, java.lang.Boolean> stdStreams;\n\... |
mikhail-dvorkin__competitions__3095312/facebook/y2021/qual/b.kt | package facebook.y2021.qual
private fun needed(s: String): Pair<Int, Int>? {
return (s.count { it == '.' } to s.indexOf('.')).takeIf { 'O' !in s }
}
private fun solve(): String {
val field = List(readInt()) { readLn() }
val options = field.indices.flatMap { i -> listOf(
needed(field[i])?.let { it.first to (i to it.second) },
needed(field.map { it[i] }.joinToString(""))?.let { it.first to (it.second to i) }
)}.filterNotNull()
val needed = options.minOfOrNull { it.first } ?: return "Impossible"
val goodOptions = options.filter { it.first == needed }
val different = if (needed == 1) goodOptions.toSet().size else goodOptions.size
return "$needed $different"
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2021/qual/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class facebook.y2021.qual.BKt {\n private static final kotlin.Pair<java.lang.Integer, java.lang.Integer> needed(java.lang.String);\n Code:\n 0: aload_0\n 1: ... |
mikhail-dvorkin__competitions__3095312/facebook/y2021/qual/c1.kt | package facebook.y2021.qual
private fun solve(): Int {
val n = readInt()
val c = readInts()
val nei = List(n) { mutableListOf<Int>() }
repeat(n - 1) {
val (v, u) = readInts().map { it - 1 }
nei[v].add(u)
nei[u].add(v)
}
fun dfs(v: Int, p: Int): Int {
return c[v] + ((nei[v] - p).maxOfOrNull { dfs(it, v) } ?: 0)
}
return c[0] + nei[0].map { dfs(it, 0) }.sorted().takeLast(2).sum()
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2021/qual/C1Kt.class",
"javap": "Compiled from \"c1.kt\"\npublic final class facebook.y2021.qual.C1Kt {\n private static final int solve();\n Code:\n 0: invokestatic #9 // Method readInt:()I\n 3: istore_0\n ... |
mikhail-dvorkin__competitions__3095312/facebook/y2021/qual/a2.kt | package facebook.y2021.qual
private fun solve(from: Char = 'A', toInclusive: Char = 'Z'): Int {
val s = readLn()
val letters = toInclusive - from + 1
val inf = letters + 1
val e = List(letters) { IntArray(letters) { inf } }
repeat(readInt()) {
val (u, v) = readLn().map { it - from }
e[u][v] = 1
}
for (k in e.indices) {
e[k][k] = 0
for (i in e.indices) {
for (j in e.indices) {
e[i][j] = minOf(e[i][j], e[i][k] + e[k][j])
}
}
}
fun cost(k: Int): Int? {
return s.sumOf { c -> e[c - from][k].also { if (it == inf) return null } }
}
return e.indices.mapNotNull { cost(it) }.minOrNull() ?: -1
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2021/qual/A2Kt.class",
"javap": "Compiled from \"a2.kt\"\npublic final class facebook.y2021.qual.A2Kt {\n private static final int solve(char, char);\n Code:\n 0: invokestatic #10 // Method readLn:()Ljava/lang/Strin... |
mikhail-dvorkin__competitions__3095312/facebook/y2021/round1/a3.kt | package facebook.y2021.round1
private fun solve(M: Int = 1_000_000_007): Int {
readLn()
val s = readLn()
var firstChar = 0.toChar()
var lastChar = 0.toChar()
var firstPos = -1
var lastPos = -1
var length = 0
var pairs = 0
var leftTicks = 0
var rightTicks = 0
var answer = 0
for (i in s.indices) {
if (s[i] == 'F') {
rightTicks = (rightTicks + pairs) % M
answer = (answer + leftTicks) % M
length = (length + 1) % M
continue
}
if (s[i] == '.') {
val oldPairs = pairs
pairs = (2 * pairs) % M
if (firstChar != 0.toChar()) {
answer = ((2 * answer + (leftTicks + rightTicks).toLong() * length) % M).toInt()
leftTicks = ((leftTicks * 2 + length.toLong() * oldPairs) % M).toInt()
rightTicks = ((rightTicks * 2 + length.toLong() * oldPairs) % M).toInt()
if (firstChar != lastChar) {
pairs = (pairs + 1) % M
answer = ((answer + (lastPos + 1).toLong() * (length - firstPos + M)) % M).toInt()
leftTicks = (leftTicks + lastPos + 1) % M
rightTicks = ((rightTicks.toLong() + length - firstPos + M) % M).toInt()
}
lastPos = (lastPos + length) % M
}
length = (2 * length) % M
continue
}
if (firstChar == 0.toChar()) {
firstChar = s[i]
lastChar = s[i]
firstPos = length
lastPos = length
length = (length + 1) % M
continue
}
rightTicks = (rightTicks + pairs) % M
answer = (answer + leftTicks) % M
if (s[i] != lastChar) {
leftTicks = (leftTicks + lastPos + 1) % M
rightTicks = (rightTicks + 1) % M
answer = (answer + lastPos + 1) % M
pairs = (pairs + 1) % M
}
lastPos = length
lastChar = s[i]
length = (length + 1) % M
}
return answer
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2021/round1/A3Kt.class",
"javap": "Compiled from \"a3.kt\"\npublic final class facebook.y2021.round1.A3Kt {\n private static final int solve(int);\n Code:\n 0: invokestatic #10 // Method readLn:()Ljava/lang/String;\... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/qual/d1.kt | package facebook.y2020.qual
private fun solve(): Long {
val (n, m) = readInts()
val c = List(n) { readInt() }
val a = mutableListOf(m to 0L)
var low = 0
val inf = c.fold(0L, Long::plus) + 1
for (i in c.indices) {
while (a[low].first < i) low++
val cost = a[low].second
if (i == n - 1) return cost.takeIf { it < inf } ?: -1L
val costI = if (i == 0) 0L else c[i].toLong().takeIf { it > 0 } ?: inf
val new = i + m to cost + costI
while ((low < a.size) && (a.last().second >= new.second)) a.pop()
a.add(new)
}
error("")
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun <T> MutableList<T>.pop() = removeAt(lastIndex)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/qual/D1Kt.class",
"javap": "Compiled from \"d1.kt\"\npublic final class facebook.y2020.qual.D1Kt {\n private static final long solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/qual/c.kt | package facebook.y2020.qual
private fun solve(): Int {
val n = readInt()
val growsHere = mutableMapOf<Int, Int>()
val fallsHere = mutableMapOf<Int, MutableList<Int>>()
repeat(n) {
val (p, h) = readInts()
growsHere[p] = h
fallsHere.computeIfAbsent(p - h) { mutableListOf() }.add(h)
}
val best = mutableMapOf<Int, Int>()
val bestWithoutThis = mutableMapOf<Int, Int>()
for (x in (growsHere.keys + fallsHere.keys).sorted()) {
val b = best.getOrDefault(x, 0)
val bw = bestWithoutThis.getOrDefault(x, 0)
for (h in fallsHere.getOrElse(x) { mutableListOf() }) {
best[x + h] = maxOf(best.getOrDefault(x + h, 0), maxOf(b, bw) + h)
}
val h = growsHere[x] ?: continue
bestWithoutThis[x + h] = maxOf(bestWithoutThis.getOrDefault(x + h, 0), bw + h)
}
return (best.values + bestWithoutThis.values).maxOrNull()!!
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/qual/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class facebook.y2020.qual.CKt {\n private static final int solve();\n Code:\n 0: invokestatic #9 // Method readInt:()I\n 3: istore_0\n ... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round3/b.kt | package facebook.y2020.round3
import java.util.*
private fun solve(): Int {
val (n, m, k, x) = readInts()
val (sIn, pIn) = listOf(n, m).map { length ->
val array = readInts().toIntArray() + IntArray(length - k) { 0 }
val (a, b, c, d) = readInts()
for (i in k until length) {
array[i] = ((a.toLong() * array[i - 2] + b.toLong() * array[i - 1] + c) % d).toInt() + 1
}
array
}
val set = TreeMap<Int, Deque<Int>>()
fun add(size: Int) {
val r = size % x
set.putIfAbsent(r, LinkedList())
set[r]!!.addLast(size)
}
fun remove(p: Int): Int {
val r = p % x
val q = set.ceilingKey(r) ?: set.ceilingKey(0)
val size = set[q]!!.pollFirst()
if (set[q]!!.isEmpty()) {
set.remove(q)
}
return (size - p) / x
}
val sizes = sIn.sortedDescending()
val sizesLarge = sizes.filter { it >= x }
val sizesSmall = sizes.filter { it < x }
val packages = pIn.sorted()
var low = 0
var high = minOf(n, m) + 1
while (low + 1 < high) {
val mid = (low + high) / 2
var i = 0
var j = 0
val deque = LinkedList<Int>()
var keys = 0L
var bad = false
for (p in packages.take(mid).reversed()) {
while ((i < sizesLarge.size) && (sizesLarge[i] >= p)) {
add(sizesLarge[i])
i++
}
while ((j < sizesSmall.size) && (sizesSmall[j] >= p)) {
deque.addLast(sizesSmall[j])
j++
}
if (set.isEmpty()) {
if (p < x) {
if (deque.isNotEmpty()) {
deque.removeLast()
continue
}
}
bad = true
break
}
keys += remove(p)
}
while (i < sizesLarge.size) {
add(sizesLarge[i])
i++
}
while (j < sizesSmall.size) {
deque.addLast(sizesSmall[j])
j++
}
while (set.isNotEmpty()) {
keys += remove(0)
}
while (deque.isNotEmpty()) {
deque.removeLast()
keys++
}
if (bad || keys < n - 1) high = mid else low = mid
}
return low
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round3/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class facebook.y2020.round3.BKt {\n private static final int solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round3/c.kt | package facebook.y2020.round3
private fun solve(): String {
val (n, k) = readInts()
data class Measurement(val time: Int, val p: Int, val r: Int)
val measurements = List(n) {
val (p, r) = readInts()
Measurement(it, p, r)
}
val ps = measurements.map { it.p }.toSet().sorted()
var a = Array(k + 1) { n + 1 to 0 }
a[0] = 0 to 0
for (p in ps) {
val ms = measurements.filter { it.p == p }
val b = Array(k + 1) { n + 1 to 0 }
for (crosses in 0..ms.size) {
if (crosses > 0 && ms[crosses - 1].r == 1) continue
var toDelete = 0
for (i in ms.indices) {
if (i < crosses && ms[i].r == 1) toDelete++
if (i >= crosses && ms[i].r == 0) toDelete++
}
val lastCross = if (crosses == 0) -1 else ms[crosses - 1].time
val firstTick = if (crosses == ms.size) n else ms[crosses].time
for (q in 0..k) {
}
}
a = b
}
return ""
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round3/CKt$solve$Measurement.class",
"javap": "Compiled from \"c.kt\"\npublic final class facebook.y2020.round3.CKt$solve$Measurement {\n private final int time;\n\n private final int p;\n\n private final int r;\n\n public facebook.y... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round3/a.kt | package facebook.y2020.round3
import java.lang.StringBuilder
private fun solve(): String {
var k = readInt() / 2
val main = minOf(100, k + 2)
var vertices = main
val edges = mutableListOf<Pair<Int, Int>>()
for (i in 1 until main) {
edges.add(i - 1 to i)
}
k -= main - 2
for (i in 1..main - 2) {
var deg = 2
while (true) {
val next = k + deg * (deg - 1) / 2 - deg * (deg + 1) / 2
if (next < 0) break
edges.add(i to vertices)
vertices++
deg++
k = next
}
}
var last = 0
while (k > 0) {
edges.add(last to vertices)
vertices++
last = vertices
k--
}
if (k != 0) error("" + k)
val sb = StringBuilder("$vertices ${edges.size}")
for ((a, b) in edges) {
sb.append("\n${a + 1} ${b + 1}")
}
return sb.toString()
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round3/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class facebook.y2020.round3.AKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #10 // Method readInt:()I\n 3... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round2/b.kt | package facebook.y2020.round2
private fun solve(): DoubleArray {
val s = readStrings()
val n = s[0].toInt()
val p = s[1].toDouble()
var a = DoubleArray(2) { 1.0 }
for (m in 3..n) {
val pairs = m * (m - 1L) / 2
val b = DoubleArray(m) { i ->
val smaller = a.getOrElse(i - 1) { 0.0 }
val same = a.getOrElse(i) { 0.0 }
val r = 1 + (
(i * (i - 1L) / 2) * smaller +
(i) * (p * smaller) +
(m - 1 - i) * ((1 - p) * same) +
(i * (m - 1L - i)) * (p * smaller + (1 - p) * same) +
(m - 1L - i) * (m - 2L - i) / 2 * same
) / pairs
r
}
a = b
}
return a
}
fun main() = repeat(readInt()) { println("Case #${it + 1}:\n${solve().joinToString("\n")}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round2/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class facebook.y2020.round2.BKt {\n private static final double[] solve();\n Code:\n 0: invokestatic #10 // Method readStrings:()Ljava/util/List... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round2/c.kt | package facebook.y2020.round2
import java.util.*
private fun solve(MOD: Int = 1_000_000_007, maxWeight: Int = 1_000_000_000): Int {
val (n, m, events, k) = readInts()
val edges = n * m + n
val (x, y, ids, weights) = listOf(m to n, m to n, edges to events, maxWeight to events).map { (modulo, length) ->
val array = readInts().toIntArray() + IntArray(length - k) { 0 }
val (a, b, c) = readInts()
for (i in k until length) {
array[i] = ((a.toLong() * array[i - 2] + b.toLong() * array[i - 1] + c) % modulo).toInt()
}
array
}
val (short, long) = List(2) { List(n) { TreeSet<Long>() } }
val main = TreeSet<Long>()
val alter = LongArray(n) { -1L }
val selected = LongArray(n) { -1L }
fun isShort(cycle: Int, j: Int): Boolean {
return x[cycle] <= j && j < y[cycle]
}
for (cycle in x.indices) {
val (min, max) = listOf(x[cycle], y[cycle]).sorted()
x[cycle] = min; y[cycle] = max
for (j in 0 until m) {
val id = cycle * m + j
if (isShort(cycle, j)) {
short[cycle].add(1L * edges + id)
} else {
long[cycle].add(1L * edges + id)
}
}
if (short[cycle].isNotEmpty()) {
alter[cycle] = short[cycle].last()
main.add(alter[cycle])
}
selected[cycle] = long[cycle].last()
main.add(1L * edges + n * m + cycle)
}
var ans = 1
val w = IntArray(edges) { 1 }
var sum = edges.toLong()
var removed = (n + 1).toLong()
for (event in ids.indices) {
val id = ids[event]
val oldWeight = w[id]
val newWeight = weights[event]
removed -= main.last() / edges
if (id < n * m) {
val cycle = id / m
val j = id % m
val set = if (isShort(cycle, j)) short[cycle] else long[cycle]
if (!set.remove(oldWeight.toLong() * edges + id)) error("")
set.add(newWeight.toLong() * edges + id)
val alt = alter[cycle]
val sel = selected[cycle]
removed -= sel / edges
if (alt != -1L) {
if (!main.remove(alt)) error("")
val a1 = short[cycle].last()
val a2 = long[cycle].last()
alter[cycle] = minOf(a1, a2)
main.add(alter[cycle])
selected[cycle] = maxOf(a1, a2)
} else {
selected[cycle] = long[cycle].last()
}
removed += selected[cycle] / edges
} else {
main.remove(oldWeight.toLong() * edges + id)
main.add(newWeight.toLong() * edges + id)
}
removed += main.last() / edges
sum += newWeight - oldWeight
w[id] = newWeight
ans = ((ans * ((sum - removed) % MOD)) % MOD).toInt()
}
return ans
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round2/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class facebook.y2020.round2.CKt {\n private static final int solve(int, int);\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round2/a.kt | package facebook.y2020.round2
private fun solve(): Long {
val (n, k) = readInts()
val (s, x, y) = List(3) {
val array = readInts().toIntArray() + IntArray(n - k) { 0 }
val (a, b, c, d) = readInts()
for (i in k until n) {
array[i] = ((a.toLong() * array[i - 2] + b.toLong() * array[i - 1] + c) % d).toInt()
}
array
}
var up = 0L
var down = 0L
var canUp = 0L
var canDown = 0L
for (i in s.indices) {
if (s[i] < x[i]) up += x[i] - s[i]
canUp += maxOf(0, x[i] + y[i] - s[i])
if (s[i] > x[i] + y[i]) down += s[i] - x[i] - y[i]
canDown += maxOf(0, s[i] - x[i])
}
if (up > canDown || down > canUp) return -1L
return maxOf(up, down)
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round2/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class facebook.y2020.round2.AKt {\n private static final long solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round1/b.kt | package facebook.y2020.round1
private fun solve(): Int {
val (n, m, k, _) = readInts()
val (p, q) = listOf(n, m).map { size -> readInts().toMutableList().also { list ->
val (a, b, c, d) = readInts()
for (i in k until size) {
list.add(((a.toLong() * list[i - 2] + b.toLong() * list[i - 1] + c) % d + 1).toInt())
}
}.sorted() }
var (low, high) = 0 to (p[0] - q[0]).abs() + q.last() - q[0]
while (low + 1 < high) {
val time = (low + high) / 2
var i = 0
for (x in p) {
val extraTime = (time - (x - q[i]).abs()).takeIf { it >= 0 } ?: continue
val y = maxOf(q[i] + extraTime, x + extraTime / 2)
while (i < m && q[i] <= y) i++
if (i == m) break
}
if (i == m) high = time else low = time
}
return high
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun Int.abs() = kotlin.math.abs(this)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round1/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class facebook.y2020.round1.BKt {\n private static final int solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n ... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round1/a2.kt | package facebook.y2020.round1
import java.util.*
private fun solve(M: Int = 1_000_000_007): Int {
val (n, k) = readInts()
val (L, w, h) = List(3) { readInts().toMutableList().also { list ->
val (a, b, c, d) = readInts()
for (i in k until n) {
list.add(((a.toLong() * list[i - 2] + b.toLong() * list[i - 1] + c) % d + 1).toInt())
}
}}
data class Group(val xFrom: Int, val xTo: Int, val vertical: Long)
fun perimeter(g: Group): Long = 2 * (g.xTo - g.xFrom) + g.vertical
val groups = TreeMap<Int, Group>()
var ans = 1
var perimeter = 0L
for (i in h.indices) {
var new = Group(L[i], L[i] + w[i], 2L * h[i])
while (true) {
var g = groups.floorEntry(new.xFrom)?.value
if (g == null || g.xTo < new.xFrom) g = groups.ceilingEntry(new.xFrom)?.value
if (g != null && g.xFrom > new.xTo) g = null
if (g != null && new.xFrom > g.xTo) g = null
if (g == null) break
perimeter -= perimeter(g)
groups.remove(g.xFrom)
new = Group(minOf(g.xFrom, new.xFrom), maxOf(g.xTo, new.xTo), g.vertical + new.vertical - 2 * h[i])
}
groups[new.xFrom] = new
perimeter += perimeter(new)
ans = ((ans.toLong() * (perimeter % M)) % M).toInt()
}
return ans
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round1/A2Kt.class",
"javap": "Compiled from \"a2.kt\"\npublic final class facebook.y2020.round1.A2Kt {\n private static final int solve(int);\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\... |
mikhail-dvorkin__competitions__3095312/facebook/y2020/round1/a1.kt | package facebook.y2020.round1
private fun solve(M: Int = 1_000_000_007): Int {
val (n, k, w) = readInts()
val (L, h) = List(2) { readInts().toMutableList().also { list ->
val (a, b, c, d) = readInts()
for (i in k until n) {
list.add(((a.toLong() * list[i - 2] + b.toLong() * list[i - 1] + c) % d + 1).toInt())
}
}}
var ans = 1
var perimeter = 0L
val height = mutableMapOf<Int, Int>()
fun perimeter(xMax: Int): Long {
var res = 0L
for (x in xMax - w - 1 .. xMax) {
val y = height.getOrDefault(x, 0)
val yLeft = height.getOrDefault(x - 1, 0)
if (y > 0) res += 2
res += (y - yLeft).abs()
}
return res
}
for (i in h.indices) {
val xMax = L[i] + w
perimeter -= perimeter(xMax)
for (x in L[i] until xMax) {
height[x] = maxOf(height.getOrDefault(x, 0), h[i])
}
perimeter += perimeter(xMax)
ans = ((ans.toLong() * (perimeter % M)) % M).toInt()
}
return ans
}
fun main() = repeat(readInt()) { println("Case #${it + 1}: ${solve()}") }
private fun Int.abs() = kotlin.math.abs(this)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/facebook/y2020/round1/A1Kt.class",
"javap": "Compiled from \"a1.kt\"\npublic final class facebook.y2020.round1.A1Kt {\n private static final int solve(int);\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\... |
mikhail-dvorkin__competitions__3095312/atcoder/agc044/b.kt | package atcoder.agc044
fun main() {
val n = readInt()
val p = readInts().map { it - 1 }
val dist = List(n) { x -> IntArray(n) { y -> sequenceOf(x, y, n - 1 - x, n - 1 - y).minOrNull()!! + 1 } }
val on = List(n) { x -> BooleanArray(n) { true } }
var ans = 0
val stack = IntArray(n * n)
for (r in p) {
val rx = r / n
val ry = r % n
ans += dist[rx][ry] - 1
on[rx][ry] = false
dist[rx][ry]--
stack[0] = r
var stackSize = 1
while (stackSize > 0) {
val xy = stack[--stackSize]
val x = xy / n
val y = xy % n
val distHere = dist[x][y]
for (d in DX.indices) {
val xx = x + DX[d]
val yy = y + DY[d]
val onNei = on.getOrNull(xx)?.getOrNull(yy) ?: continue
val distNei = dist[xx][yy]
val distNew = distHere + if (onNei) 1 else 0
if (distNew < distNei) {
dist[xx][yy]--
stack[stackSize++] = xx * n + yy
}
}
}
}
println(ans)
}
val DX = intArrayOf(1, 0, -1, 0)
val DY = intArrayOf(0, 1, 0, -1)
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/agc044/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class atcoder.agc044.BKt {\n private static final int[] DX;\n\n private static final int[] DY;\n\n public static final void main();\n Code:\n 0: invokestatic #10 ... |
mikhail-dvorkin__competitions__3095312/atcoder/agc043/d_wrong.kt | package atcoder.agc043
fun main() {
// val (n, m) = readInts()
val memo = HashMap<Long, Int>()
fun solve(x: Int, y: Int, z: Int): Int {
if (z == 0 && y == x - 1) return 1
if (y < 0 || y >= x || z >= x) return 0
val code = (x.toLong() shl 42) + (y.toLong() shl 21) + z
if (memo.containsKey(code)) return memo[code]!!
var res = 0
for (xx in 0 until x) {
res += solve(xx, y - (x - xx - 1), z)
}
if (z > 0) {
if (z == 1 && x - 1 - y <= 2) {
res += c(x - 1, x - 1 - y)
}
for (xx in 0 until x) {
for (r1 in 0..2) {
if (r1 > x - xx - 1) break
for (r2 in 0..2 - r1) {
if (r2 >= xx) break
if (r1 + r2 == 0) continue
res += solve(xx, y - (x - xx - 1 - r1) + r2, z - 1) * c(x - xx - 1, r1) * c(xx - 1, r2)
}
}
}
}
memo[code] = res
return res
}
fun solve(n: Int) = (0..n).sumBy { solve(3 * n, 0, it) }
println(solve(1))
println(solve(2))
}
private fun c(n: Int, k: Int): Int {
return when (k) {
0 -> 1
1 -> n
2 -> n * (n - 1) / 2
else -> error("")
}
}
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/agc043/D_wrongKt.class",
"javap": "Compiled from \"d_wrong.kt\"\npublic final class atcoder.agc043.D_wrongKt {\n public static final void main();\n Code:\n 0: new #8 // class java/util/HashMap\n 3: dup... |
mikhail-dvorkin__competitions__3095312/atcoder/arc155/c.kt | package atcoder.arc155
private fun solve(a: List<Int>, b: List<Int>): Boolean {
if (a.sorted() != b.sorted()) return false
val aIsOmnipotent = isOmnipotent(a)
val bIsOmnipotent = isOmnipotent(b)
val aEven = mutableListOf<Int>()
val bEven = mutableListOf<Int>()
fun canSortEven(): Boolean {
return (aEven.size >= 3 && aEven.sorted() == bEven.sorted()) || aEven == bEven
}
if (aIsOmnipotent && bIsOmnipotent) {
aEven.addAll(a.filter { it % 2 == 0 })
bEven.addAll(b.filter { it % 2 == 0 })
return canSortEven()
}
if (aIsOmnipotent xor bIsOmnipotent) return false
for (i in a.indices) {
if (a[i] % 2 != 0) {
if (b[i] != a[i]) return false
if (!canSortEven()) return false
aEven.clear(); bEven.clear()
continue
}
if (b[i] % 2 != 0) return false
aEven.add(a[i]); bEven.add(b[i])
}
if (!canSortEven()) return false
return true
}
private fun isOmnipotent(a: List<Int>): Boolean {
for (i in 0..a.size - 3) {
if ((a[i] + a[i + 1] + a[i + 2]) % 2 == 0 && (a[i] % 2 != 0 || a[i + 1] % 2 != 0 || a[i + 2] % 2 != 0))
return true
}
return false
}
fun main() {
readInt()
val a = readInts()
val b = readInts()
println(solve(a, b).iif("Yes", "No"))
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
private fun <T> Boolean.iif(onTrue: T, onFalse: T) = if (this) onTrue else onFalse
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc155/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class atcoder.arc155.CKt {\n private static final boolean solve(java.util.List<java.lang.Integer>, java.util.List<java.lang.Integer>);\n Code:\n 0: aload_0\n 1: c... |
mikhail-dvorkin__competitions__3095312/atcoder/arc155/a.kt | package atcoder.arc155
private fun solve(): Boolean {
val (_, qIn) = readLongs()
val s = readLn()
val q = minOf(qIn % (2 * s.length) + 4 * s.length, qIn).toInt()
val c = (s + " ".repeat(q)).toCharArray()
val mark = BooleanArray(c.size) { false }
var answer = true
val queue = IntArray(c.size)
for (i in c.indices) {
if (mark[i]) continue
if (c[i] == ' ') c[i] = 'a'
var low = 0
var high = 1
queue[0] = i
mark[i] = true
while (low < high) {
val v = queue[low++]
val u = c.size - 1 - v
if (c[u] == ' ') c[u] = c[v]
if (c[u] != c[v]) answer = false
if (!mark[u]) {
queue[high++] = u
mark[u] = true
}
val u1 = (v + c.size - s.length) % c.size
val u2 = c.size - 1 - u1
val uu = (u2 + s.length) % c.size
if (c[uu] == ' ') c[uu] = c[v]
if (c[uu] != c[v]) answer = false
if (!mark[uu]) {
queue[high++] = uu
mark[uu] = true
}
}
}
return answer
}
fun main() = repeat(readInt()) { println(solve().iif("Yes", "No")) }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readLongs() = readStrings().map { it.toLong() }
private fun <T> Boolean.iif(onTrue: T, onFalse: T) = if (this) onTrue else onFalse
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc155/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class atcoder.arc155.AKt {\n private static final boolean solve();\n Code:\n 0: invokestatic #10 // Method readLongs:()Ljava/util/List;\n 3: icon... |
mikhail-dvorkin__competitions__3095312/atcoder/arc154/c.kt | package atcoder.arc154
private fun solve(): Boolean {
val (_, a, b) = List(3) { readInts() }
if (a == b) return true
if (b.toSet().size == 1) return b[0] in a
val want = b.filterIndexed { i, it -> it != b.getCycled(i + 1) }
if (want.size == b.size) return false
for (aShifted in a.allShifts()) {
var k = 0
for (x in aShifted) if (want[k] == x) if (++k == want.size) return true
}
return false
}
fun main() = repeat(readInt()) { println(solve().iif("Yes", "No")) }
private fun <T> List<T>.getCycled(index: Int) = getOrElse(index) { get(if (index >= 0) index % size else lastIndex - index.inv() % size) }
private fun <T> List<T>.shifted(shift: Int) = drop(shift) + take(shift)
private fun <T> List<T>.allShifts() = List(size) { shifted(it) }
private fun <T> Boolean.iif(onTrue: T, onFalse: T) = if (this) onTrue else onFalse
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc154/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class atcoder.arc154.CKt {\n private static final boolean solve();\n Code:\n 0: iconst_3\n 1: istore_1\n 2: new #8 // class java/... |
mikhail-dvorkin__competitions__3095312/atcoder/arc154/d.kt | package atcoder.arc154
import kotlin.random.Random
fun main() {
val n = readInt()
val random = Random(566)
val shuffle = (0 until n).shuffled(random)
val memo = mutableMapOf<Triple<Int, Int, Int>, Boolean>()
// p[i] + p[j] > p[k]
fun ask(i: Int, j: Int, k: Int): Boolean {
if (i > j) return ask(j, i, k)
return memo.getOrPut(Triple(i, j, k)) {
println("? ${shuffle[i] + 1} ${shuffle[j] + 1} ${shuffle[k] + 1}")
readLn()[0] == 'Y'
}
}
var one = 0
// 2p[i] <= p[one]
for (i in 1 until n) if (!ask(i, i, one)) one = i
val a = IntArray(n) { it }
a[0] = one; a[one] = 0
val mergeSortTemp = IntArray(n)
fun sort(from: Int, to: Int) {
val partSize = to - from
if (partSize <= 1) return
val mid = (from + to) / 2
sort(from, mid); sort(mid, to)
var i = from; var j = mid
for (k in 0 until partSize) mergeSortTemp[k] = a[
if (i < mid && (j == to || !ask(a[i], one, a[j]))) i++ else j++
]
System.arraycopy(mergeSortTemp, 0, a, from, partSize)
}
sort(1, n)
val ans = IntArray(n)
for (i in a.indices) {
ans[shuffle[a[i]]] = i + 1
}
println("! ${ans.joinToString(" ")}")
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc154/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class atcoder.arc154.DKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readInt:()I\n 3: istore_0\n 4: sipush... |
mikhail-dvorkin__competitions__3095312/atcoder/arc153/c.kt | package atcoder.arc153
private const val M = 1e12.toLong()
private fun solve(s: IntArray): LongArray? {
val n = s.size
val sSum = s.sum()
val a = LongArray(n) { it + 1L }
fun aSum() = a.indices.sumOf { i -> a[i] * s[i] }
if (sSum != 0) {
val x = M / 4
val delta = (-x - aSum()) / sSum
for (i in a.indices) a[i] += delta
a[n - 1] -= aSum()
return a
}
if (aSum() <= 0) {
a[n - 1] -= aSum()
return a
}
var sCum = 0
for (i in a.indices) {
sCum += s[i]
if (sCum > 0) {
val x = aSum() + 1
for (j in i + 1 until n) a[j] += x
a[n - 1] -= aSum()
return a
}
}
return null
}
fun main() {
readLn()
val s = readInts().toIntArray()
val ans = (if (s.last() == 1) solve(s) else solve(s.map { -it }.toIntArray()))
?: return println("No")
println("Yes")
println(ans.joinToString(" "))
}
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc153/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class atcoder.arc153.CKt {\n private static final long M;\n\n private static final long[] solve(int[]);\n Code:\n 0: aload_0\n 1: arraylength\n 2: istore_1... |
mikhail-dvorkin__competitions__3095312/atcoder/arc158/e_slow.kt | package atcoder.arc158
fun main() {
readLn()
val top = readInts()
val bottom = readInts()
val inf = Long.MAX_VALUE / 4
data class Score(val score: Long, val improve: Long)
fun solve(from: Int, to: Int): Modular1 {
if (from + 1 == to) {
return (top[from] + bottom[from]).toModular() * 3.toModularUnsafe()
}
val mid = (from + to) / 2
var result = solve(from, mid) + solve(mid, to)
val (scoresLeft, scoresRight) = List(2) { mode ->
var bestUpTop = 0L
var bestUpBottom = inf
var bestDownTop = inf
var bestDownBottom = 0L
val scores = mutableListOf<Score>()
val range = if (mode == 1) mid until to else mid - 1 downTo from
for (i in range) {
val newBestUpTop = minOf(bestUpTop, bestUpBottom + bottom[i]) + top[i]
val newBestUpBottom = minOf(bestUpBottom, bestUpTop + top[i]) + bottom[i]
val newBestDownTop = minOf(bestDownTop, bestDownBottom + bottom[i]) + top[i]
val newBestDownBottom = minOf(bestDownBottom, bestDownTop + top[i]) + bottom[i]
scores.add(Score(newBestUpTop, - newBestDownTop + newBestUpTop))
scores.add(Score(newBestUpBottom, - newBestDownBottom + newBestUpBottom))
bestUpTop = newBestUpTop; bestUpBottom = newBestUpBottom
bestDownTop = newBestDownTop; bestDownBottom = newBestDownBottom
}
scores.sortedBy { it.improve }
}
val s1 = scoresLeft.map { it.score.toModular() }.fold(0.toModularUnsafe(), Modular1::plus)
val s2 = scoresRight.map { it.score.toModular() }.fold(0.toModularUnsafe(), Modular1::plus)
var sc = s1 * (scoresRight.size).toModularUnsafe() + s2 * (scoresLeft.size).toModularUnsafe()
var j = scoresRight.size
var sumJ = 0.toModularUnsafe()
for (i in scoresLeft.indices) {
while (j >= 1 && scoresLeft[i].improve + scoresRight[j - 1].improve > 0) {
j--
sumJ += scoresRight[j].improve.toModular()
}
sc -= scoresLeft[i].improve.toModular() * (scoresRight.size - j).toModularUnsafe()
sc -= sumJ
}
result += sc * 2.toModularUnsafe()
return result
}
println(solve(0, top.size))
}
private val bufferedReader = java.io.BufferedReader(java.io.InputStreamReader(System.`in`))
private fun readLn() = bufferedReader.readLine()
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
private fun readLongs() = readStrings().map { it.toLong() }
private class Modular1(val x: Int) {
companion object {
const val M = 998244353; val MOD_BIG_INTEGER = M.toBigInteger()
}
inline operator fun plus(that: Modular1) = Modular1((x + that.x).let { if (it >= M) it - M else it })
inline operator fun minus(that: Modular1) = Modular1((x - that.x).let { if (it < 0) it + M else it })
inline operator fun times(that: Modular1) = Modular1((x.toLong() * that.x % M).toInt())
inline operator fun div(that: Modular1) = times(that.inverse())
inline fun inverse() = Modular1(x.toBigInteger().modInverse(MOD_BIG_INTEGER).toInt())
override fun toString() = x.toString()
}
private fun Int.toModularUnsafe() = Modular1(this)
private fun Int.toModular() = Modular1(if (this >= 0) { if (this < Modular1.M) this else this % Modular1.M } else { Modular1.M - 1 - inv() % Modular1.M })
private fun Long.toModular() = Modular1((if (this >= 0) { if (this < Modular1.M) this else this % Modular1.M } else { Modular1.M - 1 - inv() % Modular1.M }).toInt())
private fun java.math.BigInteger.toModular() = Modular1(mod(Modular1.MOD_BIG_INTEGER).toInt())
private fun String.toModular() = Modular1(fold(0L) { acc, c -> (c - '0' + 10 * acc) % Modular1.M }.toInt())
private class ModularArray1(val data: IntArray) {
operator fun get(index: Int) = data[index].toModularUnsafe()
operator fun set(index: Int, value: Modular1) { data[index] = value.x }
}
private inline fun ModularArray(n: Int, init: (Int) -> Modular1) = ModularArray1(IntArray(n) { init(it).x })
private val factorials = mutableListOf(1.toModularUnsafe())
private fun factorial(n: Int): Modular1 {
while (n >= factorials.size) factorials.add(factorials.last() * factorials.size.toModularUnsafe())
return factorials[n]
}
private fun cnk(n: Int, k: Int) = factorial(n) / factorial(k) / factorial(n - k)
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc158/E_slowKt.class",
"javap": "Compiled from \"e_slow.kt\"\npublic final class atcoder.arc158.E_slowKt {\n private static final java.io.BufferedReader bufferedReader;\n\n private static final java.util.List<atcoder.arc158.Modular1> factori... |
mikhail-dvorkin__competitions__3095312/atcoder/arc158/e.kt | package atcoder.arc158
fun main() {
readLn()
val top = readInts()
val bottom = readInts()
val inf = Long.MAX_VALUE / 4
fun solve(from: Int, to: Int): Modular {
if (from + 1 == to) {
return (top[from] + bottom[from]).toModular() * 3.toModularUnsafe()
}
val mid = (from + to) / 2
var result = solve(from, mid) + solve(mid, to)
val (scoresLeft, scoresRight) = List(2) { mode ->
var bestUpTop = 0L
var bestUpBottom = inf
var bestDownTop = inf
var bestDownBottom = 0L
val range = if (mode == 1) mid until to else mid - 1 downTo from
val rSize = if (mode == 1) to - mid else mid - from
var scoresSum = 0.toModularUnsafe()
val improve = LongArray(rSize * 2)
var r = 0
for (i in range) {
val newBestUpTop = minOf(bestUpTop, bestUpBottom + bottom[i]) + top[i]
val newBestUpBottom = minOf(bestUpBottom, bestUpTop + top[i]) + bottom[i]
val newBestDownTop = minOf(bestDownTop, bestDownBottom + bottom[i]) + top[i]
val newBestDownBottom = minOf(bestDownBottom, bestDownTop + top[i]) + bottom[i]
scoresSum += (newBestUpTop + newBestUpBottom).toModular()
improve[r++] = - newBestDownTop + newBestUpTop
improve[r++] = - newBestDownBottom + newBestUpBottom
bestUpTop = newBestUpTop; bestUpBottom = newBestUpBottom
bestDownTop = newBestDownTop; bestDownBottom = newBestDownBottom
}
improve.sort()
scoresSum to improve
}
val s1 = scoresLeft.first
val s2 = scoresRight.first
val i1 = scoresLeft.second
val i2 = scoresRight.second
var sc = s1 * (i2.size).toModularUnsafe() + s2 * (i1.size).toModularUnsafe()
var j = i2.size
var sumJ = 0.toModularUnsafe()
for (i in i1.indices) {
while (j >= 1 && i1[i] + i2[j - 1] > 0) {
j--
sumJ += i2[j].toModular()
}
sc -= i1[i].toModular() * (i2.size - j).toModularUnsafe()
sc -= sumJ
}
result += sc * 2.toModularUnsafe()
return result
}
println(solve(0, top.size))
}
private val bufferedReader = java.io.BufferedReader(java.io.InputStreamReader(System.`in`))
private fun readLn() = bufferedReader.readLine()
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
private fun readLongs() = readStrings().map { it.toLong() }
private class Modular(val x: Int) {
companion object {
const val M = 998244353; val MOD_BIG_INTEGER = M.toBigInteger()
}
inline operator fun plus(that: Modular) = Modular((x + that.x).let { if (it >= M) it - M else it })
inline operator fun minus(that: Modular) = Modular((x - that.x).let { if (it < 0) it + M else it })
inline operator fun times(that: Modular) = Modular((x.toLong() * that.x % M).toInt())
inline operator fun div(that: Modular) = times(that.inverse())
inline fun inverse() = Modular(x.toBigInteger().modInverse(MOD_BIG_INTEGER).toInt())
override fun toString() = x.toString()
}
private fun Int.toModularUnsafe() = Modular(this)
private fun Int.toModular() = Modular(if (this >= 0) { if (this < Modular.M) this else this % Modular.M } else { Modular.M - 1 - inv() % Modular.M })
private fun Long.toModular() = Modular((if (this >= 0) { if (this < Modular.M) this else this % Modular.M } else { Modular.M - 1 - inv() % Modular.M }).toInt())
private fun java.math.BigInteger.toModular() = Modular(mod(Modular.MOD_BIG_INTEGER).toInt())
private fun String.toModular() = Modular(fold(0L) { acc, c -> (c - '0' + 10 * acc) % Modular.M }.toInt())
private class ModularArray(val data: IntArray) {
operator fun get(index: Int) = data[index].toModularUnsafe()
operator fun set(index: Int, value: Modular) { data[index] = value.x }
}
private inline fun ModularArray(n: Int, init: (Int) -> Modular) = ModularArray(IntArray(n) { init(it).x })
private val factorials = mutableListOf(1.toModularUnsafe())
private fun factorial(n: Int): Modular {
while (n >= factorials.size) factorials.add(factorials.last() * factorials.size.toModularUnsafe())
return factorials[n]
}
private fun cnk(n: Int, k: Int) = factorial(n) / factorial(k) / factorial(n - k)
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc158/EKt.class",
"javap": "Compiled from \"e.kt\"\npublic final class atcoder.arc158.EKt {\n private static final java.io.BufferedReader bufferedReader;\n\n private static final java.util.List<atcoder.arc158.Modular> factorials;\n\n public... |
mikhail-dvorkin__competitions__3095312/atcoder/arc156/b.kt | package atcoder.arc156
fun main() {
var (_, k) = readInts()
val a = readInts().toSet()
val f = (0..a.size).first { it !in a }
var ans = if (f > 0) take(k, f) else 0.toModularUnsafe()
for (x in f..Int.MAX_VALUE) {
ans += take(k - 1, x + 1)
if (x !in a && --k == 0) break
}
println(ans)
}
private fun take(n: Int, m: Int) = cnk(n + m - 1, n)
//typealias Modular = Double; fun Number.toModular() = toDouble(); fun Number.toModularUnsafe() = toDouble()
//typealias ModularArray = DoubleArray; val ModularArray.data; get() = this
@Suppress("NOTHING_TO_INLINE")
private class Modular(val x: Int) {
companion object {
const val M = 998244353; val MOD_BIG_INTEGER = M.toBigInteger()
}
inline operator fun plus(that: Modular) = Modular((x + that.x).let { if (it >= M) it - M else it })
inline operator fun minus(that: Modular) = Modular((x - that.x).let { if (it < 0) it + M else it })
inline operator fun times(that: Modular) = Modular((x.toLong() * that.x % M).toInt())
inline operator fun div(that: Modular) = times(that.inverse())
inline fun inverse() = Modular(x.toBigInteger().modInverse(MOD_BIG_INTEGER).toInt())
override fun toString() = x.toString()
}
private fun Int.toModularUnsafe() = Modular(this)
private fun Int.toModular() = Modular(if (this >= 0) { if (this < Modular.M) this else this % Modular.M } else { Modular.M - 1 - inv() % Modular.M })
private fun Long.toModular() = Modular((if (this >= 0) { if (this < Modular.M) this else this % Modular.M } else { Modular.M - 1 - inv() % Modular.M }).toInt())
private fun java.math.BigInteger.toModular() = Modular(mod(Modular.MOD_BIG_INTEGER).toInt())
private fun String.toModular() = Modular(fold(0L) { acc, c -> (c - '0' + 10 * acc) % Modular.M }.toInt())
private class ModularArray(val data: IntArray) {
operator fun get(index: Int) = data[index].toModularUnsafe()
operator fun set(index: Int, value: Modular) { data[index] = value.x }
}
private inline fun ModularArray(n: Int, init: (Int) -> Modular) = ModularArray(IntArray(n) { init(it).x })
private val factorials = mutableListOf(1.toModularUnsafe())
private fun factorial(n: Int): Modular {
while (n >= factorials.size) factorials.add(factorials.last() * factorials.size.toModularUnsafe())
return factorials[n]
}
private fun cnk(n: Int, k: Int) = factorial(n) / factorial(k) / factorial(n - k)
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc156/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class atcoder.arc156.BKt {\n private static final java.util.List<atcoder.arc156.Modular> factorials;\n\n public static final void main();\n Code:\n 0: invokestatic #1... |
mikhail-dvorkin__competitions__3095312/atcoder/arc156/c_research.kt | package atcoder.arc156
import kotlin.random.Random
fun main() {
val n = readInt()
val nei = List(n) { mutableListOf<Int>() }
repeat(n - 1) {
val (u, v) = readInts().map { it - 1 }
nei[u].add(v); nei[v].add(u)
}
val r = Random(566)
val byDegree = nei.indices.sortedBy { nei[it].size }
val p = IntArray(n)
for (i in nei.indices) {
p[byDegree[i]] = byDegree[n - 1 - i]
}
while (true) {
var perfect = true
for (v in nei.indices) {
for (u in nei[v]) if (u < v) {
val vv = p[v]
val uu = p[u]
if (uu in nei[vv]) {
if (v == uu && u == vv) continue
perfect = false
var w: Int
while (true) {
w = r.nextInt(n)
if (w != v && w != u) break
}
val temp = p[v]; p[v] = p[u]; p[u] = p[w]; p[w] = temp
}
}
}
if (perfect) break
}
println(p.map { it + 1 }.joinToString(" "))
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc156/C_researchKt$main$$inlined$sortedBy$1.class",
"javap": "Compiled from \"Comparisons.kt\"\npublic final class atcoder.arc156.C_researchKt$main$$inlined$sortedBy$1<T> implements java.util.Comparator {\n final java.util.List $nei$inlined;\... |
mikhail-dvorkin__competitions__3095312/atcoder/arc159/c.kt | package atcoder.arc159
fun main() {
readInt()
val a = readInts().toIntArray()
val ans = mutableListOf<IntArray>()
fun apply(p: IntArray) {
for (i in a.indices) a[i] += p[i]
ans.add(p)
}
var sumOk = false
for (j in a.indices) {
if (a.sum() % a.size == 0) {
sumOk = true
break
}
val b = a.indices.sortedBy { a[it] }
val p = IntArray(a.size)
for (i in a.indices) p[b[i]] = a.size - 1 - i
apply(p)
}
if (!sumOk) return println("No")
println("Yes")
while (true) {
val delta = a.sum() / a.size
for (i in a.indices) a[i] -= delta
val x = a.indexOf(a.max()!!)
if (a[x] == 0) break
val y = a.indexOf(a.min()!!)
val k = minOf(a[x], -a[y], a.size - 1)
val p = IntArray(a.size) { -1 }
p[y] = 0
p[x] = k
var t = 1
for (i in p.indices) {
if (p[i] >= 0) continue
if (t == k) t++
p[i] = t++
}
val q = IntArray(a.size) { a.size - 1 - p[it] }
p[y] = k
p[x] = 0
apply(q)
apply(p)
}
println(ans.size)
println(ans.joinToString("\n") { p -> p.joinToString(" ") { (it + 1).toString() } })
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc159/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class atcoder.arc159.CKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readInt:()I\n 3: pop\n 4: invokestati... |
mikhail-dvorkin__competitions__3095312/atcoder/arc128/d.kt | package atcoder.arc128
fun main() {
readLn()
val a = readInts()
val cumSum = mutableListOf(0.toModular())
fun sum(from: Int, to: Int) = cumSum[maxOf(to, from)] - cumSum[from]
var same = 0
var diff = 0
var ans = 1.toModular()
for (i in a.indices) {
if (i < 2 || a[i] != a[i - 2]) diff = i
if (i < 1 || a[i] == a[i - 1]) {
same = i
} else {
ans = sum(same, i) - sum(maxOf(diff - 1, same), i - 2)
}
cumSum.add(cumSum.last() + ans)
}
println(ans)
}
private fun Int.toModular() = Modular(this)
private class Modular {
companion object {
const val M = 998244353
}
val x: Int
@Suppress("ConvertSecondaryConstructorToPrimary")
constructor(value: Int) { x = (value % M).let { if (it < 0) it + M else it } }
operator fun plus(that: Modular) = Modular((x + that.x) % M)
operator fun minus(that: Modular) = Modular((x + M - that.x) % M)
operator fun times(that: Modular) = (x.toLong() * that.x % M).toInt().toModular()
private fun modInverse() = Modular(x.toBigInteger().modInverse(M.toBigInteger()).toInt())
operator fun div(that: Modular) = times(that.modInverse())
override fun toString() = x.toString()
}
private operator fun Int.plus(that: Modular) = Modular(this) + that
private operator fun Int.minus(that: Modular) = Modular(this) - that
private operator fun Int.times(that: Modular) = Modular(this) * that
private operator fun Int.div(that: Modular) = Modular(this) / that
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/atcoder/arc128/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class atcoder.arc128.DKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readLn:()Ljava/lang/String;\n 3: pop\n ... |
mikhail-dvorkin__competitions__3095312/yandex/y2022/qual/d.kt | package yandex.y2022.qual
import kotlin.random.Random
fun main() {
val (n, _) = readInts()
val s = List(n) { readLn().map { "ACGT".indexOf(it) }.toIntArray() }
.let { it.plus(IntArray(it[0].size)) }
data class Edge(val u: Int, val v: Int, val len: Int)
val edges = mutableListOf<Edge>()
for (i in s.indices) for (j in 0 until i) {
val len = s[i].indices.sumOf { k -> dist(s[i][k], s[j][k]) }
edges.add(Edge(i, j, len))
}
val dsu = DisjointSetUnion(s.size)
var ans = 0
for (edge in edges.sortedBy { it.len }) {
if (dsu.unite(edge.u, edge.v)) ans += edge.len
}
println(ans)
}
private fun dist(x: Int, y: Int): Int {
if (x == y) return 0
if (x xor y == 2) return 2
return 1
}
private class DisjointSetUnion(n: Int) {
var p: IntArray
var r: Random = Random(566)
init {
p = IntArray(n)
clear()
}
fun clear() {
for (i in p.indices) {
p[i] = i
}
}
operator fun get(v: Int): Int {
if (p[v] == v) {
return v
}
p[v] = get(p[v])
return p[v]
}
fun unite(v: Int, u: Int): Boolean {
val vv = get(v)
val uu = get(u)
if (vv == uu) return false
if (r.nextBoolean()) {
p[vv] = uu
} else {
p[uu] = vv
}
return true
}
}
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2022/qual/DKt$main$Edge.class",
"javap": "Compiled from \"d.kt\"\npublic final class yandex.y2022.qual.DKt$main$Edge {\n private final int u;\n\n private final int v;\n\n private final int len;\n\n public yandex.y2022.qual.DKt$main$Edge(int... |
mikhail-dvorkin__competitions__3095312/yandex/y2022/qual/e.kt | package yandex.y2022.qual
import kotlin.random.Random
fun main() {
val (n, q) = readInts()
val dsu = DisjointSetUnionRPS(n)
val three = IntArray(n + 1)
three[0] = 1
for (i in 1 until three.size) three[i] = (3 * three[i - 1].toModular()).x
repeat(q) {
val (uIn, vIn, resultIn) = readStrings()
val u = uIn.toInt() - 1
val v = vIn.toInt() - 1
val result = "LDW".indexOf(resultIn) - 1
dsu.unite(u, v, result)
println(if (dsu.broken) 0 else three[dsu.degrees])
}
}
private class DisjointSetUnionRPS(n: Int) {
val p: IntArray
val diffP: IntArray
val r: Random = Random(566)
var broken: Boolean
var degrees: Int
init {
p = IntArray(n)
for (i in p.indices) {
p[i] = i
}
diffP = IntArray(n)
broken = false
degrees = n
}
operator fun get(v: Int): Pair<Int, Int> {
if (p[v] == v) return v to 0
val (r, diffR) = get(p[v])
p[v] = r
diffP[v] += diffR
return p[v] to diffP[v]
}
fun unite(u: Int, v: Int, d: Int) {
val (uu, diffU) = get(u)
val (vv, diffV) = get(v)
if (vv == uu) {
if ((diffU - diffV - d) % 3 != 0) broken = true
return
}
degrees--
if (r.nextBoolean()) {
p[vv] = uu
diffP[vv] = diffU - diffV - d
} else {
p[uu] = vv
diffP[uu] = diffV - diffU + d
}
}
}
private fun Int.toModular() = Modular(this)//toDouble()
private class Modular {
companion object {
const val M = 1_000_000_007
}
val x: Int
@Suppress("ConvertSecondaryConstructorToPrimary")
constructor(value: Int) { x = (value % M).let { if (it < 0) it + M else it } }
operator fun plus(that: Modular) = Modular((x + that.x) % M)
operator fun minus(that: Modular) = Modular((x + M - that.x) % M)
operator fun times(that: Modular) = (x.toLong() * that.x % M).toInt().toModular()
private fun modInverse() = Modular(x.toBigInteger().modInverse(M.toBigInteger()).toInt())
operator fun div(that: Modular) = times(that.modInverse())
override fun toString() = x.toString()
}
private operator fun Int.plus(that: Modular) = Modular(this) + that
private operator fun Int.minus(that: Modular) = Modular(this) - that
private operator fun Int.times(that: Modular) = Modular(this) * that
private operator fun Int.div(that: Modular) = Modular(this) / that
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2022/qual/EKt.class",
"javap": "Compiled from \"e.kt\"\npublic final class yandex.y2022.qual.EKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n 3: asto... |
mikhail-dvorkin__competitions__3095312/yandex/y2022/finals/c.kt | package yandex.y2022.finals
fun main() {
val (a, m) = readLongs()
val ps = mutableListOf<Long>()
var b = a
for (p in 2..b) {
if (b == 1L) break
if (p * p > b) {
ps.add(b)
break
}
if (b % p != 0L) continue
ps.add(p)
while (b % p == 0L) b /= p
}
var ans = Long.MAX_VALUE
for (r in 0..2) {
if ((r != 0) and (3 in ps)) continue
var cur = 1L
for (p in ps) {
b = a
var k = 0L
while (b % p == 0L) {
b /= p
k++
}
k *= m
if (p == 3L) {
cur = maxOf(cur, searchUsual(k, 3))
continue
}
if (r == 0) {
cur = maxOf(cur, 3 * searchUsual(k, p))
continue
}
cur = maxOf(cur, searchUnusual(k, p, r))
}
ans = minOf(ans, cur)
}
println(ans)
}
fun searchUsual(m: Long, p: Long): Long {
var low = 0L
var high = p * m
while (low + 1 < high) {
val mid = low + (high - low) / 2
var x = mid / p
var count = 0L
while (x > 0) {
count += x
x /= p
}
if (count >= m) high = mid else low = mid
}
return high
}
fun searchUnusual(m: Long, p: Long, r: Int): Long {
var low = 0L
var high = m * p
while (low + 1 < high) {
val mid = low + (high - low) / 2
var t = p
var count = 0L
while (t <= 3 * mid + r) {
val f = (if ((t % 3).toInt() == r) t else 2 * t) / 3
if (mid >= f) {
count += (mid - f) / t + 1
}
// if (t * 3 > 3 * mid + r) break
if (t >= mid + 1) break
t *= p
}
if (count >= m) high = mid else low = mid
}
return 3 * high + r
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
private fun readLongs() = readStrings().map { it.toLong() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2022/finals/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class yandex.y2022.finals.CKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readLongs:()Ljava/util/List;\n 3:... |
mikhail-dvorkin__competitions__3095312/yandex/y2022/finals/a_small.kt | package yandex.y2022.finals
import java.util.*
import kotlin.math.sign
fun main() {
readLn()
val our = readInts()
val their = readInts()
val e = List(our.size) { i -> IntArray(their.size) { j -> -(our[i] - their[j]).sign } }
val h = hungarian(e)
println(-h)
}
fun hungarian(e: List<IntArray>): Int {
val ans = IntArray(e.size)
Arrays.fill(ans, -1)
val infty = Int.MAX_VALUE / 3
var swap = false
val n1 = e.size
val n2 = e[0].size
val u = IntArray(n1 + 1)
val v = IntArray(n2 + 1)
val p = IntArray(n2 + 1)
val way = IntArray(n2 + 1)
for (i in 1..n1) {
p[0] = i
var j0 = 0
val minv = IntArray(n2 + 1)
Arrays.fill(minv, infty)
val used = BooleanArray(n2 + 1)
do {
used[j0] = true
val i0 = p[j0]
var j1 = 0
var delta = infty
for (j in 1..n2) {
if (!used[j]) {
val cur = e[i0 - 1][j - 1] - u[i0] - v[j]
if (cur < minv[j]) {
minv[j] = cur
way[j] = j0
}
if (minv[j] < delta) {
delta = minv[j]
j1 = j
}
}
}
for (j in 0..n2) {
if (used[j]) {
u[p[j]] += delta
v[j] -= delta
} else {
minv[j] -= delta
}
}
j0 = j1
} while (p[j0] != 0)
do {
val j1 = way[j0]
p[j0] = p[j1]
j0 = j1
} while (j0 > 0)
}
var sum = 0
for (j in 1..n2) {
if (p[j] > 0) {
// if (e[p[j] - 1][j - 1] >= infty) no matching of size n1;
sum += e[p[j] - 1][j - 1];
if (swap) {
ans[j - 1] = p[j] - 1
} else {
ans[p[j] - 1] = j - 1
}
}
}
return sum
}
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2022/finals/A_smallKt.class",
"javap": "Compiled from \"a_small.kt\"\npublic final class yandex.y2022.finals.A_smallKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readLn:()Ljava/lang/S... |
mikhail-dvorkin__competitions__3095312/yandex/y2023/qual/b.kt | package yandex.y2023.qual
private fun solve() {
val (n, m) = readInts()
val a = readInts()
val aSorted = a.sorted()
val y = aSorted[m - 1]
val yTake = aSorted.take(m).count { it == y }
val xDefinitely = a.indices.filter { a[it] < y }
val xY = a.indices.filter { a[it] == y }
val xLeft = xDefinitely.firstOrNull() ?: n
val xRight = xDefinitely.lastOrNull() ?: -1
val ans = (0..(xY.size - yTake)).minOf { i ->
val xYLeft = xY[i]
val xYRight = xY[i + yTake - 1]
maxOf(xYRight, xRight) - minOf(xYLeft, xLeft) + 1
}
println(ans)
}
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
fun main() = repeat(1) { solve() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2023/qual/BKt.class",
"javap": "Compiled from \"b.kt\"\npublic final class yandex.y2023.qual.BKt {\n private static final void solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n 3: as... |
mikhail-dvorkin__competitions__3095312/yandex/y2023/qual/d_wrong.kt | package yandex.y2023.qual
private fun solve() {
val (n, m) = readInts()
val nei = List(2) { List(n + 1) { mutableListOf<Pair<Int, Int>>() } }
repeat(m) {
val tokens = readStrings()
val a = tokens[0].toInt() - 1
val b = tokens[1].toInt()
val greater = (tokens[2][0] == '>').toInt()
val value = tokens[3].toInt()
nei[greater][b].add(a to value)
}
val news = MutableList(2) { IntArray(0) }
for (c in 1..n) {
for (greater in 0..1) {
val neutral = if (greater == 1) Int.MIN_VALUE else Int.MAX_VALUE
val op: Function2<Int, Int, Int> = if (greater == 1) ::maxOf else ::minOf
val new = IntArray(n) { neutral }
news[greater] = new
for ((b, value) in nei[greater][c]) {
new[b] = op(new[b], value)
for ((a, value2) in nei[greater][b]) {
new[a] = op(new[a], new[b] + value2)
}
}
nei[greater][c].clear()
for (b in 0 until c) if (new[b] != neutral) nei[greater][c].add(b to new[b])
}
for (b in 0 until c) if (news[0][b] < news[1][b]) {
return println("NO")
}
}
println("YES")
}
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
private fun Boolean.toInt() = if (this) 1 else 0
fun main() = repeat(1) { solve() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2023/qual/D_wrongKt.class",
"javap": "Compiled from \"d_wrong.kt\"\npublic final class yandex.y2023.qual.D_wrongKt {\n private static final void solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/L... |
mikhail-dvorkin__competitions__3095312/yandex/y2023/qual/d.kt | package yandex.y2023.qual
private fun solve(): String {
val (n, m) = readInts()
data class Edge(val from: Int, val to: Int, val weight: Int)
val edges = List(m) {
val tokens = readStrings()
val a = tokens[0].toInt() - 1
val b = tokens[1].toInt()
val greater = (tokens[2][0] == '>')
val value = tokens[3].toInt()
if (greater) Edge(a, b, -value) else Edge(b, a, value)
}
val p = LongArray(n + 1)
for (iter in 0..n) {
for (edge in edges) {
if (p[edge.to] > p[edge.from] + edge.weight) {
if (iter == n) return "NO"
p[edge.to] = p[edge.from] + edge.weight
}
}
}
return "YES"
}
private fun readStrings() = readln().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
fun main() = repeat(1) { println(solve()) }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2023/qual/DKt.class",
"javap": "Compiled from \"d.kt\"\npublic final class yandex.y2023.qual.DKt {\n private static final java.lang.String solve();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n... |
mikhail-dvorkin__competitions__3095312/yandex/y2021/qual/e.kt | package yandex.y2021.qual
fun main() {
val (hei, wid) = readInts()
val f = List(hei) { readLn().map { it - '0' } }
val countZero = f.sumOf { row -> row.count { it == 0 } }
val inf = hei * wid * 3
val a = List(wid + 1) { List(hei + 1) { IntArray(wid * hei + 1) { inf } } }
for (y in 0..hei) a[0][y][0] = 0
for (x in 0 until wid) {
val ones = IntArray(hei + 1)
for (y in 0 until hei) {
ones[y + 1] = ones[y] + f[y][x]
}
val prev = a[x]
val next = a[x + 1]
for (y in 0..hei) {
val prevY = prev[y]
val nextY = next[y]
val onesY = ones[y]
for (z in x * y..wid * hei - y) {
nextY[z + y] = minOf(nextY[z + y], prevY[z] + onesY)
}
}
for (y in hei - 1 downTo 0) {
val nextY = next[y]
val nextY1 = next[y + 1]
for (z in 0..wid * hei) {
nextY[z] = minOf(nextY[z], nextY1[z])
}
}
}
println(a[wid][0][countZero])
}
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2021/qual/EKt.class",
"javap": "Compiled from \"e.kt\"\npublic final class yandex.y2021.qual.EKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readInts:()Ljava/util/List;\n 3: asto... |
mikhail-dvorkin__competitions__3095312/yandex/y2020/qual/c.kt | package yandex.y2020.qual
private fun solve(): Boolean {
readLn()
val a = readInts().sorted()
readLn()
val b = readInts().sorted()
if (a.size != b.size) return false
if (a.isEmpty()) return true
val aSame = a.all { it == a[0] }
val bSame = b.all { it == b[0] }
if (aSame && bSame) return true
if (aSame || bSame) return false
return good(a, b) || good(a, b.reversed())
}
private fun good(a: List<Int>, b: List<Int>): Boolean {
return a.indices.all {
(a[it] - a.first()).toLong() * (b.last() - b.first()) ==
(b[it] - b.first()).toLong() * (a.last() - a.first())
}
}
fun main() = repeat(readInt()) { println(if (solve()) "YES" else "NO") }
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().filter { it.isNotEmpty() }.map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2020/qual/CKt.class",
"javap": "Compiled from \"c.kt\"\npublic final class yandex.y2020.qual.CKt {\n private static final boolean solve();\n Code:\n 0: invokestatic #10 // Method readLn:()Ljava/lang/String;\n 3:... |
mikhail-dvorkin__competitions__3095312/yandex/y2020/qual/a.kt | package yandex.y2020.qual
fun main() {
val s = readLn()
fun solve(s: String): Pair<Int, String>? {
if (s.length == 1) return 0 to s
if (s.length == 2) {
if (s[0] == s[1]) return null
return 0 to s
}
val (even, odd) = List(2) { s.filterIndexed { index, _ -> index % 2 == it } }
if (even.all { it == even[0] } && even[0] !in odd) {
val recursive = solve(odd) ?: return null
return recursive.first * 2 to even[0] + recursive.second
}
if (odd.all { it == odd[0] } && odd[0] !in even) {
val recursive = solve(even) ?: return null
return recursive.first * 2 + 1 to odd[0] + recursive.second
}
return null
}
val solution = solve(s) ?: return println("No solution")
println(solution.second + ('A'..'Z').filter { it !in solution.second }.joinToString(""))
println(solution.first + 1)
}
private fun readLn() = readLine()!!
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2020/qual/AKt.class",
"javap": "Compiled from \"a.kt\"\npublic final class yandex.y2020.qual.AKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readLn:()Ljava/lang/String;\n 3: asto... |
mikhail-dvorkin__competitions__3095312/yandex/y2020/qual/e.kt | package yandex.y2020.qual
import kotlin.random.Random
fun main() {
readLn()
var treap: PersistentTreap? = null
var ans = 0.toBigInteger()
val a = readInts()
println(a.mapIndexed { index, x ->
ans += (PersistentTreap.split(treap, (x + 1L) * a.size)[1]?.sum ?: 0).toBigInteger()
treap = PersistentTreap.add(treap, x.toLong() * a.size + index, x)
ans
}.joinToString(" "))
}
internal class PersistentTreap private constructor(val key: Long, val value: Int, val h: Int, val left: PersistentTreap?, val right: PersistentTreap?) {
val sum: Long
constructor(key: Long, value: Int, left: PersistentTreap?, right: PersistentTreap?) : this(key, value, r.nextInt(), left, right)
companion object {
var r = Random(566)
fun split(treap: PersistentTreap?, keySplit: Long): Array<PersistentTreap?> {
if (treap == null) return arrayOfNulls(2)
val split: Array<PersistentTreap?>
if (treap.key < keySplit) {
split = split(treap.right, keySplit)
split[0] = PersistentTreap(treap.key, treap.value, treap.h, treap.left, split[0])
} else {
split = split(treap.left, keySplit)
split[1] = PersistentTreap(treap.key, treap.value, treap.h, split[1], treap.right)
}
return split
}
fun merge(left: PersistentTreap?, right: PersistentTreap?): PersistentTreap? {
if (left == null) return right
if (right == null) return left
return if (left.h > right.h) {
PersistentTreap(left.key, left.value, left.h, left.left, merge(left.right, right))
} else PersistentTreap(right.key, right.value, right.h, merge(left, right.left), right.right)
}
fun add(treap: PersistentTreap?, key: Long, value: Int): PersistentTreap? {
val split = split(treap, key)
return merge(split[0], merge(PersistentTreap(key, value, null, null), split[1]))
}
}
init {
// calcMeta
var sum = 0L
if (left != null) {
sum = left.sum
}
sum += value
if (right != null) {
sum += right.sum
}
this.sum = sum
}
}
private fun readLn() = readLine()!!
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt() }
| [
{
"class_path": "mikhail-dvorkin__competitions__3095312/yandex/y2020/qual/EKt.class",
"javap": "Compiled from \"e.kt\"\npublic final class yandex.y2020.qual.EKt {\n public static final void main();\n Code:\n 0: invokestatic #10 // Method readLn:()Ljava/lang/String;\n 3: pop\... |
Juuxel__Basiks__411506c/src/main/kotlin/juuxel/basiks/iterable/CombinedIterable.kt | package juuxel.basiks.iterable
/**
* A combined iterable of types [A] and [B].
*
* @param outer the outer iterable of type [A]
* @param inner the inner iterable of type [B]
*/
private class CombinedIterable<A, B>(
private val outer: Iterable<A>,
private val inner: Iterable<B>
): Iterable<Pair<A, B>> {
override fun iterator() = outer.flatMap { i ->
inner.map { j ->
i to j
}
}.iterator()
}
/**
* Combines the two iterables.
*
* ### Example
* ```
* val letters = listOf('A', 'B', 'C')
* val numbers = listOf(1, 2, 3)
*
* for ((letter, number) in combine(letters, numbers))
* println("$letter + $number")
*
* Output:
* A: 1
* A: 2
* A: 3
* B: 1
* B: 2
* B: 3
* C: 1
* C: 2
* C: 3
* ```
*/
fun <A, B> combine(outer: Iterable<A>, inner: Iterable<B>): Iterable<Pair<A, B>> =
CombinedIterable(outer, inner)
inline fun <A, B, R> Iterable<Pair<A, B>>.map(transform: (A, B) -> R): List<R> =
map { (a, b) -> transform(a, b) }
inline fun <A, B, R> Iterable<Pair<A, B>>.flatMap(transform: (A, B) -> Iterable<R>): List<R> =
flatMap { (a, b) -> transform(a, b) }
| [
{
"class_path": "Juuxel__Basiks__411506c/juuxel/basiks/iterable/CombinedIterable.class",
"javap": "Compiled from \"CombinedIterable.kt\"\nfinal class juuxel.basiks.iterable.CombinedIterable<A, B> implements java.lang.Iterable<kotlin.Pair<? extends A, ? extends B>>, kotlin.jvm.internal.markers.KMappedMarker ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.