結果

問題 No.817 Coin donation
ユーザー holegumaholeguma
提出日時 2019-07-17 13:10:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 144 ms / 2,000 ms
コード長 3,653 bytes
コンパイル時間 2,036 ms
コンパイル使用メモリ 78,268 KB
実行使用メモリ 42,208 KB
最終ジャッジ日時 2024-12-21 08:53:09
合計ジャッジ時間 4,651 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
36,680 KB
testcase_01 AC 50 ms
36,920 KB
testcase_02 AC 49 ms
37,024 KB
testcase_03 AC 53 ms
36,688 KB
testcase_04 AC 55 ms
37,108 KB
testcase_05 AC 64 ms
37,284 KB
testcase_06 AC 92 ms
38,992 KB
testcase_07 AC 101 ms
39,064 KB
testcase_08 AC 131 ms
41,032 KB
testcase_09 AC 106 ms
39,176 KB
testcase_10 AC 144 ms
41,976 KB
testcase_11 AC 133 ms
42,208 KB
testcase_12 AC 136 ms
42,020 KB
testcase_13 AC 50 ms
37,032 KB
testcase_14 AC 52 ms
36,920 KB
testcase_15 AC 51 ms
37,032 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 boolean debug = false;

	static void solve() {
		int n = ir.nextInt();
		int k = ir.nextInt();
		int[][] a = new int[n][];
		for (int i = 0; i < n; i++)
			a[i] = ir.nextIntArray(2);
		int lb = 0, ub = (int) 1e9;
		while (ub - lb > 1) {
			int mid = lb + ((ub - lb) >>> 1);
			if (ok(mid, k, a)) {
				ub = mid;
			} else {
				lb = mid;
			}
		}
		out.println(ub);
	}

	static boolean ok(int x, int k, int[][] a) {
		long m = 0;
		for (int i = 0; i < a.length; i++) {
			if (x > a[i][1])
				m += (a[i][1] - a[i][0] + 1);
			else if (x < a[i][0]) {
			} else {
				m += (x - a[i][0] + 1);
			}

		}
		return m >= k;
	}

	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) {
		if (debug)
			out.println(Arrays.deepToString(o));
	}
}
0