結果
問題 | No.2260 Adic Sum |
ユーザー | tenten |
提出日時 | 2023-04-10 10:34:27 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,187 ms / 2,000 ms |
コード長 | 2,353 bytes |
コンパイル時間 | 2,488 ms |
コンパイル使用メモリ | 95,920 KB |
実行使用メモリ | 62,340 KB |
最終ジャッジ日時 | 2024-10-06 07:30:56 |
合計ジャッジ時間 | 17,121 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
37,164 KB |
testcase_01 | AC | 50 ms
37,020 KB |
testcase_02 | AC | 53 ms
37,320 KB |
testcase_03 | AC | 54 ms
37,004 KB |
testcase_04 | AC | 54 ms
37,196 KB |
testcase_05 | AC | 54 ms
37,176 KB |
testcase_06 | AC | 53 ms
36,932 KB |
testcase_07 | AC | 52 ms
37,184 KB |
testcase_08 | AC | 103 ms
39,688 KB |
testcase_09 | AC | 78 ms
38,076 KB |
testcase_10 | AC | 99 ms
40,012 KB |
testcase_11 | AC | 55 ms
37,100 KB |
testcase_12 | AC | 100 ms
39,464 KB |
testcase_13 | AC | 102 ms
39,484 KB |
testcase_14 | AC | 242 ms
47,384 KB |
testcase_15 | AC | 299 ms
49,796 KB |
testcase_16 | AC | 231 ms
47,744 KB |
testcase_17 | AC | 273 ms
49,204 KB |
testcase_18 | AC | 866 ms
56,892 KB |
testcase_19 | AC | 940 ms
56,836 KB |
testcase_20 | AC | 821 ms
56,896 KB |
testcase_21 | AC | 737 ms
56,804 KB |
testcase_22 | AC | 657 ms
56,264 KB |
testcase_23 | AC | 515 ms
57,976 KB |
testcase_24 | AC | 978 ms
62,340 KB |
testcase_25 | AC | 332 ms
52,240 KB |
testcase_26 | AC | 362 ms
51,796 KB |
testcase_27 | AC | 335 ms
51,900 KB |
testcase_28 | AC | 324 ms
52,500 KB |
testcase_29 | AC | 353 ms
51,924 KB |
testcase_30 | AC | 373 ms
50,192 KB |
testcase_31 | AC | 580 ms
58,436 KB |
testcase_32 | AC | 1,049 ms
59,364 KB |
testcase_33 | AC | 322 ms
53,832 KB |
testcase_34 | AC | 524 ms
59,432 KB |
testcase_35 | AC | 1,187 ms
57,212 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 p = sc.nextInt(); int[] values = new int[n]; for (int i = 0; i < n; i++) { values[i] = sc.nextInt(); } Arrays.sort(values); int current = 1; ArrayList<Integer> ps = new ArrayList<>(); while (current * (long)p <= 1000000000) { current *= p; ps.add(current); } long ans = 0; for (int x : ps) { int[] mods = new int[n]; HashMap<Integer, Integer> counts = new HashMap<>(); for (int i = 0; i < n; i++) { mods[i] = values[i] % x; counts.put(mods[i], counts.getOrDefault(mods[i], 0) + 1); } for (int i = 0; i < n; i++) { counts.put(mods[i], counts.get(mods[i]) - 1); ans += counts.getOrDefault(mods[i], 0); } } System.out.println(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(); } }