結果
問題 | No.2566 美しい整数列 |
ユーザー | tenten |
提出日時 | 2023-12-04 17:36:31 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 928 ms / 2,000 ms |
コード長 | 2,311 bytes |
コンパイル時間 | 2,957 ms |
コンパイル使用メモリ | 92,212 KB |
実行使用メモリ | 75,420 KB |
最終ジャッジ日時 | 2024-09-26 23:05:08 |
合計ジャッジ時間 | 20,845 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
36,612 KB |
testcase_01 | AC | 53 ms
37,164 KB |
testcase_02 | AC | 53 ms
37,164 KB |
testcase_03 | AC | 52 ms
37,072 KB |
testcase_04 | AC | 830 ms
71,808 KB |
testcase_05 | AC | 866 ms
72,408 KB |
testcase_06 | AC | 776 ms
64,968 KB |
testcase_07 | AC | 758 ms
63,748 KB |
testcase_08 | AC | 601 ms
59,004 KB |
testcase_09 | AC | 575 ms
58,500 KB |
testcase_10 | AC | 592 ms
57,796 KB |
testcase_11 | AC | 688 ms
58,740 KB |
testcase_12 | AC | 804 ms
68,576 KB |
testcase_13 | AC | 826 ms
63,468 KB |
testcase_14 | AC | 816 ms
63,424 KB |
testcase_15 | AC | 837 ms
63,296 KB |
testcase_16 | AC | 866 ms
74,528 KB |
testcase_17 | AC | 923 ms
71,428 KB |
testcase_18 | AC | 928 ms
75,420 KB |
testcase_19 | AC | 600 ms
60,680 KB |
testcase_20 | AC | 876 ms
69,140 KB |
testcase_21 | AC | 876 ms
75,240 KB |
testcase_22 | AC | 592 ms
57,572 KB |
testcase_23 | AC | 715 ms
67,300 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); long[] values = new long[n]; for (int i = 0; i < n; i++) { values[i] = sc.nextInt(); } long[] div = new long[m]; for (int i = 0; i < m; i++) { div[i] = sc.nextInt(); } int[] costs = new int[n]; long total = 0; for (int i = 0; i < n; i++) { costs[i] = sc.nextInt(); total += costs[i]; } long current = 0; HashMap<Long, Long> saves = new HashMap<>(); for (int i = 0; i < n; i++) { long tmp = values[i] - current; saves.put(tmp, saves.getOrDefault(tmp, 0L) + costs[i]); current += div[i % m]; } long ans = 0; for (long x : saves.values()) { ans = Math.max(ans, x); } System.out.println(total - ans); } } 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(); } }