結果
問題 | No.609 Noelちゃんと星々 |
ユーザー | holeguma |
提出日時 | 2019-07-17 19:04:13 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 285 ms / 2,000 ms |
コード長 | 3,951 bytes |
コンパイル時間 | 4,705 ms |
コンパイル使用メモリ | 74,528 KB |
実行使用メモリ | 56,036 KB |
最終ジャッジ日時 | 2023-08-24 18:24:06 |
合計ジャッジ時間 | 8,355 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 203 ms
54,788 KB |
testcase_01 | AC | 151 ms
53,760 KB |
testcase_02 | AC | 127 ms
54,108 KB |
testcase_03 | AC | 151 ms
53,912 KB |
testcase_04 | AC | 106 ms
54,240 KB |
testcase_05 | AC | 277 ms
56,036 KB |
testcase_06 | AC | 208 ms
54,720 KB |
testcase_07 | AC | 155 ms
53,460 KB |
testcase_08 | AC | 91 ms
52,756 KB |
testcase_09 | AC | 141 ms
53,960 KB |
testcase_10 | AC | 185 ms
54,432 KB |
testcase_11 | AC | 188 ms
54,552 KB |
testcase_12 | AC | 184 ms
53,664 KB |
testcase_13 | AC | 92 ms
53,060 KB |
testcase_14 | AC | 65 ms
48,704 KB |
testcase_15 | AC | 208 ms
55,336 KB |
testcase_16 | AC | 285 ms
55,724 KB |
testcase_17 | AC | 218 ms
53,672 KB |
testcase_18 | AC | 126 ms
53,640 KB |
testcase_19 | AC | 202 ms
55,048 KB |
testcase_20 | AC | 246 ms
55,240 KB |
testcase_21 | AC | 254 ms
55,008 KB |
testcase_22 | AC | 256 ms
55,440 KB |
testcase_23 | AC | 256 ms
55,544 KB |
testcase_24 | AC | 253 ms
54,952 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.util.NoSuchElementException; public class Main { static PrintWriter out; static InputReader ir; static void solve() { int n = ir.nextInt(); long[] y = ir.nextLongArray(n); long[] sum = new long[n + 1]; Arrays.sort(y); for (int i = 0; i < n; i++) { sum[i + 1] = sum[i] + y[i]; } long res = 1L << 60; for (int i = 0; i < n; i++) { res = Math.min(res, calc(y[i], y, sum)); if (y[i] + 1 <= y[n - 1]) { res = Math.min(res, calc(y[i] + 1, y, sum)); } } out.println(res); } static long calc(long x, long[] y, long[] sum) { int n = y.length; int idx = lower_bound(y, 0, n - 1, x); return sum[n] - 2 * sum[idx] + (2 * idx - n) * x; } public static int lower_bound(long[] a, int fromIndex, int toIndex, long val) { if (val > a[toIndex]) return toIndex + 1; if (val <= a[fromIndex]) return fromIndex; int lb = fromIndex - 1, ub = toIndex; while (ub - lb > 1) { int mid = (ub - lb) / 2 + lb; if (a[mid] >= val) { ub = mid; } else { lb = mid; } } return ub; } public static void main(String[] args) { ir = new InputReader(System.in); out = new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer = new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) { this.in = in; this.curbuf = this.lenbuf = 0; } public boolean hasNextByte() { if (curbuf >= lenbuf) { curbuf = 0; try { lenbuf = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (lenbuf <= 0) return false; } return true; } private int readByte() { if (hasNextByte()) return buffer[curbuf++]; else return -1; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private void skip() { while (hasNextByte() && isSpaceChar(buffer[curbuf])) curbuf++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public char[][] nextCharMap(int n, int m) { char[][] map = new char[n][m]; for (int i = 0; i < n; i++) map[i] = next().toCharArray(); return map; } } static void tr(Object... o) { out.println(Arrays.deepToString(o)); } }