結果

問題 No.761 平均値ゲーム
ユーザー te-shte-sh
提出日時 2021-07-12 17:01:24
言語 Crystal
(1.11.2)
結果
AC  
実行時間 31 ms / 2,000 ms
コード長 5,703 bytes
コンパイル時間 19,702 ms
コンパイル使用メモリ 260,620 KB
実行使用メモリ 13,096 KB
最終ジャッジ日時 2023-09-14 20:38:36
合計ジャッジ時間 25,845 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,400 KB
testcase_01 AC 3 ms
4,420 KB
testcase_02 AC 3 ms
4,468 KB
testcase_03 AC 3 ms
4,492 KB
testcase_04 AC 2 ms
4,420 KB
testcase_05 AC 2 ms
4,476 KB
testcase_06 AC 3 ms
4,472 KB
testcase_07 AC 3 ms
4,468 KB
testcase_08 AC 2 ms
4,488 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 3 ms
4,388 KB
testcase_11 AC 3 ms
4,380 KB
testcase_12 AC 2 ms
4,400 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 2 ms
4,392 KB
testcase_15 AC 3 ms
4,468 KB
testcase_16 AC 2 ms
4,468 KB
testcase_17 AC 2 ms
4,488 KB
testcase_18 AC 2 ms
4,396 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 3 ms
4,460 KB
testcase_21 AC 2 ms
4,416 KB
testcase_22 AC 2 ms
4,476 KB
testcase_23 AC 2 ms
4,424 KB
testcase_24 AC 2 ms
4,400 KB
testcase_25 AC 2 ms
4,376 KB
testcase_26 AC 2 ms
4,468 KB
testcase_27 AC 2 ms
4,412 KB
testcase_28 AC 2 ms
4,408 KB
testcase_29 AC 2 ms
4,444 KB
testcase_30 AC 3 ms
4,400 KB
testcase_31 AC 2 ms
4,376 KB
testcase_32 AC 2 ms
4,536 KB
testcase_33 AC 23 ms
10,128 KB
testcase_34 AC 26 ms
12,216 KB
testcase_35 AC 4 ms
5,052 KB
testcase_36 AC 15 ms
8,308 KB
testcase_37 AC 22 ms
9,940 KB
testcase_38 AC 21 ms
10,016 KB
testcase_39 AC 27 ms
12,512 KB
testcase_40 AC 27 ms
12,280 KB
testcase_41 AC 26 ms
10,660 KB
testcase_42 AC 28 ms
12,384 KB
testcase_43 AC 7 ms
5,792 KB
testcase_44 AC 18 ms
8,980 KB
testcase_45 AC 26 ms
10,512 KB
testcase_46 AC 15 ms
8,056 KB
testcase_47 AC 15 ms
8,048 KB
testcase_48 AC 4 ms
4,876 KB
testcase_49 AC 28 ms
12,376 KB
testcase_50 AC 6 ms
5,456 KB
testcase_51 AC 5 ms
5,088 KB
testcase_52 AC 5 ms
5,124 KB
testcase_53 AC 28 ms
12,364 KB
testcase_54 AC 17 ms
8,932 KB
testcase_55 AC 28 ms
12,396 KB
testcase_56 AC 10 ms
6,740 KB
testcase_57 AC 28 ms
12,408 KB
testcase_58 AC 7 ms
5,744 KB
testcase_59 AC 27 ms
12,416 KB
testcase_60 AC 10 ms
6,796 KB
testcase_61 AC 30 ms
12,636 KB
testcase_62 AC 28 ms
12,396 KB
testcase_63 AC 8 ms
5,952 KB
testcase_64 AC 26 ms
10,724 KB
testcase_65 AC 12 ms
7,072 KB
testcase_66 AC 4 ms
5,180 KB
testcase_67 AC 10 ms
6,804 KB
testcase_68 AC 5 ms
5,172 KB
testcase_69 AC 24 ms
10,128 KB
testcase_70 AC 15 ms
8,288 KB
testcase_71 AC 9 ms
6,556 KB
testcase_72 AC 5 ms
5,208 KB
testcase_73 AC 11 ms
6,684 KB
testcase_74 AC 8 ms
5,908 KB
testcase_75 AC 15 ms
8,084 KB
testcase_76 AC 10 ms
6,700 KB
testcase_77 AC 23 ms
10,116 KB
testcase_78 AC 15 ms
8,260 KB
testcase_79 AC 7 ms
5,768 KB
testcase_80 AC 6 ms
5,584 KB
testcase_81 AC 5 ms
5,400 KB
testcase_82 AC 19 ms
8,928 KB
testcase_83 AC 30 ms
12,992 KB
testcase_84 AC 30 ms
12,904 KB
testcase_85 AC 30 ms
12,872 KB
testcase_86 AC 30 ms
13,044 KB
testcase_87 AC 30 ms
12,912 KB
testcase_88 AC 31 ms
13,020 KB
testcase_89 AC 31 ms
12,972 KB
testcase_90 AC 30 ms
13,096 KB
testcase_91 AC 30 ms
12,896 KB
testcase_92 AC 30 ms
13,044 KB
testcase_93 AC 3 ms
4,432 KB
testcase_94 AC 2 ms
4,432 KB
testcase_95 AC 18 ms
12,988 KB
testcase_96 AC 19 ms
12,900 KB
testcase_97 AC 19 ms
13,032 KB
testcase_98 AC 22 ms
12,148 KB
testcase_99 AC 25 ms
12,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def solve(io)
  n = io.get
  a = io.get_a(n, Int64)

  ac = CumulativeSum.new(a)

  calc = uninitialized (Int32, Int32) -> Bool
  calc = ->(l : Int32, r : Int32) do
    return true if a[l] == a[r-1]

    b = (ac[l...r] + (r-l) - 1) // (r-l)
    i = a.bsearch_index { |ai| ai >= b } || a.size

    c1 = calc.call(l, i)
    c2 = calc.call(i, r)
    !c1 || !c2
  end

  io.put calc.call(0, n) ? "First" : "Second"
end

struct Int
  def cdiv(b : Int)
    (self + b - 1) // b
  end

  def bit?(i : Int)
    bit(i) == 1
  end

  def set_bit(i : Int)
    self | (self.class.new(1) << i)
  end

  def reset_bit(i : Int)
    self & ~(self.class.new(1) << i)
  end

  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.34.0") < 0 %}
    def bit_length : Int32
      x = self < 0 ? ~self : self

      if x.is_a?(Int::Primitive)
        Int32.new(sizeof(self) * 8 - x.leading_zeros_count)
      else
        to_s(2).size
      end
    end
  {% end %}
end

struct Int32
  SQRT_MAX = 46_340_i32

  def isqrt
    m = SQRT_MAX
    r = (1_i32..SQRT_MAX).bsearch { |i| i**2 > self }
    r.nil? ? SQRT_MAX : r - 1
  end
end

struct Int64
  SQRT_MAX = 3_037_000_499_i64

  def isqrt
    r = (1_i64..SQRT_MAX).bsearch { |i| i**2 > self }
    r.nil? ? SQRT_MAX : r - 1
  end
end

struct Number
  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.1.0") < 0 %}
    def zero?
      self == 0
    end

    def positive?
      self > 0
    end

    def negative?
      self < 0
    end
  {% end %}

  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.36.0") < 0 %}
    def self.additive_identity
      zero
    end

    def self.multiplicative_identity
      new(1)
    end
  {% end %}
end

class Array
  macro new_md(*args, &block)
    {% if !block %}
      {% for arg, i in args[0...-2] %}
        Array.new({{arg}}) {
      {% end %}
      Array.new({{args[-2]}}, {{args[-1]}})
      {% for arg in args[0...-2] %}
        }
      {% end %}
    {% else %}
      {% for arg, i in args %}
        Array.new({{arg}}) { |_i{{i}}|
      {% end %}
      {% for block_arg, i in block.args %}
        {{block_arg}} = _i{{i}}
      {% end %}
      {{block.body}}
      {% for arg in args %}
        }
      {% end %}
    {% end %}
  end
end

class ProconIO
  def initialize(@ins : IO = STDIN, @outs : IO = STDOUT)
    @buf = [] of String
    @index = 0
  end

  def get(k : T.class = Int32) forall T
    get_v(k)
  end

  macro define_get
    {% for i in (2..9) %}
      def get(
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        {
          {% for j in (1..i) %}
            get(k{{j}}){% if j < i %},{% end %}
          {% end %}
        }
      end
    {% end %}
  end
  define_get

  macro define_getn
    {% for i in (2..9) %}
      def get{{i}}(k : T.class = Int32) forall T
        get(
          {% for j in (1..i) %}
            k{% if j < i %}, {% end %}
          {% end %}
        )
      end
    {% end %}
  end
  define_getn

  def get_a(n : Int, k : T.class = Int32) forall T
    Array.new(n) { get_v(k) }
  end

  def get_c(n : Int, k : T.class = Int32) forall T
    get_a(n, k)
  end

  macro define_get_c
    {% for i in (2..9) %}
      def get_c(
            n : Int,
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        a = Array.new(n) do
          get(
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        end
        {
          {% for j in (1..i) %}
            a.map { |e| e[{{j-1}}] }{% if j < i %},{% end %}
          {% end %}
        }
      end
    {% end %}
  end
  define_get_c

  macro define_getn_c
    {% for i in (2..9) %}
      def get{{i}}_c(n : Int, k : T.class = Int32) forall T
        get_c(
          n,
          {% for j in (1..i) %}
            k{% if j < i %}, {% end %}
          {% end %}
        )
      end
    {% end %}
  end
  define_getn_c

  def get_m(r : Int, c : Int, k : T.class = Int32) forall T
    Array.new(r) { get_a(c, k) }
  end

  def put(*vs)
    vs.each.with_index do |v, i|
      put_v(v)
      @outs.print i < vs.size - 1 ? " " : "\n"
    end
  end

  def put_e(*vs)
    put(*vs)
    exit
  end

  def put_f(*vs)
    put(*vs)
    @outs.flush
  end


  private def get_v(k : Int32.class); get_token.to_i32; end
  private def get_v(k : Int64.class); get_token.to_i64; end
  private def get_v(k : UInt32.class); get_token.to_u32; end
  private def get_v(k : UInt64.class); get_token.to_u64; end
  private def get_v(k : Float64.class); get_token.to_f64; end
  private def get_v(k : String.class); get_token; end

  private def get_token
    if @buf.size == @index
      str = @ins.read_line
      @buf = str.split
      @index = 0
    end
    v = @buf[@index]
    @index += 1
    v
  end

  private def put_v(vs : Enumerable)
    vs.each_with_index do |v, i|
      @outs.print v
      @outs.print " " if i < vs.size - 1
    end
  end

  private def put_v(v)
    @outs.print v
  end
end

macro min_u(a, b)
  {{a}} = Math.min({{a}}, {{b}})
end

macro max_u(a, b)
  {{a}} = Math.max({{a}}, {{b}})
end

macro zip(a, *b, &block)
  {{a}}.zip({{*b}}) {{block}}
end

class CumulativeSum(T)
  def initialize(a : Array(T))
    @n = a.size
    @s = Array.new(@n+1, T.additive_identity)
    @n.times.each do |i|
      @s[i+1] = @s[i] + a[i]
    end
  end

  getter n : Int32

  def [](start : Int, count : Int)
    @s[start + count] - @s[start]
  end

  def [](r : Range)
    sc = Indexable.range_to_index_and_count(r, @n)
    raise ArgumentError.new("Invalid range") if sc.nil?
    self[*sc]
  end


  @s : Array(T)
end

solve(ProconIO.new)
0