結果
問題 | No.935 う し た ぷ に き あ く ん 笑 ビ - ム |
ユーザー | yakamoto |
提出日時 | 2019-11-29 23:26:02 |
言語 | Scala(Beta) (3.4.0) |
結果 |
AC
|
実行時間 | 1,411 ms / 2,000 ms |
コード長 | 4,928 bytes |
コンパイル時間 | 14,769 ms |
コンパイル使用メモリ | 257,676 KB |
実行使用メモリ | 63,156 KB |
最終ジャッジ日時 | 2023-10-12 06:38:02 |
合計ジャッジ時間 | 82,624 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,021 ms
63,156 KB |
testcase_01 | AC | 1,063 ms
62,552 KB |
testcase_02 | AC | 1,043 ms
62,420 KB |
testcase_03 | AC | 1,070 ms
62,768 KB |
testcase_04 | AC | 1,065 ms
62,592 KB |
testcase_05 | AC | 1,039 ms
62,688 KB |
testcase_06 | AC | 1,078 ms
62,628 KB |
testcase_07 | AC | 1,087 ms
62,580 KB |
testcase_08 | AC | 1,113 ms
62,728 KB |
testcase_09 | AC | 1,083 ms
62,588 KB |
testcase_10 | AC | 1,080 ms
62,900 KB |
testcase_11 | AC | 1,117 ms
62,704 KB |
testcase_12 | AC | 986 ms
62,240 KB |
testcase_13 | AC | 979 ms
62,200 KB |
testcase_14 | AC | 968 ms
62,692 KB |
testcase_15 | AC | 967 ms
62,492 KB |
testcase_16 | AC | 978 ms
62,308 KB |
testcase_17 | AC | 1,411 ms
62,760 KB |
testcase_18 | AC | 1,082 ms
62,972 KB |
testcase_19 | AC | 1,091 ms
62,796 KB |
testcase_20 | AC | 1,104 ms
62,864 KB |
testcase_21 | AC | 1,042 ms
62,516 KB |
testcase_22 | AC | 1,041 ms
62,476 KB |
testcase_23 | AC | 992 ms
62,912 KB |
testcase_24 | AC | 1,075 ms
62,636 KB |
testcase_25 | AC | 1,082 ms
62,728 KB |
testcase_26 | AC | 1,061 ms
62,256 KB |
testcase_27 | AC | 996 ms
62,564 KB |
testcase_28 | AC | 1,032 ms
62,324 KB |
testcase_29 | AC | 1,051 ms
62,480 KB |
testcase_30 | AC | 1,043 ms
62,444 KB |
testcase_31 | AC | 1,041 ms
62,544 KB |
testcase_32 | AC | 1,056 ms
62,508 KB |
testcase_33 | AC | 1,086 ms
62,532 KB |
testcase_34 | AC | 1,090 ms
62,876 KB |
testcase_35 | AC | 1,095 ms
62,652 KB |
testcase_36 | AC | 1,071 ms
62,704 KB |
testcase_37 | AC | 1,092 ms
62,604 KB |
testcase_38 | AC | 1,090 ms
62,732 KB |
testcase_39 | AC | 1,098 ms
62,780 KB |
testcase_40 | AC | 1,099 ms
62,732 KB |
testcase_41 | AC | 1,104 ms
62,796 KB |
testcase_42 | AC | 1,112 ms
62,784 KB |
testcase_43 | AC | 1,092 ms
62,780 KB |
testcase_44 | AC | 1,065 ms
62,700 KB |
testcase_45 | AC | 1,095 ms
62,784 KB |
testcase_46 | AC | 1,036 ms
62,596 KB |
testcase_47 | AC | 1,081 ms
62,876 KB |
testcase_48 | AC | 1,099 ms
62,412 KB |
testcase_49 | AC | 1,073 ms
62,700 KB |
testcase_50 | AC | 1,103 ms
62,732 KB |
testcase_51 | AC | 1,108 ms
62,796 KB |
testcase_52 | AC | 1,096 ms
62,708 KB |
testcase_53 | AC | 1,099 ms
62,824 KB |
testcase_54 | AC | 1,069 ms
62,844 KB |
testcase_55 | AC | 1,026 ms
62,656 KB |
testcase_56 | AC | 1,104 ms
62,624 KB |
testcase_57 | AC | 1,100 ms
62,704 KB |
testcase_58 | AC | 976 ms
62,576 KB |
testcase_59 | AC | 984 ms
62,220 KB |
ソースコード
object Main { import java.io.{BufferedReader, InputStream, InputStreamReader} import java.util.StringTokenizer import scala.reflect.ClassTag def main(args: Array[String]): Unit = { val out = new java.io.PrintWriter(System.out) new Main(out, new InputReader(System.in)).solve() out.flush() } private[this] val oj = System.getenv("ATCODER_DEBUG") == null @inline private final def DEBUG(f: => Unit): Unit = { if (!oj){ f } } @inline private final def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) } @inline def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) } @inline private final def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) } @inline private final def debugDim(m: Array[Array[Int]]): Unit = if (!oj){ REP(m.length) { i => debug(m(i)) } } @inline private final def debugDimFlip(m: Array[Array[Long]]): Unit = if (!oj){ REP(m(0).length) { j => REP(m.length) { i => System.err.print(m(i)(j)) System.err.print(" ") } System.err.println() } } @inline def debug(s: => String): Unit = DEBUG { System.err.println(s) } @inline private final def debugL(num: => Long): Unit = DEBUG { System.err.println(num) } private def isDebug[A](debug: => A, online: => A): A = { if (oj) online else debug } class InputReader(val stream: InputStream) { private[this] val reader = new BufferedReader(new InputStreamReader(stream), 32768) private[this] var tokenizer: StringTokenizer = _ @inline private[this] final def next(): String = { while (tokenizer == null || !tokenizer.hasMoreTokens) tokenizer = new StringTokenizer(reader.readLine) tokenizer.nextToken } def nextInt(): Int = Integer.parseInt(next()) def nextLong(): Long = java.lang.Long.parseLong(next()) def nextChar(): Char = next().charAt(0) def ni(): Int = nextInt() def nl(): Long = nextLong() def nc(): Char = nextChar() def ns(): String = next() def ns(n: Int): Array[Char] = ns().toCharArray def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset) def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = { val A1, A2 = Array.ofDim[Int](n) REP(n) { i => A1(i) = ni() + offset A2(i) = ni() + offset } (A1, A2) } def nm(n: Int, m: Int): Array[Array[Int]] = { val A = Array.ofDim[Int](n, m) REP(n) { i => REP(m) { j => A(i)(j) = ni() } } A } def nal(n: Int): Array[Long] = map(n)(_ => nl()) def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m)) } def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = { var i = offset val N = n + offset while(i < N) { f(i); i += 1 } } def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = { var i = n - 1 + offset while(i >= offset) { f(i); i -= 1 } } def TO(from: Int, to: Int)(f: Int => Unit): Unit = { REP(to - from + 1, from)(f) } def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = { val res = Array.ofDim[A](n) REP(n)(i => res(i) = f(i + offset)) res } def sumL(as: Array[Int]): Long = { var s = 0L REP(as.length)(i => s += as(i)) s } def cumSum(as: Array[Int]): Array[Long] = { val cum = Array.ofDim[Long](as.length + 1) REP(as.length) { i => cum(i + 1) = cum(i) + as(i) } cum } } object Workspace { import Main._ } class Main(out: java.io.PrintWriter, sc: Main.InputReader) { import sc._ import Main._ import java.util.Arrays.sort import scala.collection.mutable import math.{abs, max, min} import mutable.ArrayBuffer import Workspace._ // toIntとか+7とかするならvalにしろ final private[this] val MOD = 1000000007 def solve(): Unit = { val N = ni() val S = ns(N).map(a => if(a == 'E') 1 else 0) val A = na(N) val defeats = new java.util.TreeMap[Integer, Integer] val cumPow = cumSum(A) val cumEnemy = cumSum(S) val MAX = 1e9.toInt REP(N) { i => TO(i, N - 1) { j => // [i, j] val power = cumPow(j + 1) - cumPow(i) val enemy = cumEnemy(j + 1) - cumEnemy(i) if (power <= MAX) { val key = power.toInt if (!defeats.containsKey(key) || enemy > defeats.get(key)) { defeats.put(key, enemy.toInt) } } } } val it = defeats.keySet().iterator() var mxCnt = 0 while(it.hasNext) { val power = it.next val cnt = defeats.get(power) if (cnt <= mxCnt) it.remove() mxCnt = max(mxCnt, cnt) } REP(ni()) { _ => val k = ni() val e = defeats.lowerEntry(k + 1) val ans = if (e == null) 0 else e.getValue out.println(ans) } } }