結果

問題 No.609 Noelちゃんと星々
ユーザー GrenacheGrenache
提出日時 2017-12-10 15:22:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 207 ms / 2,000 ms
コード長 4,463 bytes
コンパイル時間 3,681 ms
コンパイル使用メモリ 78,236 KB
実行使用メモリ 55,460 KB
最終ジャッジ日時 2024-11-30 11:17:46
合計ジャッジ時間 9,431 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 190 ms
53,372 KB
testcase_01 AC 165 ms
55,460 KB
testcase_02 AC 151 ms
53,220 KB
testcase_03 AC 171 ms
53,728 KB
testcase_04 AC 136 ms
51,984 KB
testcase_05 AC 200 ms
53,748 KB
testcase_06 AC 188 ms
53,364 KB
testcase_07 AC 174 ms
53,656 KB
testcase_08 AC 118 ms
53,012 KB
testcase_09 AC 156 ms
53,396 KB
testcase_10 AC 188 ms
53,660 KB
testcase_11 AC 177 ms
53,560 KB
testcase_12 AC 188 ms
53,656 KB
testcase_13 AC 129 ms
53,676 KB
testcase_14 AC 105 ms
52,248 KB
testcase_15 AC 199 ms
53,796 KB
testcase_16 AC 201 ms
53,696 KB
testcase_17 AC 189 ms
53,384 KB
testcase_18 AC 142 ms
53,404 KB
testcase_19 AC 190 ms
53,468 KB
testcase_20 AC 196 ms
53,736 KB
testcase_21 AC 198 ms
53,516 KB
testcase_22 AC 202 ms
53,756 KB
testcase_23 AC 207 ms
53,648 KB
testcase_24 AC 202 ms
53,492 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder609 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		int[] y = new int[n];
		for (int i = 0; i < n; i++) {
			y[i] = sc.nextInt();
		}

        // 整数の三分探索(Ternary search)
		// (l, r]
        long l = -2_000_000_000;
        long r = 2_000_000_000;
		while (r - l > 1) {
			long mid = l + (r - l) / 2;
			long f1 = f(mid + 1, y);
			long f2 = f(mid, y);
			if (f1 - f2 >= 0) {
				r = mid;
			} else {
				l = mid;
			}
		}

		pr.println(f(r, y));
	}

	private static long f(long x, int[] y) {
		int n = y.length;

		long ret = 0;
		for (int i = 0; i < n; i++) {
			ret += Math.abs(y[i] - x);
		}

		return ret;
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0