結果

問題 No.1097 Remainder Operation
ユーザー yakamoto
提出日時 2020-06-26 22:20:32
言語 Kotlin
(2.1.0)
結果
AC  
実行時間 811 ms / 2,000 ms
コード長 3,256 bytes
コンパイル時間 15,696 ms
コンパイル使用メモリ 461,020 KB
実行使用メモリ 91,068 KB
最終ジャッジ日時 2024-07-04 22:03:14
合計ジャッジ時間 28,721 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min
val MOD = 1_000_000_007L
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
fun solve() {
val N = ni()
val A = na(N)
val path = mutableListOf<Long>()
val thru = mutableSetOf<Long>()
path.add(0)
thru.add(0)
fun next(x: Long): Long {
val r = x % N
return x + A[r.toInt()]
}
while(!thru.contains(next(path.last()) % N)) {
val x = next(path.last())
path.add(x)
thru.add(x % N)
}
val n = path.size
val l = thru.indexOf(next(path.last()) % N)
val m = n - l
val d = next(path.last()) - path[l]
debug{path.toString()}
debug{"l:$l m:$m n:$n d:$d"}
if (isDebug) {
var x = path.last()
for (i in 0 until 10) {
debug{x.toString()}
x = next(x)
}
}
for (i in 0 until ni()) {
val k = nl()
if (k < n) {
out.println(path[k.toInt()])
} else {
out.println(path[((k - l) % m + l).toInt()] + (k - l) / m * d)
}
}
}
private val isDebug = try {
//
System.getenv("MY_DEBUG") != null
} catch (t: Throwable) {
false
}
private var tokenizer: StringTokenizer? = null
private val reader = BufferedReader(InputStreamReader(stream), 32768)
private fun next(): String {
while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
tokenizer = StringTokenizer(reader.readLine())
}
return tokenizer!!.nextToken()
}
private fun ni() = next().toInt()
private fun nl() = next().toLong()
private fun ns() = next()
private fun na(n: Int, offset: Int = 0): IntArray {
return map(n) { ni() + offset }
}
private fun nal(n: Int, offset: Int = 0): LongArray {
val res = LongArray(n)
for (i in 0 until n) {
res[i] = nl() + offset
}
return res
}
private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
val a = Array(2){IntArray(n)}
for (i in 0 until n) {
for (e in a) {
e[i] = ni() + offset
}
}
return a
}
private inline fun map(n: Int, f: (Int) -> Int): IntArray {
val res = IntArray(n)
for (i in 0 until n) {
res[i] = f(i)
}
return res
}
private inline fun debug(msg: () -> String) {
if (isDebug) System.err.println(msg())
}
private fun debug(a: LongArray) {
debug { a.joinToString(" ") }
}
private fun debug(a: IntArray) {
debug { a.joinToString(" ") }
}
private fun debug(a: BooleanArray) {
debug { a.map { if (it) 1 else 0 }.joinToString("") }
}
private fun debugDim(A: Array<LongArray>) {
if (isDebug) {
for (a in A) {
debug(a)
}
}
}
private fun debugDim(A: Array<IntArray>) {
if (isDebug) {
for (a in A) {
debug(a)
}
}
}
/**
* import
*/
private fun hoge() {
min(1, 2)
max(1, 2)
abs(-10)
}
}
fun main() {
val out = java.io.PrintWriter(System.out)
Solver(System.`in`, out).solve()
out.flush()
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0