結果
問題 | No.2217 Suffix+ |
ユーザー | tenten |
提出日時 | 2023-12-11 13:58:21 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 369 ms / 2,000 ms |
コード長 | 2,220 bytes |
コンパイル時間 | 2,624 ms |
コンパイル使用メモリ | 90,572 KB |
実行使用メモリ | 62,652 KB |
最終ジャッジ日時 | 2023-12-11 13:58:34 |
合計ジャッジ時間 | 12,823 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
54,004 KB |
testcase_01 | AC | 52 ms
54,008 KB |
testcase_02 | AC | 53 ms
51,932 KB |
testcase_03 | AC | 53 ms
54,004 KB |
testcase_04 | AC | 52 ms
54,000 KB |
testcase_05 | AC | 53 ms
53,992 KB |
testcase_06 | AC | 53 ms
53,996 KB |
testcase_07 | AC | 52 ms
53,996 KB |
testcase_08 | AC | 52 ms
54,016 KB |
testcase_09 | AC | 52 ms
54,008 KB |
testcase_10 | AC | 51 ms
54,008 KB |
testcase_11 | AC | 52 ms
53,996 KB |
testcase_12 | AC | 52 ms
54,016 KB |
testcase_13 | AC | 54 ms
53,996 KB |
testcase_14 | AC | 179 ms
58,460 KB |
testcase_15 | AC | 179 ms
58,984 KB |
testcase_16 | AC | 224 ms
59,732 KB |
testcase_17 | AC | 208 ms
59,740 KB |
testcase_18 | AC | 201 ms
59,068 KB |
testcase_19 | AC | 281 ms
59,768 KB |
testcase_20 | AC | 257 ms
59,740 KB |
testcase_21 | AC | 118 ms
55,788 KB |
testcase_22 | AC | 253 ms
59,696 KB |
testcase_23 | AC | 262 ms
60,048 KB |
testcase_24 | AC | 325 ms
61,676 KB |
testcase_25 | AC | 328 ms
61,680 KB |
testcase_26 | AC | 315 ms
61,668 KB |
testcase_27 | AC | 316 ms
61,672 KB |
testcase_28 | AC | 309 ms
61,740 KB |
testcase_29 | AC | 352 ms
60,516 KB |
testcase_30 | AC | 359 ms
61,972 KB |
testcase_31 | AC | 369 ms
61,740 KB |
testcase_32 | AC | 357 ms
61,672 KB |
testcase_33 | AC | 353 ms
61,636 KB |
testcase_34 | AC | 316 ms
62,652 KB |
testcase_35 | AC | 53 ms
54,012 KB |
testcase_36 | AC | 366 ms
61,748 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]; for (int i = 0; i < n; i++) { values[i] = sc.nextLong(); } long left = 0; long right = Long.MAX_VALUE / 10; while (right - left > 1) { long m = (left + right) / 2; long count = 0; long current = 0; for (int i = 0; i < n && count <= k; i++) { long tmp = (Math.max(0, m - values[i] - current) + i) / (i + 1); current += tmp * (i + 1); count += tmp; } 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(); } }