結果
問題 | No.1811 EQUIV Ten |
ユーザー | 👑 箱 |
提出日時 | 2021-11-03 03:33:29 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 763 ms / 2,000 ms |
コード長 | 3,286 bytes |
コンパイル時間 | 19,362 ms |
コンパイル使用メモリ | 431,112 KB |
実行使用メモリ | 183,016 KB |
最終ジャッジ日時 | 2023-08-12 16:50:31 |
合計ジャッジ時間 | 31,607 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 253 ms
54,292 KB |
testcase_01 | AC | 256 ms
54,244 KB |
testcase_02 | AC | 265 ms
52,212 KB |
testcase_03 | AC | 258 ms
52,228 KB |
testcase_04 | AC | 253 ms
54,192 KB |
testcase_05 | AC | 257 ms
52,288 KB |
testcase_06 | AC | 258 ms
52,736 KB |
testcase_07 | AC | 260 ms
54,236 KB |
testcase_08 | AC | 257 ms
52,304 KB |
testcase_09 | AC | 257 ms
52,496 KB |
testcase_10 | AC | 257 ms
52,312 KB |
testcase_11 | AC | 710 ms
173,508 KB |
testcase_12 | AC | 745 ms
179,076 KB |
testcase_13 | AC | 755 ms
180,116 KB |
testcase_14 | AC | 763 ms
183,016 KB |
testcase_15 | AC | 747 ms
182,324 KB |
testcase_16 | AC | 264 ms
52,296 KB |
testcase_17 | AC | 258 ms
52,232 KB |
testcase_18 | AC | 267 ms
54,516 KB |
testcase_19 | AC | 264 ms
52,680 KB |
testcase_20 | AC | 315 ms
57,444 KB |
testcase_21 | AC | 328 ms
57,816 KB |
testcase_22 | AC | 267 ms
52,192 KB |
testcase_23 | AC | 447 ms
99,484 KB |
testcase_24 | AC | 317 ms
57,124 KB |
testcase_25 | AC | 271 ms
54,296 KB |
testcase_26 | AC | 426 ms
78,480 KB |
testcase_27 | AC | 271 ms
54,176 KB |
testcase_28 | AC | 264 ms
54,320 KB |
testcase_29 | AC | 265 ms
52,232 KB |
testcase_30 | AC | 710 ms
167,976 KB |
testcase_31 | AC | 320 ms
56,788 KB |
testcase_32 | AC | 314 ms
59,192 KB |
testcase_33 | AC | 332 ms
61,604 KB |
testcase_34 | AC | 677 ms
160,384 KB |
testcase_35 | AC | 406 ms
77,752 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() if (n <= 3) { println(0) return } val dp = Array(n + 1) { Array(2) { Array(2) { Array(2) { ModInt(0) } } } } for (j1 in 0 until 2) { for (j2 in 0 until 2) { for (j3 in 0 until 2) { dp[3][j1][j2][j3] = ModInt(1) } } } for (i in 4 until n + 1) { for (j1 in 0 until 2) { for (j2 in 0 until 2) { for (j3 in 0 until 2) { if (!(j1 == 1 && j2 == 0 && j3 == 1)) { dp[i][j2][j3][0] += dp[i - 1][j1][j2][j3] } dp[i][j2][j3][1] += dp[i - 1][j1][j2][j3] } } } } var sum = ModInt(0) for (j1 in 0 until 2) { for (j2 in 0 until 2) { for (j3 in 0 until 2) { sum += dp[n][j1][j2][j3] } } } println(ModInt(2).pow(n.toLong()) - sum) } // region ModInt class ModInt(x: Long) { companion object { //const val MOD = 998244353L const val MOD = 1000000007L } constructor(y: Int) : this(y.toLong()) val x = (x % MOD + MOD) % MOD operator fun plus(other: ModInt): ModInt { return ModInt(x + other.x) } operator fun minus(other: ModInt): ModInt { return ModInt(x - other.x) } operator fun times(other: ModInt): ModInt { return ModInt(x * other.x) } operator fun div(other: ModInt): ModInt { return this * other.inv() } fun pow(exp: Long): ModInt { if (exp == 0L) return ModInt(1L) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } fun inv(): ModInt { return this.pow(MOD - 2) } override fun equals(other: Any?): Boolean { if (this === other) return true if (javaClass != other?.javaClass) return false other as ModInt if (x != other.x) return false return true } override fun hashCode(): Int { return x.hashCode() } override fun toString(): String { return "$x" } } fun Long.toModInt(): ModInt { return ModInt(this) } fun Int.toModInt(): ModInt { return ModInt(this) } fun binomSimple(n: Long, k: Long): ModInt { var numer = ModInt(1) var denom = ModInt(1) for (i in 0 until k) { numer *= ModInt(n - i) denom *= ModInt(k - i) } return numer / denom } // endregion fun main() { Thread(null, { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() }, "solve", abs(1L.shl(26))) .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } } .apply { start() }.join() } // region Scanner private var st = StringTokenizer("") private val br = System.`in`.bufferedReader() fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() // endregion