結果

問題 No.609 Noelちゃんと星々
ユーザー holegumaholeguma
提出日時 2019-07-17 18:59:34
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,055 bytes
コンパイル時間 2,090 ms
コンパイル使用メモリ 74,660 KB
実行使用メモリ 55,228 KB
最終ジャッジ日時 2023-08-24 18:23:02
合計ジャッジ時間 7,220 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 109 ms
52,880 KB
testcase_02 AC 99 ms
52,984 KB
testcase_03 WA -
testcase_04 AC 86 ms
52,560 KB
testcase_05 AC 181 ms
54,800 KB
testcase_06 AC 168 ms
54,760 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 144 ms
54,256 KB
testcase_11 AC 142 ms
54,128 KB
testcase_12 WA -
testcase_13 AC 84 ms
53,116 KB
testcase_14 WA -
testcase_15 AC 170 ms
54,700 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 171 ms
54,972 KB
testcase_20 AC 188 ms
54,980 KB
testcase_21 AC 190 ms
54,864 KB
testcase_22 AC 186 ms
55,228 KB
testcase_23 AC 186 ms
54,644 KB
testcase_24 AC 188 ms
54,824 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 ub = y[n - 1], lb = y[0];
		for (int i = 0; i < 1000; i++) {
			long lmid = (lb * 2 + ub) / 3;
			long umid = (lb + ub * 2) / 3;
			if (calc(lmid, y, sum) >= calc(umid, y, sum)) {
				lb = lmid;
			} else {
				ub = umid;
			}
		}
		out.println(Math.min(calc(lb, y, sum), calc(ub, y, sum)));
	}

	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] - sum[idx] - (n - idx) * x + idx * x - sum[idx];
	}

	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));
	}
}
0