結果
問題 | No.844 split game |
ユーザー |
|
提出日時 | 2021-07-07 09:43:28 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 102 ms / 2,000 ms |
コード長 | 5,140 bytes |
コンパイル時間 | 12,373 ms |
コンパイル使用メモリ | 299,296 KB |
実行使用メモリ | 16,688 KB |
最終ジャッジ日時 | 2024-07-01 12:18:59 |
合計ジャッジ時間 | 16,363 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 56 |
ソースコード
def solve(io)n, m, a = io.get(Int32, Int32, Int64)q = Array.new(m) doli, ri, pi = io.get(Int32, Int32, Int64); li -= 1Q.new(li, ri, pi)endq.sort_by! { |qi| [qi.r, qi.l] }dp = SegmentTree.new([0_i64] + Array.new(n, -a)) { |a, b| Math.max(a, b) }q.each do |qi|li, ri, pi = qi.l, qi.r, qi.pmax_u(dp[ri], Math.max(dp[li]+pi-(ri == n ? 0 : a), dp[0...li]+pi-(ri == n ? a : a*2)))endio.put dp[0..n]endrecord Q, l : Int32, r : Int32, p : Int64struct Intdef cdiv(b : Int)(self + b - 1) // bend{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.34.0") < 0 %}def bit_length : Int32x = self < 0 ? ~self : selfif x.is_a?(Int::Primitive)Int32.new(sizeof(self) * 8 - x.leading_zeros_count)elseto_s(2).sizeendend{% end %}endstruct Int32SQRT_MAX = 46_340_i32def isqrtm = SQRT_MAXr = (1_i32..SQRT_MAX).bsearch { |i| i**2 > self }r.nil? ? SQRT_MAX : r - 1endendstruct Int64SQRT_MAX = 3_037_000_499_i64def isqrtr = (1_i64..SQRT_MAX).bsearch { |i| i**2 > self }r.nil? ? SQRT_MAX : r - 1endendclass SegmentTree(T)def initialize(@n : Int32, @init : T = T.zero, &@compose : (T, T) -> T)@an = 1 << (@n-1).bit_length@buf = Array.new(@an*2, @init)propagate_allenddef initialize(b : Array(T), @init : T = T.zero, &@compose : (T, T) -> T)@n = b.size@an = 1 << (@n-1).bit_length@buf = Array.new(@an*2, @init)@buf[@an, @n] = bpropagate_allenddef [](i : Int)@buf[i+@an]enddef [](r : Range)sc = Indexable.range_to_index_and_count(r, @n)raise ArgumentError.new("Invalid range") if sc.nil?start, count = scl, r = start + @an, start + count + @anr1 = r2 = @initwhile l != rif l.odd?r1 = @compose.call(r1, @buf[l])l += 1endif r.odd?r -= 1r2 = @compose.call(@buf[r], r2)endl >>= 1r >>= 1end@compose.call(r1, r2)enddef []=(i : Int, v : T)@buf[i+@an] = vpropagate(i+@an)end@an : Int32@buf : Array(T)private def propagate_all(1...@an).reverse_each do |i|@buf[i] = @compose.call(@buf[i << 1], @buf[(i << 1) | 1])endendprivate def propagate(i : Int)while (i >>= 1) > 0@buf[i] = @compose.call(@buf[i << 1], @buf[(i << 1) | 1])endendendclass Arraymacro 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 %}endendstruct Number{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.36.0") < 0 %}def self.additive_identityzeroenddef self.multiplicative_identitynew(1)end{% end %}endclass ProconIOdef initialize@buf = [] of String@index = 0enddef get(k : T.class = Int32) forall Tget_v(k)endmacro 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 %} }enddef get{{i}}(k : T.class = Int32) forall Tget({% for j in (1..i) %}k{% if j < i %}, {% end %}{% end %})end{% end %}enddefine_getdef get_a(n : Int, k : T.class = Int32) forall TArray.new(n) { get_v(k) }enddef get_c(n : Int, k : T.class = Int32) forall Tget_a(n, k)enddef get_c(n : Int, *ks)a = Array.new(n) { get(*ks) }ks.map_with_index { |_, i| a.map { |e| e[i] } }endmacro define_get_c{% for i in (2..9) %}def get{{i}}_c(n : Int, k : T.class = Int32) forall Tget_c(n, {% for j in (1..i) %}k{% if j < i %}, {% end %}{% end %})end{% end %}enddefine_get_cdef get_m(r : Int, c : Int, k : T.class = Int32) forall TArray.new(r) { get_a(c, k) }enddef put(*vs)vs.each.with_index do |v, i|put_v(v)print i < vs.size - 1 ? " " : "\n"endenddef put_e(*vs)put(*vs)exitendprivate def get_v(k : Int32.class); get_token.to_i32; endprivate def get_v(k : Int64.class); get_token.to_i64; endprivate def get_v(k : String.class); get_token; endprivate def get_tokenif @buf.size == @index@buf = read_line.split@index = 0endv = @buf[@index]@index += 1vendprivate def put_v(vs : Enumerable)vs.each_with_index do |v, i|print vprint " " if i < vs.size - 1endendprivate def put_v(v)print vendendmacro min_u(a, b){{a}} = Math.min({{a}}, {{b}})endmacro max_u(a, b){{a}} = Math.max({{a}}, {{b}})endsolve(ProconIO.new)