Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Selfhack attempt for https://codeforces.com/contest/1323/submission/72639972
- @file:Suppress("NOTHING_TO_INLINE", "EXPERIMENTAL_FEATURE_WARNING", "OVERRIDE_BY_INLINE")
- import java.io.PrintWriter
- import java.util.StringTokenizer
- import kotlin.math.*
- import kotlin.random.Random
- import kotlin.collections.sort as _sort
- import kotlin.collections.sortDescending as _sortDescending
- import kotlin.io.println as iprintln
- /** @author Spheniscine */
- fun main() { _writer.solve(); _writer.flush() }
- fun PrintWriter.solve() {
- println("40000 40000 1396755360")
- val A = IntArray(40000)
- var i = 0
- var k = 1
- while(i < A.size) {
- val end = min(A.size, i + k)
- for(j in i until end) {
- A[j] = 1
- }
- i = end + 1
- k++
- }
- val ln = A.joinToString(" ")
- println(ln)
- println(ln)
- }
- /** IO code start */
- //@JvmField val INPUT = File("input.txt").inputStream()
- //@JvmField val OUTPUT = File("output.txt").outputStream()
- @JvmField val INPUT = System.`in`
- @JvmField val OUTPUT = System.out
- @JvmField val _reader = INPUT.bufferedReader()
- fun readLine(): String? = _reader.readLine()
- fun readLn() = _reader.readLine()!!
- @JvmField var _tokenizer: StringTokenizer = StringTokenizer("")
- fun read(): String {
- while (_tokenizer.hasMoreTokens().not()) _tokenizer = StringTokenizer(_reader.readLine() ?: return "", " ")
- return _tokenizer.nextToken()
- }
- fun readInt() = read().toInt()
- fun readDouble() = read().toDouble()
- fun readLong() = read().toLong()
- fun readStrings(n: Int) = List(n) { read() }
- fun readLines(n: Int) = List(n) { readLn() }
- fun readInts(n: Int) = List(n) { read().toInt() }
- fun readIntArray(n: Int) = IntArray(n) { read().toInt() }
- fun readDoubles(n: Int) = List(n) { read().toDouble() }
- fun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }
- fun readLongs(n: Int) = List(n) { read().toLong() }
- fun readLongArray(n: Int) = LongArray(n) { read().toLong() }
- @JvmField val _writer = PrintWriter(OUTPUT, false)
- /** shuffles and sort overrides to avoid quicksort attacks */
- private inline fun <T> _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {
- // Fisher-Yates shuffle algorithm
- for (i in size - 1 downTo 1) {
- val j = rnd.nextInt(i + 1)
- val temp = get(i)
- set(i, get(j))
- set(j, temp)
- }
- }
- @JvmField var _random: Random? = null
- val random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }
- fun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
- fun IntArray.sort() { shuffle(); _sort() }
- fun IntArray.sortDescending() { shuffle(); _sortDescending() }
- fun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
- fun LongArray.sort() { shuffle(); _sort() }
- fun LongArray.sortDescending() { shuffle(); _sortDescending() }
- fun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
- fun DoubleArray.sort() { shuffle(); _sort() }
- fun DoubleArray.sortDescending() { shuffle(); _sortDescending() }
- fun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
- inline fun CharArray.sort() { _sort() }
- inline fun CharArray.sortDescending() { _sortDescending() }
- inline fun <T: Comparable<T>> Array<out T>.sort() = _sort()
- inline fun <T: Comparable<T>> Array<out T>.sortDescending() = _sortDescending()
- inline fun <T: Comparable<T>> MutableList<out T>.sort() = _sort()
- inline fun <T: Comparable<T>> MutableList<out T>.sortDescending() = _sortDescending()
- fun `please stop removing these imports IntelliJ`() {
- iprintln(max(1, 2))
- }
Add Comment
Please, Sign In to add comment