結果
問題 | No.990 N×Mマス計算(Kの倍数) |
ユーザー | tenten |
提出日時 | 2022-08-30 12:48:17 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 634 ms / 2,000 ms |
コード長 | 2,796 bytes |
コンパイル時間 | 3,159 ms |
コンパイル使用メモリ | 78,780 KB |
実行使用メモリ | 60,848 KB |
最終ジャッジ日時 | 2024-11-07 07:59:58 |
合計ジャッジ時間 | 8,838 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
37,176 KB |
testcase_01 | AC | 53 ms
37,240 KB |
testcase_02 | AC | 54 ms
37,168 KB |
testcase_03 | AC | 54 ms
37,236 KB |
testcase_04 | AC | 55 ms
37,172 KB |
testcase_05 | AC | 55 ms
37,120 KB |
testcase_06 | AC | 54 ms
37,144 KB |
testcase_07 | AC | 55 ms
37,248 KB |
testcase_08 | AC | 54 ms
36,828 KB |
testcase_09 | AC | 55 ms
37,100 KB |
testcase_10 | AC | 331 ms
49,480 KB |
testcase_11 | AC | 309 ms
46,520 KB |
testcase_12 | AC | 605 ms
48,632 KB |
testcase_13 | AC | 269 ms
45,632 KB |
testcase_14 | AC | 355 ms
46,564 KB |
testcase_15 | AC | 284 ms
45,460 KB |
testcase_16 | AC | 379 ms
49,664 KB |
testcase_17 | AC | 256 ms
45,472 KB |
testcase_18 | AC | 603 ms
48,584 KB |
testcase_19 | AC | 368 ms
46,536 KB |
testcase_20 | AC | 634 ms
60,848 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); int k = sc.nextInt(); if (sc.next().charAt(0) == '+') { HashMap<Integer, Long> bCounts = new HashMap<>(); for (int i = 0; i < m; i++) { int x = sc.nextInt() % k; bCounts.put(x, bCounts.getOrDefault(x, 0L) + 1); } HashMap<Integer, Long> aCounts = new HashMap<>(); for (int i = 0; i < n; i++) { int x = sc.nextInt() % k; aCounts.put(x, aCounts.getOrDefault(x, 0L) + 1); } long ans = 0; for (int x : bCounts.keySet()) { if (x == 0) { ans += aCounts.getOrDefault(x, 0L) * bCounts.get(x); } else { ans += aCounts.getOrDefault(k - x, 0L) * bCounts.get(x); } } System.out.println(ans); } else { HashMap<Integer, Long> bCounts = new HashMap<>(); for (int i = 0; i < m; i++) { int x = getGCD(k, sc.nextInt()); bCounts.put(x, bCounts.getOrDefault(x, 0L) + 1); } HashMap<Integer, Long> aCounts = new HashMap<>(); for (int i = 0; i < n; i++) { int x = getGCD(k, sc.nextInt()); aCounts.put(x, aCounts.getOrDefault(x, 0L) + 1); } long ans = 0; for (int x : bCounts.keySet()) { for (int y : aCounts.keySet()) { if (y % (k / x) == 0) { ans += bCounts.get(x) * aCounts.get(y); } } } System.out.println(ans); } } static int getGCD(int x, int y) { if (y == 0) { return x; } else { return getGCD(y, x % y); } } } 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 String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }