This documentation is automatically generated by online-judge-tools/verification-helper
test/datastructure/imos_linear_test.cr
- View this file on GitHub
- Last update: 2022-03-25 19:21:11+09:00
- Problem: https://yukicoder.me/problems/no/1008
Depends on
Code
# verification-helper: PROBLEM https://yukicoder.me/problems/no/1008
require "../../src/datastructure/imos_linear"
require "../../src/scanner"
n, m = input(i, i)
a = input(i64[n])
xw = input({i - 1, i64}[m])
if xw.sum(&.[1]) < a.min
puts 0
exit
end
puts (1i64..10i64**9).bsearch { |c|
imos = ImosLinear(Int64).new(n)
xw.each do |x, w|
imos.add(x..x, w, 0)
left = {x, w // c}.min
imos.add(x - left, left, w - c * left, c)
right = {n - 1 - x, w // c}.min
imos.add(x + 1, right, w - c, -c)
end
imos.build.zip(a).all? { |imos, a| imos < a }
} || -1# verification-helper: PROBLEM https://yukicoder.me/problems/no/1008
# require "../../src/datastructure/imos_linear"
class ImosLinear(T)
getter size : Int32
@built = false
def initialize(@size : Int32)
@a = Array(T).new(@size + 1, T.zero)
@b = Array(T).new(@size + 1, T.zero)
end
# Add `a + (i - l) * b` to `[l, r)`.
def add(start : Int, count : Int, val_a : T, val_b : T) : Nil
raise "self had been called `#build`" if @built
raise ArgumentError.new "Negative count: #{count}" if count < 0
@a[start] += val_a - val_b * start
@b[start] += val_b
@a[start + count] -= val_a - val_b * start
@b[start + count] -= val_b
end
def add(range : Range, val_a : T, val_b : T) : Nil
start, count = Indexable.range_to_index_and_count(range, size) || raise IndexError.new
add(start, count, val_a, val_b)
end
def build : Array(T)
raise "self had been called `#build`" if @built
@built = true
(0...size).map do |i|
@a[i + 1] += @a[i]
@b[i + 1] += @b[i]
@a[i] + @b[i] * i
end
end
end
# require "../../src/scanner"
module Scanner
extend self
private def skip_to_not_space(io)
peek = io.peek
not_space = peek.index { |x| x != 32 && x != 10 } || peek.size
io.skip(not_space)
end
def c(io = STDIN)
skip_to_not_space(io)
io.read_char.not_nil!
end
private def int(int_type : T.class, io = STDIN) : T forall T
skip_to_not_space(io)
value = T.zero
signed = false
case x = io.read_byte
when nil
raise IO::EOFError.new
when 45
signed = true
when 48..57
value = T.new 48 &- x
else
raise "Unexpected char: #{x.chr}"
end
loop do
peek = io.peek
return signed ? value : -value if peek.empty?
i = 0
while i < peek.size
c = peek.unsafe_fetch(i)
if 48 <= c <= 57
value = value &* 10 &- c &+ 48
i &+= 1
elsif c == 32 || c == 10
io.skip(i &+ 1)
return signed ? value : -value
else
raise "Unexpected char: #{c.chr}"
end
end
io.skip(i)
end
end
private def uint(uint_type : T.class, io = STDIN) : T forall T
skip_to_not_space(io)
value = T.zero
found_digit = false
loop do
peek = io.peek
if peek.empty?
if found_digit
return value
else
raise IO::EOFError.new
end
end
i = 0
while i < peek.size
c = peek.unsafe_fetch(i)
if 48 <= c <= 57
found_digit = true
value = value &* 10 &+ c &- 48
i &+= 1
elsif c == 32 || c == 10
io.skip(i &+ 1)
return value
else
raise "Unexpected char: #{c.chr}"
end
end
io.skip(i)
end
end
def i(io = STDIN)
int(Int32, io)
end
{% for n in [8, 16, 32, 64, 128] %}
def i{{n}}(io = STDIN)
int(Int{{n}}, io)
end
def u{{n}}(io = STDIN)
uint(UInt{{n}}, io)
end
{% end %}
{% for method in [:f, :f32, :f64] %}
def {{method.id}}(io = STDIN)
s(io).to_{{method.id}}
end
{% end %}
def s(io = STDIN)
skip_to_not_space(io)
peek = io.peek
if peek.empty?
raise IO::EOFError.new
end
if index = peek.index { |x| x == 32 || x == 10 }
io.skip(index + 1)
return String.new(peek[0, index])
end
String.build do |buffer|
loop do
buffer.write peek
io.skip(peek.size)
peek = io.peek
break if peek.empty?
if index = peek.index { |x| x == 32 || x == 10 }
buffer.write peek[0, index]
io.skip(index + 1)
break
end
end
end
end
end
macro internal_input(type, else_ast, io)
{% if Scanner.class.has_method?(type.id) %}
Scanner.{{type.id}}({{io}})
{% elsif type.stringify == "String" %}
Scanner.s({{io}})
{% elsif type.stringify == "Char" %}
Scanner.c({{io}})
{% elsif type.is_a?(Path) %}
{% if type.resolve.class.has_method?(:scan) %}
{{type}}.scan(Scanner, {{io}})
{% else %}
{{type}}.new(Scanner.s({{io}}))
{% end %}
{% elsif String.has_method?("to_#{type}".id) %}
Scanner.s({{io}}).to_{{type.id}}
{% else %}
{{else_ast}}
{% end %}
end
macro internal_input_array(type, args, io)
{% for i in 0...args.size %}
%size{i} = input({{args[i]}}, io: {{io}})
{% end %}
{% begin %}
{% for i in 0...args.size %} Array.new(%size{i}) { {% end %}
input({{type.id}}, io: {{io}})
{% for i in 0...args.size %} } {% end %}
{% end %}
end
# Inputs from *io*.
#
# ### Specifications
#
# ```plain
# AST | Example | Expanded code
# ------------------+---------------------+---------------------------------------
# Uppercase string | Int32, Int64, etc. | {}.new(Scanner.s)
# | s, c, i, iN, uN | Scanner.{}
# | f, big_i, etc. | Scanner.s.to_{}
# Call [] | type[size] | Array.new(input(size)) { input(type) }
# TupleLiteral | {t1, t2, t3} | {input(t1), input(t2), input(t3)}
# ArrayLiteral | [t1, t2, t3] | [input(t1), input(t2), input(t3)]
# HashLiteral | {t1 => t2} | {input(t1) => input(t2)}
# NamedTupleLiteral | {a: t1, b: t2} | {a: input(t1), b: input(t2)}
# RangeLiteral | t1..t2 | input(t1)..input(t2)
# Expressions | (exp1; exp2) | (input(exp1); input(exp2);)
# If | cond ? t1 : t2 | input(cond) ? input(t1) : input(t2)
# Assign | target = value | target = input(value)
# ```
#
# ### Examples
#
# Input:
# ```plain
# 5 3
# foo bar
# 1 2 3 4 5
# ```
# ```
# n, m = input(Int32, Int64) # => {5, 5i64}
# input(String, Char[m]) # => {"foo", ['b', 'a', 'r']}
# input(Int32[n]) # => [1, 2, 3, 4, 5]
# ```
# ```
# n, m = input(i, i64) # => {5, 5i64}
# input(s, c[m]) # => {"foo", ['b', 'a', 'r']}
# input(i[n]) # => [1, 2, 3, 4, 5]
# ```
#
# Input:
# ```plain
# 2 3
# 1 2 3
# 4 5 6
# ```
#
# ```
# h, w = input(i, i) # => {2, 3}
# input(i[h, w]) # => [[1, 2, 3], [4, 5, 6]]
# ```
# ```
# input(i[i, i]) # => [[1, 2, 3], [4, 5, 6]]
# ```
#
# Input:
# ```plain
# 5 3
# 3 1 4 2 5
# 1 2
# 2 3
# 3 1
# ```
# ```
# n, m = input(i, i) # => {5, 3}
# input(i.pred[n]) # => [2, 0, 3, 1, 4]
# input({i - 1, i - 1}[m]) # => [{0, 1}, {1, 2}, {2, 0}]
# ```
#
# Input:
# ```plain
# 3
# 1 2
# 2 2
# 3 2
# ```
# ```
# input({tmp = i, tmp == 1 ? i : i.pred}[i]) # => [{1, 2}, {2, 1}, {3, 1}]
# ```
#
# Input:
# ```plain
# 3
# 1 1
# 2 1 2
# 5 1 2 3 4 5
# ```
# ```
# n = input(i) # => 3
# input(i[i][n]) # => [[1], [1, 2], [1, 2, 3, 4, 5]]
# ```
#
# Input:
# ```plain
# 3
# 1 2
# 2 3
# 3 1
# ```
# ```
# n = input(i)
# input_column({Int32, Int32}, n) # => {[1, 2, 3], [2, 3, 1]}
# ```
macro input(ast, *, io = STDIN)
{% if ast.is_a?(Call) %}
{% if ast.receiver.is_a?(Nop) %}
internal_input(
{{ast.name}},
{{ast.name}}({% for argument in ast.args %} input({{argument}}, io: {{io}}), {% end %}),
{{io}},
)
{% elsif ast.receiver.is_a?(Path) && ast.receiver.resolve.class.has_method?(ast.name.symbolize) %}
{{ast.receiver}}.{{ast.name}}(
{% for argument in ast.args %} input({{argument}}, io: {{io}}) {% end %}
) {{ast.block}}
{% elsif ast.name.stringify == "[]" %}
internal_input_array({{ast.receiver}}, {{ast.args}}, {{io}})
{% else %}
input({{ast.receiver}}, io: {{io}}).{{ast.name}}(
{% for argument in ast.args %} input({{argument}}, io: {{io}}), {% end %}
) {{ast.block}}
{% end %}
{% elsif ast.is_a?(TupleLiteral) %}
{ {% for i in 0...ast.size %} input({{ast[i]}}, io: {{io}}), {% end %} }
{% elsif ast.is_a?(ArrayLiteral) %}
[ {% for i in 0...ast.size %} input({{ast[i]}}, io: {{io}}), {% end %} ]
{% elsif ast.is_a?(HashLiteral) %}
{ {% for key, value in ast %} input({{key}}, io: {{io}}) => input({{value}}, io: {{io}}), {% end %} }
{% elsif ast.is_a?(NamedTupleLiteral) %}
{ {% for key, value in ast %} {{key}}: input({{value}}, io: {{io}}), {% end %} }
{% elsif ast.is_a?(RangeLiteral) %}
Range.new(
input({{ast.begin}}, io: {{io}}),
input({{ast.end}}, io: {{io}}),
{{ast.excludes_end?}},
)
{% elsif ast.is_a?(SymbolLiteral) %}
{{ast.id}}
{% elsif ast.is_a?(Expressions) %}
( {% for exp in ast.expressions %} input({{exp}}, io: {{io}}); {% end %} )
{% elsif ast.is_a?(If) %}
input({{ast.cond}}, io: {{io}}) ? input({{ast.then}}, io: {{io}}) : input({{ast.else}}, io: {{io}})
{% elsif ast.is_a?(Assign) %}
{{ast.target}} = input({{ast.value}}, io: {{io}})
{% else %}
internal_input({{ast}}, {{ast}}, io: {{io}})
{% end %}
end
macro input(*asts, io = STDIN)
{ {% for ast in asts %} input({{ast}}, io: {{io}}), {% end %} }
end
macro input_column(types, size, *, io = STDIN)
%size = {{size}}
{% for type, i in types %}
%array{i} = Array({{type}}).new(%size)
{% end %}
%size.times do
{% for type, i in types %}
%array{i} << input({{type}}, io: {{io}})
{% end %}
end
{ {% for type, i in types %} %array{i}, {% end %} }
end
n, m = input(i, i)
a = input(i64[n])
xw = input({i - 1, i64}[m])
if xw.sum(&.[1]) < a.min
puts 0
exit
end
puts (1i64..10i64**9).bsearch { |c|
imos = ImosLinear(Int64).new(n)
xw.each do |x, w|
imos.add(x..x, w, 0)
left = {x, w // c}.min
imos.add(x - left, left, w - c * left, c)
right = {n - 1 - x, w // c}.min
imos.add(x + 1, right, w - c, -c)
end
imos.build.zip(a).all? { |imos, a| imos < a }
} || -1