結果
問題 | No.738 平らな農地 |
ユーザー | hiromi_ayase |
提出日時 | 2018-09-29 05:17:24 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,182 bytes |
コンパイル時間 | 3,710 ms |
コンパイル使用メモリ | 92,244 KB |
実行使用メモリ | 58,700 KB |
最終ジャッジ日時 | 2024-04-20 12:41:13 |
合計ジャッジ時間 | 45,431 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 113 ms
38,136 KB |
testcase_01 | AC | 125 ms
38,544 KB |
testcase_02 | AC | 166 ms
38,340 KB |
testcase_03 | AC | 95 ms
38,244 KB |
testcase_04 | AC | 94 ms
38,344 KB |
testcase_05 | AC | 152 ms
40,724 KB |
testcase_06 | AC | 167 ms
40,788 KB |
testcase_07 | AC | 173 ms
41,120 KB |
testcase_08 | AC | 132 ms
39,792 KB |
testcase_09 | AC | 124 ms
39,996 KB |
testcase_10 | AC | 107 ms
39,248 KB |
testcase_11 | AC | 130 ms
40,236 KB |
testcase_12 | AC | 123 ms
39,764 KB |
testcase_13 | AC | 150 ms
40,756 KB |
testcase_14 | AC | 121 ms
39,908 KB |
testcase_15 | AC | 679 ms
51,372 KB |
testcase_16 | AC | 675 ms
51,368 KB |
testcase_17 | AC | 668 ms
52,724 KB |
testcase_18 | AC | 657 ms
52,868 KB |
testcase_19 | AC | 551 ms
47,676 KB |
testcase_20 | AC | 684 ms
54,760 KB |
testcase_21 | AC | 662 ms
53,064 KB |
testcase_22 | AC | 698 ms
54,456 KB |
testcase_23 | AC | 664 ms
52,640 KB |
testcase_24 | AC | 573 ms
47,916 KB |
testcase_25 | AC | 129 ms
40,108 KB |
testcase_26 | AC | 119 ms
40,200 KB |
testcase_27 | AC | 123 ms
40,040 KB |
testcase_28 | AC | 126 ms
39,992 KB |
testcase_29 | AC | 132 ms
40,176 KB |
testcase_30 | AC | 128 ms
39,892 KB |
testcase_31 | AC | 138 ms
40,020 KB |
testcase_32 | AC | 118 ms
40,136 KB |
testcase_33 | AC | 138 ms
40,392 KB |
testcase_34 | AC | 123 ms
39,896 KB |
testcase_35 | AC | 120 ms
40,356 KB |
testcase_36 | AC | 127 ms
40,032 KB |
testcase_37 | AC | 121 ms
40,312 KB |
testcase_38 | AC | 123 ms
40,016 KB |
testcase_39 | AC | 125 ms
40,120 KB |
testcase_40 | AC | 120 ms
40,280 KB |
testcase_41 | AC | 127 ms
40,376 KB |
testcase_42 | AC | 120 ms
39,992 KB |
testcase_43 | AC | 137 ms
40,536 KB |
testcase_44 | AC | 127 ms
40,560 KB |
testcase_45 | AC | 680 ms
55,648 KB |
testcase_46 | AC | 713 ms
55,736 KB |
testcase_47 | AC | 671 ms
52,608 KB |
testcase_48 | AC | 609 ms
52,556 KB |
testcase_49 | AC | 677 ms
51,908 KB |
testcase_50 | AC | 608 ms
52,408 KB |
testcase_51 | AC | 681 ms
52,280 KB |
testcase_52 | AC | 680 ms
53,716 KB |
testcase_53 | AC | 619 ms
53,016 KB |
testcase_54 | AC | 678 ms
53,468 KB |
testcase_55 | AC | 673 ms
54,692 KB |
testcase_56 | AC | 681 ms
55,804 KB |
testcase_57 | AC | 683 ms
51,396 KB |
testcase_58 | AC | 668 ms
55,908 KB |
testcase_59 | AC | 659 ms
52,980 KB |
testcase_60 | AC | 709 ms
53,724 KB |
testcase_61 | AC | 662 ms
53,096 KB |
testcase_62 | AC | 689 ms
52,548 KB |
testcase_63 | AC | 705 ms
53,884 KB |
testcase_64 | AC | 664 ms
52,396 KB |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | AC | 519 ms
54,004 KB |
testcase_68 | AC | 586 ms
54,248 KB |
testcase_69 | AC | 580 ms
49,804 KB |
testcase_70 | AC | 567 ms
55,480 KB |
testcase_71 | AC | 544 ms
49,340 KB |
testcase_72 | AC | 555 ms
51,280 KB |
testcase_73 | AC | 544 ms
53,760 KB |
testcase_74 | AC | 620 ms
52,096 KB |
testcase_75 | AC | 646 ms
49,696 KB |
testcase_76 | AC | 610 ms
53,996 KB |
testcase_77 | AC | 564 ms
47,972 KB |
testcase_78 | AC | 601 ms
49,648 KB |
testcase_79 | AC | 527 ms
49,616 KB |
testcase_80 | AC | 548 ms
53,352 KB |
testcase_81 | AC | 535 ms
50,236 KB |
testcase_82 | AC | 505 ms
49,368 KB |
testcase_83 | AC | 619 ms
51,140 KB |
testcase_84 | AC | 571 ms
50,556 KB |
testcase_85 | AC | 411 ms
47,816 KB |
testcase_86 | AC | 420 ms
47,712 KB |
testcase_87 | AC | 499 ms
54,040 KB |
testcase_88 | AC | 528 ms
53,856 KB |
testcase_89 | AC | 90 ms
38,268 KB |
testcase_90 | AC | 98 ms
38,140 KB |
testcase_91 | WA | - |
ソースコード
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}; int[] u = new int[] {a[i], i}; if (setL.last()[0] <= a[i]) { setH.add(u); sumH += a[i]; } else { setL.add(u); sumL += 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]; } while (setL.size()> setH.size()) { int[] v = setL.pollLast(); setH.add(v); sumL -= v[0]; sumH += v[0]; } mid = setH.first()[0]; if (sumH < mid * setH.size()) { System.out.println("Error1"); } if (sumL > mid * setL.size()) { System.out.println("Error2"); } 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)); } }