結果
問題 | No.1071 ベホマラー |
ユーザー | hiromi_ayase |
提出日時 | 2020-06-06 07:17:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 305 ms / 2,000 ms |
コード長 | 2,992 bytes |
コンパイル時間 | 4,289 ms |
コンパイル使用メモリ | 78,220 KB |
実行使用メモリ | 60,732 KB |
最終ジャッジ日時 | 2023-08-24 15:02:02 |
合計ジャッジ時間 | 9,651 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
50,940 KB |
testcase_01 | AC | 68 ms
50,592 KB |
testcase_02 | AC | 70 ms
51,096 KB |
testcase_03 | AC | 68 ms
50,748 KB |
testcase_04 | AC | 68 ms
51,088 KB |
testcase_05 | AC | 68 ms
48,848 KB |
testcase_06 | AC | 70 ms
50,716 KB |
testcase_07 | AC | 71 ms
51,156 KB |
testcase_08 | AC | 71 ms
50,796 KB |
testcase_09 | AC | 68 ms
51,120 KB |
testcase_10 | AC | 282 ms
59,564 KB |
testcase_11 | AC | 285 ms
59,612 KB |
testcase_12 | AC | 244 ms
57,460 KB |
testcase_13 | AC | 274 ms
56,924 KB |
testcase_14 | AC | 288 ms
59,500 KB |
testcase_15 | AC | 292 ms
60,732 KB |
testcase_16 | AC | 288 ms
59,340 KB |
testcase_17 | AC | 305 ms
59,184 KB |
testcase_18 | AC | 297 ms
58,952 KB |
testcase_19 | AC | 297 ms
59,532 KB |
testcase_20 | AC | 253 ms
58,992 KB |
testcase_21 | AC | 255 ms
58,868 KB |
testcase_22 | AC | 251 ms
59,248 KB |
testcase_23 | AC | 263 ms
58,952 KB |
testcase_24 | AC | 294 ms
59,552 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); long k = nl(); long x = nl(); long y = nl(); long[] a = nal(n); for (int i = 0; i < n; i++) { a[i]--; } Arrays.sort(a); for (int i = 0, j = n - 1; i < j; i++, j--) { long tmp = a[i]; a[i] = a[j]; a[j] = tmp; } // last * x <= y // last <= y / x int s = (int) (y / x); long yn = s < n ? (a[s] + k - 1) / k : 0; long ret = yn * y; for (int i = 0; i < Math.min(s, n); i++) { ret += (Math.max(a[i] - yn * k, 0) + k - 1) / k * x; } System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }