結果
問題 | No.1097 Remainder Operation |
ユーザー | yakamoto |
提出日時 | 2020-06-26 22:20:32 |
言語 | Kotlin (1.9.23) |
結果 |
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 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 281 ms
56,636 KB |
testcase_01 | AC | 281 ms
56,808 KB |
testcase_02 | AC | 285 ms
56,836 KB |
testcase_03 | AC | 286 ms
56,788 KB |
testcase_04 | AC | 292 ms
56,820 KB |
testcase_05 | AC | 296 ms
56,684 KB |
testcase_06 | AC | 295 ms
56,732 KB |
testcase_07 | AC | 451 ms
59,700 KB |
testcase_08 | AC | 446 ms
59,680 KB |
testcase_09 | AC | 431 ms
59,504 KB |
testcase_10 | AC | 449 ms
59,452 KB |
testcase_11 | AC | 439 ms
59,756 KB |
testcase_12 | AC | 709 ms
83,084 KB |
testcase_13 | AC | 711 ms
83,028 KB |
testcase_14 | AC | 699 ms
82,956 KB |
testcase_15 | AC | 695 ms
83,428 KB |
testcase_16 | AC | 703 ms
83,040 KB |
testcase_17 | AC | 703 ms
82,692 KB |
testcase_18 | AC | 780 ms
90,972 KB |
testcase_19 | AC | 785 ms
91,068 KB |
testcase_20 | AC | 789 ms
90,784 KB |
testcase_21 | AC | 811 ms
90,916 KB |
testcase_22 | AC | 795 ms
90,948 KB |
ソースコード
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() }