結果
問題 | No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木 |
ユーザー | yudedako |
提出日時 | 2022-01-27 20:58:25 |
言語 | Scala(Beta) (3.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,716 bytes |
コンパイル時間 | 12,259 ms |
コンパイル使用メモリ | 257,888 KB |
実行使用メモリ | 94,636 KB |
最終ジャッジ日時 | 2023-08-26 22:52:50 |
合計ジャッジ時間 | 69,545 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,008 ms
62,700 KB |
testcase_01 | AC | 1,048 ms
62,620 KB |
testcase_02 | AC | 1,076 ms
62,820 KB |
testcase_03 | AC | 1,073 ms
62,780 KB |
testcase_04 | AC | 1,064 ms
63,116 KB |
testcase_05 | AC | 1,062 ms
63,124 KB |
testcase_06 | AC | 1,086 ms
62,656 KB |
testcase_07 | AC | 1,060 ms
62,652 KB |
testcase_08 | AC | 1,065 ms
62,828 KB |
testcase_09 | AC | 1,090 ms
62,724 KB |
testcase_10 | AC | 1,059 ms
62,576 KB |
testcase_11 | WA | - |
testcase_12 | AC | 1,057 ms
62,460 KB |
testcase_13 | AC | 1,073 ms
62,588 KB |
testcase_14 | AC | 1,459 ms
65,644 KB |
testcase_15 | AC | 1,603 ms
87,504 KB |
testcase_16 | AC | 1,582 ms
87,456 KB |
testcase_17 | AC | 1,467 ms
65,524 KB |
testcase_18 | AC | 1,504 ms
75,704 KB |
testcase_19 | AC | 1,478 ms
65,616 KB |
testcase_20 | AC | 1,521 ms
77,760 KB |
testcase_21 | AC | 1,644 ms
94,384 KB |
testcase_22 | AC | 1,644 ms
94,636 KB |
testcase_23 | AC | 1,500 ms
67,828 KB |
testcase_24 | AC | 1,673 ms
94,400 KB |
testcase_25 | AC | 1,481 ms
67,936 KB |
testcase_26 | AC | 1,469 ms
65,564 KB |
testcase_27 | AC | 1,510 ms
75,556 KB |
testcase_28 | AC | 1,475 ms
63,808 KB |
testcase_29 | AC | 1,420 ms
63,844 KB |
testcase_30 | AC | 1,636 ms
92,560 KB |
testcase_31 | AC | 1,212 ms
63,884 KB |
testcase_32 | AC | 1,430 ms
63,572 KB |
testcase_33 | AC | 1,487 ms
76,552 KB |
testcase_34 | AC | 922 ms
61,988 KB |
testcase_35 | AC | 1,135 ms
63,004 KB |
testcase_36 | AC | 924 ms
62,412 KB |
testcase_37 | AC | 1,108 ms
62,596 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 1,137 ms
62,936 KB |
testcase_41 | AC | 1,139 ms
62,708 KB |
ソースコード
import scala.io.StdIn.readLine import scala.reflect.ClassTag import scala.math.* type Matrix = Array[Array[Long]] inline val MinValue = 26 * 15 * -1000000L - 1 extension (left: Matrix) inline def *(right: Matrix): Matrix = val row = left.length val column = right(0).length val mid = right.length Array.tabulate(row){i => Array.tabulate(column){j => (0 until mid).foldLeft(MinValue){(acc, k) => max(acc, if left(i)(k) == MinValue || right(k)(j) == MinValue then MinValue else (left(i)(k) + right(k)(j)))} } } inline def pow(exp: Int): Matrix = val size = left.length var result = Array.tabulate(size){i => Array.tabulate(size){j => if i == j then 0L else MinValue}} var base = left var e = exp while e > 0 do if (e & 1) == 1 then result *= base base *= base e >>= 1 result @main def main = val initialColor = readLine().split(' ').map(_.toInt - 1) val maxCount = readLine().split(' ').map(_.toInt) val n = readLine().toInt val skill = Array.fill(n){ val Array(s, a, b, e) = readLine().split(' ') (s, a.toInt - 1, b.toInt - 1, e.toInt) } val graph = Array.fill(26){Array.tabulate(16){i => Array.tabulate(16){j => if i == j then 0L else MinValue}}} for (s, a, b, e) <- skill do for i <- s.map(_ - 'A') do graph(i)(a)(b) = max(graph(i)(a)(b), e) graph(i)(b)(a) = max(graph(i)(b)(a), e) for i <- 0 until 26 do graph(i) = graph(i).pow(maxCount(i)) var result = MinValue for dest <- 0 until 16 do var sum = 0L for i <- 0 until 26 do sum += graph(i)(initialColor(i))(dest) result = max(result, sum) println(if result == MinValue then "Impossible" else result)