結果
問題 | No.2227 King Kraken's Attack |
ユーザー | 👑 kakel-san |
提出日時 | 2023-02-24 23:26:56 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,289 bytes |
コンパイル時間 | 1,065 ms |
コンパイル使用メモリ | 111,968 KB |
実行使用メモリ | 27,388 KB |
最終ジャッジ日時 | 2024-04-10 09:38:43 |
合計ジャッジ時間 | 26,540 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
24,988 KB |
testcase_01 | AC | 27 ms
25,112 KB |
testcase_02 | AC | 27 ms
27,148 KB |
testcase_03 | AC | 30 ms
24,992 KB |
testcase_04 | AC | 26 ms
24,860 KB |
testcase_05 | AC | 26 ms
24,988 KB |
testcase_06 | AC | 27 ms
23,088 KB |
testcase_07 | AC | 26 ms
23,092 KB |
testcase_08 | AC | 27 ms
25,088 KB |
testcase_09 | AC | 28 ms
24,984 KB |
testcase_10 | AC | 28 ms
25,112 KB |
testcase_11 | AC | 28 ms
27,256 KB |
testcase_12 | AC | 28 ms
25,248 KB |
testcase_13 | AC | 28 ms
25,116 KB |
testcase_14 | AC | 28 ms
27,032 KB |
testcase_15 | AC | 27 ms
27,160 KB |
testcase_16 | AC | 26 ms
26,884 KB |
testcase_17 | AC | 1,430 ms
24,884 KB |
testcase_18 | WA | - |
testcase_19 | AC | 26 ms
25,088 KB |
testcase_20 | AC | 1,329 ms
25,216 KB |
testcase_21 | AC | 1,360 ms
24,988 KB |
testcase_22 | AC | 360 ms
25,376 KB |
testcase_23 | AC | 52 ms
27,000 KB |
testcase_24 | AC | 735 ms
25,248 KB |
testcase_25 | AC | 1,325 ms
23,092 KB |
testcase_26 | AC | 1,560 ms
23,088 KB |
testcase_27 | WA | - |
testcase_28 | AC | 1,360 ms
25,088 KB |
testcase_29 | AC | 1,316 ms
25,012 KB |
testcase_30 | AC | 1,397 ms
25,348 KB |
testcase_31 | AC | 1,192 ms
23,092 KB |
testcase_32 | AC | 602 ms
25,136 KB |
testcase_33 | AC | 515 ms
27,008 KB |
testcase_34 | AC | 375 ms
27,000 KB |
testcase_35 | AC | 637 ms
27,004 KB |
testcase_36 | AC | 627 ms
24,988 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | AC | 25 ms
24,988 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static long[] NList => ReadLine().Split().Select(long.Parse).ToArray(); public static void Main() { Solve(); } static void Test() { var r = new Random(); var count = 0; var max = 2000; while (true) { var h = r.Next(max) + 1; var w = r.Next(max) + 1; var la = r.Next(max) + 1; var lb = r.Next(max) + 1; var ka = r.Next(max); var kb = r.Next(max); // 愚直解 var s1 = All(h, w, la, lb, ka, kb); // 作成解 var s2 = Attack(h, w, la, lb, ka, kb); if (s1 != s2) { WriteLine($"{h} {w} {la} {lb} {ka} {kb}"); WriteLine(s1); WriteLine(s2); return; } ++count; if (count % 10 == 0) WriteLine(count); } } static long All(long h, long w, long la, long lb, long ka, long kb) { var ans = long.MaxValue; for (var ai = 0; Math.Max(ai, ai * ka) <= h * w + ka; ++ai) for (var bi = 0; Math.Max(bi, bi * kb) <= h * w + kb; ++bi) { var hs = Math.Min(h, ai * la); var ws = Math.Min(w, bi * lb); if (hs * ws + ai * ka + bi * kb >= h * w) ans = Math.Min(ans, ai + bi); } return ans; } static void Solve() { var c = NList; var (h, w, la, lb, ka, kb) = (c[0], c[1], c[2], c[3], c[4], c[5]); WriteLine(Attack(h, w, la, lb, ka, kb)); } static long Attack(long h, long w, long la, long lb, long ka, long kb) { var horimax = (h + la - 1) / la; var vertmax = (w + lb - 1) / lb; // var ans = horimax + vertmax; var kmax = Math.Max(ka, kb); if (kmax == 0) { // return ans; return horimax + vertmax; } var ans = long.MaxValue; for (var ai = 0; ai <= h; ++ai) { if (ai == 0 && kb == 0) continue; var ok = h * w; var ng = -1L; while (ok - ng > 1) { var mid = (ok + ng) / 2; var hs = Math.Min(h, ai * la); var ws = Math.Min(w, mid * lb); var cnt = hs * ws + ai * ka + mid * kb; if (cnt >= h * w) ok = mid; else ng = mid; } ans = Math.Min(ans, ai + ok); } for (var bi = 0; bi <= w; ++bi) { if (bi == 0 && ka == 0) continue; var ok = h * w; var ng = -1L; while (ok - ng > 1) { var mid = (ok + ng) / 2; var hs = Math.Min(h, mid * la); var ws = Math.Min(w, bi * lb); var cnt = hs * ws + bi * kb + mid * ka; if (cnt >= h * w) ok = mid; else ng = mid; } ans = Math.Min(ans, bi + ok); } return ans; } }