結果

問題 No.951 【本日限定】１枚頼むともう１枚無料！
ユーザー yakamotoyakamoto
提出日時 2019-12-22 20:55:09
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 1,398 ms / 2,000 ms
コード長 4,858 bytes
コンパイル時間 16,632 ms
コンパイル使用メモリ 262,012 KB
実行使用メモリ 63,596 KB
最終ジャッジ日時 2023-10-12 18:36:23
合計ジャッジ時間 84,707 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 921 ms
62,116 KB
testcase_01 AC 936 ms
62,208 KB
testcase_02 AC 941 ms
62,504 KB
testcase_03 AC 934 ms
62,464 KB
testcase_04 AC 942 ms
61,924 KB
testcase_05 AC 928 ms
62,172 KB
testcase_06 AC 931 ms
62,180 KB
testcase_07 AC 931 ms
62,088 KB
testcase_08 AC 939 ms
62,180 KB
testcase_09 AC 1,025 ms
62,684 KB
testcase_10 AC 1,021 ms
62,488 KB
testcase_11 AC 1,028 ms
62,256 KB
testcase_12 AC 1,092 ms
62,320 KB
testcase_13 AC 1,319 ms
62,852 KB
testcase_14 AC 1,068 ms
63,172 KB
testcase_15 AC 1,068 ms
62,252 KB
testcase_16 AC 1,082 ms
62,388 KB
testcase_17 AC 1,175 ms
62,672 KB
testcase_18 AC 926 ms
62,176 KB
testcase_19 AC 927 ms
62,308 KB
testcase_20 AC 966 ms
62,216 KB
testcase_21 AC 1,023 ms
62,352 KB
testcase_22 AC 1,002 ms
62,416 KB
testcase_23 AC 1,009 ms
62,356 KB
testcase_24 AC 1,371 ms
63,444 KB
testcase_25 AC 1,392 ms
62,736 KB
testcase_26 AC 1,398 ms
62,764 KB
testcase_27 AC 1,377 ms
62,764 KB
testcase_28 AC 1,337 ms
62,820 KB
testcase_29 AC 1,342 ms
62,796 KB
testcase_30 AC 933 ms
62,456 KB
testcase_31 AC 942 ms
62,148 KB
testcase_32 AC 1,018 ms
62,248 KB
testcase_33 AC 1,028 ms
62,160 KB
testcase_34 AC 1,029 ms
62,088 KB
testcase_35 AC 1,346 ms
62,760 KB
testcase_36 AC 1,335 ms
62,620 KB
testcase_37 AC 1,386 ms
63,596 KB
testcase_38 AC 1,372 ms
62,696 KB
testcase_39 AC 1,369 ms
62,648 KB
testcase_40 AC 1,390 ms
62,836 KB
testcase_41 AC 1,379 ms
62,696 KB
testcase_42 AC 1,380 ms
63,092 KB
testcase_43 AC 1,369 ms
62,852 KB
testcase_44 AC 1,369 ms
62,796 KB
testcase_45 AC 1,379 ms
63,216 KB
testcase_46 AC 1,352 ms
62,872 KB
testcase_47 AC 1,369 ms
62,572 KB
testcase_48 AC 1,352 ms
62,644 KB
testcase_49 AC 1,339 ms
62,724 KB
testcase_50 AC 1,342 ms
63,012 KB
testcase_51 AC 1,348 ms
62,848 KB
testcase_52 AC 1,280 ms
62,696 KB
testcase_53 AC 1,308 ms
62,740 KB
testcase_54 AC 1,279 ms
62,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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("MY_DEBUG") == null
  def DEBUG(f: => Unit): Unit = {
    if (!oj){ f }
  }
  def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) }
  def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) }
  def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) }
  def debugDim(m: Array[Array[Int]]): Unit = if (!oj){
    REP(m.length) { i =>
      debug(m(i))
    }
  }
  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()
    }
  }
  def debug(s: => String): Unit = {
    if (!oj){ System.err.println(s) }
  }
  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 = _

    private[this] 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._
  import java.util.Arrays.sort

  import scala.collection.mutable
  import math.{abs, max, min}
  import mutable.ArrayBuffer
  case class Entry(p: Int, d: Int)
}

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 = {
    import java.util.Comparator
    val N, K = ni()
    val E = Array.ofDim[Entry](N)
    REP(N) { i =>
      E(i) = Entry(ni(), ni())
    }
    sort(E, new Comparator[Entry] {
      override def compare(o1: Entry, o2: Entry): Int = Integer.compare(o1.p, o2.p)
    })
    var best, next = Array.fill[Int](2, K + 1)(-1)
    best(0)(0) = 0
    best(1)(0) = 0
    REP(N) { i =>
      REP(2) { j =>
        import java.util
        util.Arrays.fill(next(j), -1)
      }
      REP(K + 1) { k =>
        if (k - E(i).p >= 0 && best(1)(k - E(i).p) != -1) next(0)(k) = best(1)(k - E(i).p) + E(i).d // 買って金を払った
        next(0)(k) = max(next(0)(k), best(0)(k)) // 買わなかった
        if (best(0)(k) != -1) next(1)(k) = best(0)(k) + E(i).d // 買ったけどかねを払ってない
        next(1)(k) = max(next(1)(k), best(1)(k)) // 買わなかった
      }
//      debugDim(next)
      val t = next
      next = best
      best = t
    }
    val ans = best(0).max
    out.println(ans)
  }
}
0