結果

問題 No.949 飲酒プログラミングコンテスト
ユーザー yakamotoyakamoto
提出日時 2019-12-22 19:05:25
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 1,423 ms / 2,500 ms
コード長 4,632 bytes
コンパイル時間 14,847 ms
コンパイル使用メモリ 276,096 KB
実行使用メモリ 65,604 KB
最終ジャッジ日時 2024-09-14 14:42:01
合計ジャッジ時間 51,815 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 930 ms
65,036 KB
testcase_01 AC 928 ms
65,028 KB
testcase_02 AC 924 ms
64,928 KB
testcase_03 AC 930 ms
64,840 KB
testcase_04 AC 926 ms
64,704 KB
testcase_05 AC 936 ms
64,736 KB
testcase_06 AC 945 ms
65,168 KB
testcase_07 AC 947 ms
65,044 KB
testcase_08 AC 969 ms
64,808 KB
testcase_09 AC 974 ms
65,060 KB
testcase_10 AC 980 ms
64,908 KB
testcase_11 AC 1,237 ms
65,568 KB
testcase_12 AC 1,214 ms
65,396 KB
testcase_13 AC 1,224 ms
65,544 KB
testcase_14 AC 1,038 ms
65,048 KB
testcase_15 AC 1,163 ms
65,316 KB
testcase_16 AC 1,287 ms
65,344 KB
testcase_17 AC 1,110 ms
65,156 KB
testcase_18 AC 1,301 ms
65,496 KB
testcase_19 AC 1,178 ms
65,432 KB
testcase_20 AC 1,065 ms
65,176 KB
testcase_21 AC 1,005 ms
65,136 KB
testcase_22 AC 1,002 ms
65,100 KB
testcase_23 AC 986 ms
64,836 KB
testcase_24 AC 1,200 ms
65,008 KB
testcase_25 AC 1,331 ms
65,596 KB
testcase_26 AC 1,423 ms
65,592 KB
testcase_27 AC 1,324 ms
65,424 KB
testcase_28 AC 1,207 ms
65,568 KB
testcase_29 AC 1,253 ms
65,604 KB
testcase_30 AC 1,140 ms
65,184 KB
testcase_31 AC 1,082 ms
65,448 KB
testcase_32 AC 1,268 ms
65,412 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

  def findMax(f: Int => Boolean, min: Int, max: Int): Int = {
    var l = min
    var h = max + 1
    while(h - l > 1) {
      val x = (h + l) / 2
      if (f(x)) l = x
      else h = x
    }
    l
  }
}

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 A, B = na(N + 1)
    val D = na(N)
    sort(D)

    def test(x: Int): Boolean = {
      var best, next = Array.ofDim[Boolean](x + 1)
      best(0) = true
      REP(x, 1) { days =>
        import java.util
        util.Arrays.fill(next, false)
        REP(days + 1) { a =>
          val b = days - a
          if (A(a) + B(b) >= D(x-days)) {
            if ((a > 0 && best(a-1)) || best(a)) next(a) = true
          }
        }
        val t = next
        next = best
        best = t
      }
      best.exists(identity)
    }

    val ans = findMax(test, 0, N)
    out.println(ans)
  }
}
0