結果
問題 | No.2217 Suffix+ |
ユーザー | tenten |
提出日時 | 2023-07-26 15:00:04 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 326 ms / 2,000 ms |
コード長 | 2,265 bytes |
コンパイル時間 | 2,577 ms |
コンパイル使用メモリ | 82,792 KB |
実行使用メモリ | 58,636 KB |
最終ジャッジ日時 | 2024-10-03 02:05:42 |
合計ジャッジ時間 | 10,960 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
50,440 KB |
testcase_01 | AC | 55 ms
50,148 KB |
testcase_02 | AC | 54 ms
50,412 KB |
testcase_03 | AC | 55 ms
50,280 KB |
testcase_04 | AC | 54 ms
50,288 KB |
testcase_05 | AC | 53 ms
50,144 KB |
testcase_06 | AC | 54 ms
50,328 KB |
testcase_07 | AC | 54 ms
50,288 KB |
testcase_08 | AC | 56 ms
50,316 KB |
testcase_09 | AC | 54 ms
50,472 KB |
testcase_10 | AC | 54 ms
50,300 KB |
testcase_11 | AC | 58 ms
50,140 KB |
testcase_12 | AC | 54 ms
50,084 KB |
testcase_13 | AC | 53 ms
49,888 KB |
testcase_14 | AC | 158 ms
54,500 KB |
testcase_15 | AC | 162 ms
54,552 KB |
testcase_16 | AC | 187 ms
55,496 KB |
testcase_17 | AC | 184 ms
56,060 KB |
testcase_18 | AC | 158 ms
54,248 KB |
testcase_19 | AC | 249 ms
55,836 KB |
testcase_20 | AC | 219 ms
55,972 KB |
testcase_21 | AC | 130 ms
52,236 KB |
testcase_22 | AC | 227 ms
56,032 KB |
testcase_23 | AC | 231 ms
56,192 KB |
testcase_24 | AC | 258 ms
57,740 KB |
testcase_25 | AC | 261 ms
57,800 KB |
testcase_26 | AC | 264 ms
57,852 KB |
testcase_27 | AC | 265 ms
57,704 KB |
testcase_28 | AC | 260 ms
57,836 KB |
testcase_29 | AC | 307 ms
57,812 KB |
testcase_30 | AC | 316 ms
58,168 KB |
testcase_31 | AC | 315 ms
57,764 KB |
testcase_32 | AC | 311 ms
57,812 KB |
testcase_33 | AC | 314 ms
57,764 KB |
testcase_34 | AC | 262 ms
58,636 KB |
testcase_35 | AC | 54 ms
50,376 KB |
testcase_36 | AC | 326 ms
57,816 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static final int MOD = 998244353; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int k = sc.nextInt(); long[] values = new long[n + 1]; for (int i = 1; i <= n; i++) { values[i] = sc.nextLong(); } long left = 0; long right = Long.MAX_VALUE / 2; while (right - left > 1) { long m = (left + right) / 2; long add = 0; long count = 0; for (int i = 1; i <= n && count <= k; i++) { if (values[i] + add < m) { long div = (m - values[i] - add + i - 1) / i; count += div; add += div * i; } } if (count <= k) { left = m; } else { right = m; } } System.out.println(left); } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }