結果
問題 | No.1251 絶対に間違ってはいけない最小化問題 |
ユーザー | hiromi_ayase |
提出日時 | 2020-10-09 22:10:56 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,335 bytes |
コンパイル時間 | 2,275 ms |
コンパイル使用メモリ | 89,488 KB |
実行使用メモリ | 77,140 KB |
最終ジャッジ日時 | 2023-09-27 17:35:56 |
合計ジャッジ時間 | 30,700 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 84 ms
50,780 KB |
testcase_01 | AC | 87 ms
53,108 KB |
testcase_02 | AC | 84 ms
53,004 KB |
testcase_03 | AC | 86 ms
53,076 KB |
testcase_04 | AC | 84 ms
53,348 KB |
testcase_05 | AC | 86 ms
53,084 KB |
testcase_06 | AC | 85 ms
53,372 KB |
testcase_07 | AC | 84 ms
51,280 KB |
testcase_08 | AC | 89 ms
52,888 KB |
testcase_09 | AC | 89 ms
53,260 KB |
testcase_10 | AC | 88 ms
53,292 KB |
testcase_11 | AC | 87 ms
53,280 KB |
testcase_12 | AC | 86 ms
53,308 KB |
testcase_13 | AC | 87 ms
52,880 KB |
testcase_14 | AC | 89 ms
53,232 KB |
testcase_15 | AC | 92 ms
53,116 KB |
testcase_16 | AC | 95 ms
53,168 KB |
testcase_17 | AC | 90 ms
53,176 KB |
testcase_18 | AC | 684 ms
74,916 KB |
testcase_19 | AC | 653 ms
77,140 KB |
testcase_20 | AC | 497 ms
61,932 KB |
testcase_21 | AC | 244 ms
59,240 KB |
testcase_22 | AC | 470 ms
67,012 KB |
testcase_23 | AC | 192 ms
57,700 KB |
testcase_24 | AC | 586 ms
69,368 KB |
testcase_25 | AC | 457 ms
67,000 KB |
testcase_26 | AC | 298 ms
60,756 KB |
testcase_27 | AC | 210 ms
58,080 KB |
testcase_28 | AC | 699 ms
75,776 KB |
testcase_29 | AC | 682 ms
75,156 KB |
testcase_30 | AC | 700 ms
75,060 KB |
testcase_31 | AC | 720 ms
75,196 KB |
testcase_32 | AC | 692 ms
75,824 KB |
testcase_33 | AC | 723 ms
75,296 KB |
testcase_34 | AC | 719 ms
73,252 KB |
testcase_35 | AC | 710 ms
74,040 KB |
testcase_36 | AC | 757 ms
73,512 KB |
testcase_37 | AC | 707 ms
74,628 KB |
testcase_38 | AC | 694 ms
73,096 KB |
testcase_39 | AC | 704 ms
75,388 KB |
testcase_40 | AC | 703 ms
75,068 KB |
testcase_41 | AC | 683 ms
72,836 KB |
testcase_42 | AC | 705 ms
75,816 KB |
testcase_43 | WA | - |
testcase_44 | AC | 87 ms
53,044 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); long[][] p = new long[n][2]; long bsum = 0; for (int i = 0; i < n; i++) { p[i][0] = nl(); } for (int i = 0; i < n; i++) { p[i][1] = nl(); bsum += p[i][1]; } if (n == 1) { System.out.println(p[0][0] + " " + f(p, p[0][0])); return; } Arrays.sort(p, (o1, o2) -> Long.compare(o1[0], o2[0])); long s = 0; int arg = 0; for (int i = 0; i < n; i++) { s += p[i][1]; if (s * 2 >= bsum) { arg = i; break; } } if (f(p, p[arg][0]) < f(p, p[arg - 1][0])) { System.out.println(p[arg][0] + " " + f(p, p[arg][0])); } else { System.out.println(p[arg - 1][0] + " " + f(p, p[arg - 1][0])); } } private static long f(long[][] p, long x) { long ret = 0; for (long[] v : p) { ret += v[1] * Math.abs(x - v[0]); } return 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)); } }