結果
問題 | No.448 ゆきこーだーの雨と雪 (3) |
ユーザー | 37zigen |
提出日時 | 2016-11-17 17:18:49 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,107 ms / 2,000 ms |
コード長 | 2,149 bytes |
コンパイル時間 | 3,602 ms |
コンパイル使用メモリ | 78,056 KB |
実行使用メモリ | 67,300 KB |
最終ジャッジ日時 | 2023-09-02 12:49:08 |
合計ジャッジ時間 | 30,482 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 125 ms
55,784 KB |
testcase_01 | AC | 131 ms
55,700 KB |
testcase_02 | AC | 128 ms
55,664 KB |
testcase_03 | AC | 127 ms
55,844 KB |
testcase_04 | AC | 178 ms
55,876 KB |
testcase_05 | AC | 189 ms
56,636 KB |
testcase_06 | AC | 203 ms
58,572 KB |
testcase_07 | AC | 189 ms
55,588 KB |
testcase_08 | AC | 189 ms
55,880 KB |
testcase_09 | AC | 196 ms
56,164 KB |
testcase_10 | AC | 160 ms
55,968 KB |
testcase_11 | AC | 196 ms
56,500 KB |
testcase_12 | AC | 195 ms
56,556 KB |
testcase_13 | AC | 519 ms
60,536 KB |
testcase_14 | AC | 496 ms
60,432 KB |
testcase_15 | AC | 758 ms
64,720 KB |
testcase_16 | AC | 910 ms
64,548 KB |
testcase_17 | AC | 923 ms
65,012 KB |
testcase_18 | AC | 455 ms
60,392 KB |
testcase_19 | AC | 1,094 ms
66,904 KB |
testcase_20 | AC | 659 ms
63,944 KB |
testcase_21 | AC | 1,034 ms
66,544 KB |
testcase_22 | AC | 671 ms
63,764 KB |
testcase_23 | AC | 1,004 ms
66,696 KB |
testcase_24 | AC | 582 ms
60,552 KB |
testcase_25 | AC | 1,100 ms
66,816 KB |
testcase_26 | AC | 450 ms
60,484 KB |
testcase_27 | AC | 927 ms
64,448 KB |
testcase_28 | AC | 903 ms
64,884 KB |
testcase_29 | AC | 707 ms
64,832 KB |
testcase_30 | AC | 1,018 ms
65,140 KB |
testcase_31 | AC | 473 ms
60,548 KB |
testcase_32 | AC | 536 ms
60,380 KB |
testcase_33 | AC | 1,027 ms
66,460 KB |
testcase_34 | AC | 1,073 ms
67,156 KB |
testcase_35 | AC | 1,107 ms
67,300 KB |
testcase_36 | AC | 1,047 ms
67,268 KB |
testcase_37 | AC | 1,100 ms
66,952 KB |
testcase_38 | AC | 1,031 ms
66,768 KB |
ソースコード
package yukicoder; import java.util.*; public class Q448 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int K = sc.nextInt(); int[] T = new int[N]; int[] D = new int[N]; int max = -1; for (int i = 0; i < N; ++i) { T[i] = sc.nextInt(); D[i] = sc.nextInt(); max = Math.max(max, D[i]); } { assert 1 <= N && N <= 2 * 1_000_00; assert 1 <= K && K <= 1_000_000_000; for (int i = 0; i < N; ++i) { assert 1 <= T[i] && T[i] <= 1_000_000_000; assert 1 <= D[i] && D[i] <= 1_000_000_000; if (i + 1 < N) assert T[i] < T[i + 1]; } } int left = -1; int right = max; outer: while (right - left > 1) { int middle = (left + right) / 2; int preTime = -K; for (int i = 0; i < N; ++i) { if (D[i] > middle) { if (T[i] - preTime < K) { left = middle; continue outer; } else preTime = T[i]; } } right = middle; } max = right; System.out.println(max); int[] count = new int[N]; int preTime = -K; for (int i = 0; i < N; ++i) { if (D[i] > max) { preTime = T[i]; } else { if (preTime + K <= T[i]) { ++count[i]; } } } preTime = T[N - 1] + K; for (int i = N - 1; i >= 0; --i) { if (D[i] > max) { preTime = T[i]; } else { if (preTime >= T[i] + K) { ++count[i]; } } } int[] pendingIndex = new int[N]; int pos = 0; for (int i = 0; i < N; ++i) { if (count[i] == 2) { pendingIndex[pos++] = i; } } pendingIndex = Arrays.copyOf(pendingIndex, pos); long[] dp = new long[pos]; int pre = -1; for (int i = 0; i < pos; ++i) { while (pre + 1 < pos && T[pendingIndex[i]] >= T[pendingIndex[pre + 1]] + K) { ++pre; } if (i > 0) dp[i] = dp[i - 1]; dp[i] = Math.max(dp[i], D[pendingIndex[i]] + (pre >= 0 ? dp[pre] : 0)); } long sum = 0; for (int i = 0; i < N; ++i) { if (D[i] <= max) { sum += D[i]; } } System.out.println(sum - (pos > 0 ? dp[pos - 1] : 0)); sc.close(); } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }