結果
問題 | No.1008 Bench Craftsman |
ユーザー | siman |
提出日時 | 2023-06-20 18:00:47 |
言語 | Ruby (3.3.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,424 bytes |
コンパイル時間 | 181 ms |
コンパイル使用メモリ | 11,248 KB |
実行使用メモリ | 68,828 KB |
最終ジャッジ日時 | 2023-09-10 13:50:16 |
合計ジャッジ時間 | 41,984 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 85 ms
15,192 KB |
testcase_01 | AC | 80 ms
15,044 KB |
testcase_02 | AC | 83 ms
15,148 KB |
testcase_03 | AC | 81 ms
15,040 KB |
testcase_04 | AC | 81 ms
15,116 KB |
testcase_05 | TLE | - |
testcase_06 | AC | 1,076 ms
68,828 KB |
testcase_07 | AC | 80 ms
15,256 KB |
testcase_08 | AC | 104 ms
15,752 KB |
testcase_09 | AC | 1,375 ms
21,752 KB |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | AC | 508 ms
33,476 KB |
testcase_16 | TLE | - |
testcase_17 | AC | 503 ms
33,504 KB |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | AC | 1,011 ms
49,496 KB |
testcase_21 | AC | 1,001 ms
43,708 KB |
testcase_22 | AC | 1,389 ms
34,108 KB |
testcase_23 | AC | 1,798 ms
52,712 KB |
testcase_24 | AC | 1,841 ms
45,560 KB |
testcase_25 | AC | 1,032 ms
57,268 KB |
testcase_26 | AC | 825 ms
49,564 KB |
testcase_27 | AC | 1,142 ms
29,764 KB |
testcase_28 | AC | 1,472 ms
55,496 KB |
testcase_29 | TLE | - |
コンパイルメッセージ
Main.rb:81: warning: ambiguous first argument; put parentheses or a space even after `-' operator Syntax OK
ソースコード
N, M = gets.split.map(&:to_i) A = gets.split.map(&:to_i) W = Array.new(N) { [] } Q = [] max_w = 0 M.times do x, w = gets.split.map(&:to_i) x -= 1 max_w = w if max_w < w Q << [x, w] W[x] << w end def f(c) cnt = 0 weight = 0 sum = Array.new(N, 0) counter = Array.new(N + 1, 0) remain = Array.new(N + 1, 0) 0.upto(N - 1) do |i| cnt -= counter[i] weight -= remain[i] weight -= c * cnt sum[i] += weight W[i].each do |w| dist = (c == 0) ? N : w / c next if dist == 0 weight += w n_idx = (i + 1) + dist n_idx = N if n_idx > N counter[n_idx] += 1 remain[n_idx] += w % c if c > 0 cnt += 1 end end cnt = 0 weight = 0 counter.fill(0) remain.fill(0) (N - 1).downto(0) do |i| cnt -= counter[i] weight -= remain[i] weight -= c * cnt sum[i] += weight W[i].each do |w| dist = (c == 0) ? -1 : w / c next if dist == 0 n_idx = (i - 1) - dist weight += w cnt += 1 if n_idx >= 0 counter[n_idx] += 1 remain[n_idx] += w % c if c > 0 end end end Q.each do |x, w| sum[x] += w end (0..N - 1).all? { |i| sum[i] < A[i] } end if f(0) puts 0 exit elsif !f(max_w) puts -1 exit else ok = max_w ng = 0 while (ok - ng).abs >= 2 c = (ok + ng) / 2 if f(c) ok = c else ng = c end end puts ok end