結果
問題 | No.738 平らな農地 |
ユーザー | hiromi_ayase |
提出日時 | 2018-09-29 04:56:02 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,738 bytes |
コンパイル時間 | 2,296 ms |
コンパイル使用メモリ | 91,200 KB |
実行使用メモリ | 53,756 KB |
最終ジャッジ日時 | 2024-04-20 12:38:37 |
合計ジャッジ時間 | 32,660 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
38,552 KB |
testcase_01 | AC | 72 ms
38,236 KB |
testcase_02 | AC | 70 ms
38,368 KB |
testcase_03 | AC | 70 ms
38,428 KB |
testcase_04 | AC | 71 ms
38,124 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 94 ms
40,036 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
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 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | AC | 328 ms
47,324 KB |
testcase_66 | AC | 323 ms
47,264 KB |
testcase_67 | AC | 409 ms
53,280 KB |
testcase_68 | AC | 460 ms
53,584 KB |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | AC | 418 ms
48,976 KB |
testcase_72 | AC | 430 ms
51,136 KB |
testcase_73 | AC | 439 ms
52,888 KB |
testcase_74 | AC | 484 ms
51,468 KB |
testcase_75 | AC | 494 ms
49,492 KB |
testcase_76 | AC | 463 ms
53,552 KB |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | AC | 429 ms
49,628 KB |
testcase_80 | AC | 440 ms
53,016 KB |
testcase_81 | AC | 424 ms
48,680 KB |
testcase_82 | AC | 409 ms
48,452 KB |
testcase_83 | AC | 528 ms
50,996 KB |
testcase_84 | AC | 461 ms
51,416 KB |
testcase_85 | AC | 333 ms
47,536 KB |
testcase_86 | AC | 310 ms
47,668 KB |
testcase_87 | AC | 408 ms
53,524 KB |
testcase_88 | AC | 400 ms
53,756 KB |
testcase_89 | AC | 73 ms
38,244 KB |
testcase_90 | AC | 71 ms
38,108 KB |
testcase_91 | AC | 71 ms
38,320 KB |
ソースコード
import java.util.TreeSet; public class Main { private static void solve() { int n = ni(); int k = ni(); int[] a = na(n); long sumH = 0; long sumL = 0; TreeSet<int[]> setH = new TreeSet<>((o1, o2) -> o1[0] == o2[0] ? o1[1] - o2[1] : o1[0] - o2[0]); TreeSet<int[]> setL = new TreeSet<>((o1, o2) -> o1[0] == o2[0] ? o1[1] - o2[1] : o1[0] - o2[0]); for (int i = 0; i < k; i ++) { sumH += a[i]; setH.add(new int[] {a[i], i}); } for (int i = 0; i < k / 2; i ++) { int[] v = setH.pollFirst(); setL.add(v); sumH -= v[0]; sumL += v[0]; } long mid = setH.first()[0]; long ret = Math.abs(sumH - mid * setH.size()) + Math.abs(sumL - mid * setL.size()); for (int i = k; i < n; i ++) { int[] first = new int[] {a[i - k], i - k}; setH.add(new int[] {a[i], i}); sumH += a[i]; if (setH.contains(first)) { setH.remove(first); sumH -= first[0]; } else { setL.remove(first); sumL -= first[0]; } while (setH.size()> setL.size() + 1) { int[] v = setH.pollFirst(); setL.add(v); sumH -= v[0]; sumL += v[0]; } mid = setH.first()[0]; long now = Math.abs(sumH - mid * setH.size()) + Math.abs(sumL - mid * setL.size()); ret = Math.min(now, ret); } 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)); } }