結果

問題 No.448 ゆきこーだーの雨と雪 (3)
ユーザー Grenache
提出日時 2017-09-23 20:32:19
言語 Java
(openjdk 23)
結果
AC  
実行時間 616 ms / 2,000 ms
コード長 5,781 bytes
コンパイル時間 4,431 ms
コンパイル使用メモリ 80,160 KB
実行使用メモリ 64,060 KB
最終ジャッジ日時 2024-11-14 04:27:16
合計ジャッジ時間 19,115 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder448 {

	private static Scanner sc;
	private static Printer pr;

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

		Pair[] td = new Pair[n];
		int[] dd = new int[n];
		long sum = 0;
		for (int i = 0; i < n; i++) {
			int t = sc.nextInt();
			int d = sc.nextInt();
			td[i] = new Pair(t, d);

			dd[i] = d;
			sum += d;
		}
		Arrays.sort(dd);

		int l = -1;
		int r = n - 1;
		while (r - l > 1) {
			int mid = l + (r - l) / 2;
			if (yuki(td, mid, dd) > 0) {
				r = mid;
			} else {
				l = mid;
			}
		}

//		return r;
		if (r == 0) {
			pr.println(0);
			pr.println(0);
		} else {
			pr.println(dd[r - 1]);
			pr.println(sum - yuki(td, r, dd));
		}

	}

	private static int n;
	private static int k;
	private static int[] p;

	private static long yuki(Pair[] td, int mid, int[] dd) {
		if (p == null) {
			p = new int[n];
			p[0] = -1;

			for (int i = 1; i < n; i++) {
				int l = -1;
				int r = i;
				while (r - l > 1) {
					int midd = l + (r - l) / 2;
					if (td[i].t - td[midd].t >= k) {
						l = midd;
					} else {
						r = midd;
					}
				}

//				return l;
				p[i] = l;
			}
		}

		long[] dp = new long[n];

		int pre = -k;

		if (td[0].d >= dd[mid]) {
			pre = td[0].t;
			dp[0] = td[0].d;
		} else {
			dp[0] = td[0].d;
		}

		for (int i = 1; i < n; i++) {
			if (td[i].d >= dd[mid]) {
				if (td[i].t - pre < k) {
					return 0;
				} else {
					pre = td[i].t;
					long tmp;
					if (p[i] < 0) {
						tmp = 0;
					} else {
						tmp = dp[p[i]];
					}
					dp[i] = tmp + td[i].d;
				}
			} else {
				if (td[i].t - pre < k) {
					dp[i] = dp[i - 1];
				} else {
					long tmp;
					if (p[i] < 0) {
						tmp = 0;
					} else {
						tmp = dp[p[i]];
					}
					dp[i] = Math.max(dp[i - 1], tmp + td[i].d);
				}
			}
		}

		return dp[n - 1];
	}

	private static class Pair implements Comparable<Pair> {
		int t;
		int d;

		Pair(int t, int d) {
			this.t = t;
			this.d = d;
		}

		@Override
		public int compareTo(Pair o) {
			return Integer.compare(d, o.d);
		}
	}

	// ---------------------------------------------------
	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