結果
問題 | No.2217 Suffix+ |
ユーザー | tenten |
提出日時 | 2023-07-26 15:00:04 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 336 ms / 2,000 ms |
コード長 | 2,265 bytes |
コンパイル時間 | 2,864 ms |
コンパイル使用メモリ | 84,944 KB |
実行使用メモリ | 58,744 KB |
最終ジャッジ日時 | 2024-04-14 04:54:23 |
合計ジャッジ時間 | 11,675 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
50,604 KB |
testcase_01 | AC | 57 ms
50,400 KB |
testcase_02 | AC | 54 ms
50,388 KB |
testcase_03 | AC | 53 ms
50,440 KB |
testcase_04 | AC | 54 ms
50,164 KB |
testcase_05 | AC | 53 ms
50,452 KB |
testcase_06 | AC | 54 ms
50,424 KB |
testcase_07 | AC | 54 ms
50,452 KB |
testcase_08 | AC | 54 ms
50,340 KB |
testcase_09 | AC | 53 ms
50,416 KB |
testcase_10 | AC | 54 ms
50,260 KB |
testcase_11 | AC | 55 ms
50,028 KB |
testcase_12 | AC | 53 ms
50,436 KB |
testcase_13 | AC | 53 ms
50,404 KB |
testcase_14 | AC | 160 ms
54,532 KB |
testcase_15 | AC | 160 ms
54,364 KB |
testcase_16 | AC | 195 ms
55,672 KB |
testcase_17 | AC | 196 ms
56,216 KB |
testcase_18 | AC | 171 ms
54,424 KB |
testcase_19 | AC | 247 ms
56,056 KB |
testcase_20 | AC | 224 ms
55,704 KB |
testcase_21 | AC | 133 ms
52,444 KB |
testcase_22 | AC | 241 ms
55,936 KB |
testcase_23 | AC | 249 ms
56,336 KB |
testcase_24 | AC | 266 ms
57,764 KB |
testcase_25 | AC | 269 ms
57,904 KB |
testcase_26 | AC | 267 ms
57,908 KB |
testcase_27 | AC | 267 ms
57,864 KB |
testcase_28 | AC | 262 ms
57,856 KB |
testcase_29 | AC | 319 ms
57,788 KB |
testcase_30 | AC | 321 ms
57,984 KB |
testcase_31 | AC | 318 ms
57,980 KB |
testcase_32 | AC | 323 ms
57,868 KB |
testcase_33 | AC | 336 ms
57,864 KB |
testcase_34 | AC | 269 ms
58,744 KB |
testcase_35 | AC | 52 ms
50,232 KB |
testcase_36 | AC | 336 ms
57,928 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(); } }