結果

問題 No.844 split game
ユーザー te-sh
提出日時 2021-07-07 09:25:45
言語 Crystal
(1.14.0)
結果
RE  
実行時間 -
コード長 5,142 bytes
コンパイル時間 12,501 ms
コンパイル使用メモリ 299,340 KB
実行使用メモリ 16,740 KB
最終ジャッジ日時 2024-07-01 12:18:22
合計ジャッジ時間 17,595 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 54 RE * 2
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

def solve(io)
n, m, a = io.get(Int32, Int32, Int64)
q = Array.new(m) do
li, ri, pi = io.get(Int32, Int32, Int64); li -= 1
Q.new(li, ri, pi)
end
q.sort_by! { |qi| [qi.r, qi.l] }
dp = SegmentTree.new([0_i64] + Array.new(n-1, -a)) { |a, b| Math.max(a, b) }
q.each do |qi|
li, ri, pi = qi.l, qi.r, qi.p
max_u(dp[ri], Math.max(dp[li]+pi-(ri == n ? 0 : a), dp[0...li]+pi-(ri == n ? a : a*2)))
end
io.put dp[0..n]
end
record Q, l : Int32, r : Int32, p : Int64
struct Int
def cdiv(b : Int)
(self + b - 1) // b
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
class 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_all
end
def 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] = b
propagate_all
end
def [](i : Int)
@buf[i+@an]
end
def [](r : Range)
sc = Indexable.range_to_index_and_count(r, @n)
raise ArgumentError.new("Invalid range") if sc.nil?
start, count = sc
l, r = start + @an, start + count + @an
r1 = r2 = @init
while l != r
if l.odd?
r1 = @compose.call(r1, @buf[l])
l += 1
end
if r.odd?
r -= 1
r2 = @compose.call(@buf[r], r2)
end
l >>= 1
r >>= 1
end
@compose.call(r1, r2)
end
def []=(i : Int, v : T)
@buf[i+@an] = v
propagate(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])
end
end
private def propagate(i : Int)
while (i >>= 1) > 0
@buf[i] = @compose.call(@buf[i << 1], @buf[(i << 1) | 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
struct Number
{% 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 ProconIO
def initialize
@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
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_get
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
def get_c(n : Int, *ks)
a = Array.new(n) { get(*ks) }
ks.map_with_index { |_, i| a.map { |e| e[i] } }
end
macro define_get_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_get_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)
print i < vs.size - 1 ? " " : "\n"
end
end
def put_e(*vs)
put(*vs)
exit
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 : String.class); get_token; end
private def get_token
if @buf.size == @index
@buf = read_line.split
@index = 0
end
v = @buf[@index]
@index += 1
v
end
private def put_v(vs : Enumerable)
vs.each_with_index do |v, i|
print v
print " " if i < vs.size - 1
end
end
private def put_v(v)
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
solve(ProconIO.new)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0