結果
問題 | No.759 悪くない忘年会にしような! |
ユーザー | te-sh |
提出日時 | 2021-07-14 23:12:14 |
言語 | Crystal (1.11.2) |
結果 |
AC
|
実行時間 | 319 ms / 2,000 ms |
コード長 | 6,696 bytes |
コンパイル時間 | 12,745 ms |
コンパイル使用メモリ | 307,300 KB |
実行使用メモリ | 15,668 KB |
最終ジャッジ日時 | 2024-07-03 23:50:36 |
合計ジャッジ時間 | 17,050 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,812 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,948 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,940 KB |
testcase_24 | AC | 2 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,940 KB |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,944 KB |
testcase_29 | AC | 2 ms
6,944 KB |
testcase_30 | AC | 2 ms
6,944 KB |
testcase_31 | AC | 2 ms
6,940 KB |
testcase_32 | AC | 2 ms
6,940 KB |
testcase_33 | AC | 10 ms
6,944 KB |
testcase_34 | AC | 3 ms
6,940 KB |
testcase_35 | AC | 6 ms
6,944 KB |
testcase_36 | AC | 9 ms
6,940 KB |
testcase_37 | AC | 3 ms
6,940 KB |
testcase_38 | AC | 10 ms
6,944 KB |
testcase_39 | AC | 4 ms
6,944 KB |
testcase_40 | AC | 7 ms
6,944 KB |
testcase_41 | AC | 9 ms
6,940 KB |
testcase_42 | AC | 10 ms
6,944 KB |
testcase_43 | AC | 11 ms
6,940 KB |
testcase_44 | AC | 85 ms
14,416 KB |
testcase_45 | AC | 78 ms
14,492 KB |
testcase_46 | AC | 80 ms
14,364 KB |
testcase_47 | AC | 84 ms
14,368 KB |
testcase_48 | AC | 81 ms
14,520 KB |
testcase_49 | AC | 9 ms
6,940 KB |
testcase_50 | AC | 9 ms
6,944 KB |
testcase_51 | AC | 9 ms
6,944 KB |
testcase_52 | AC | 8 ms
6,944 KB |
testcase_53 | AC | 78 ms
14,532 KB |
testcase_54 | AC | 79 ms
14,420 KB |
testcase_55 | AC | 80 ms
14,512 KB |
testcase_56 | AC | 80 ms
14,352 KB |
testcase_57 | AC | 80 ms
14,504 KB |
testcase_58 | AC | 80 ms
14,468 KB |
testcase_59 | AC | 80 ms
14,404 KB |
testcase_60 | AC | 80 ms
14,392 KB |
testcase_61 | AC | 78 ms
14,564 KB |
testcase_62 | AC | 82 ms
14,392 KB |
testcase_63 | AC | 309 ms
15,668 KB |
testcase_64 | AC | 319 ms
14,908 KB |
testcase_65 | AC | 80 ms
14,412 KB |
testcase_66 | AC | 279 ms
14,824 KB |
ソースコード
def solve(io) n = io.get p, t, r = io.get3_c(n) s = Array.new(n) { |i| Shop.new(p[i]+1, t[i]+1, r[i]+1, i) } s.sort_by! { |si| [-si.p, -si.t, -si.r] } st = SegmentTree(Int32).new(10**4+2) { |a, b| Math.max(a, b) } b = Array.new(n, true) s.each do |si| b[si.i] = false if st[si.t..] >= si.r max_u(st[si.t], si.r) end n.times do |i| io.put i+1 if b[i] end end record Shop, p : Int32, t : Int32, r : Int32, i : Int32 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 Float64 def near_zero? self.abs < EPSILON 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 = IO::Memory.new("") 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 token = @buf.gets(' ', chomp: true) while token.nil? @buf = IO::Memory.new(@ins.read_line) token = @buf.gets(' ', chomp: true) end token 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 SegmentTree(T) def initialize(@n : Int32, @init : T = T.zero, &@compose : (T, T) -> T) @an = 1 << (@n - 1).bit_length @buf = Array.new(@an << 1, @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 << 1, @init) @buf[@an, @n] = b propagate_all end def [](i : Int) @buf[i + @an] end def [](start : Int, count : Int) 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 [](r : Range) sc = Indexable.range_to_index_and_count(r, @n) raise ArgumentError.new("Invalid range") if sc.nil? self[*sc] 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 solve(ProconIO.new)