結果
問題 | No.1201 お菓子配り-4 |
ユーザー | hiromi_ayase |
提出日時 | 2020-08-28 23:38:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,753 ms / 4,000 ms |
コード長 | 2,898 bytes |
コンパイル時間 | 2,852 ms |
コンパイル使用メモリ | 92,192 KB |
実行使用メモリ | 52,692 KB |
最終ジャッジ日時 | 2024-04-26 14:02:44 |
合計ジャッジ時間 | 17,080 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
52,388 KB |
testcase_01 | AC | 471 ms
52,472 KB |
testcase_02 | AC | 630 ms
52,528 KB |
testcase_03 | AC | 362 ms
52,344 KB |
testcase_04 | AC | 223 ms
52,152 KB |
testcase_05 | AC | 419 ms
52,528 KB |
testcase_06 | AC | 140 ms
52,096 KB |
testcase_07 | AC | 236 ms
52,292 KB |
testcase_08 | AC | 492 ms
52,468 KB |
testcase_09 | AC | 396 ms
52,384 KB |
testcase_10 | AC | 87 ms
51,824 KB |
testcase_11 | AC | 168 ms
52,084 KB |
testcase_12 | AC | 696 ms
52,452 KB |
testcase_13 | AC | 109 ms
51,984 KB |
testcase_14 | AC | 96 ms
51,912 KB |
testcase_15 | AC | 582 ms
52,552 KB |
testcase_16 | AC | 238 ms
52,248 KB |
testcase_17 | AC | 287 ms
52,288 KB |
testcase_18 | AC | 129 ms
51,884 KB |
testcase_19 | AC | 124 ms
52,132 KB |
testcase_20 | AC | 72 ms
51,264 KB |
testcase_21 | AC | 73 ms
51,048 KB |
testcase_22 | AC | 74 ms
51,208 KB |
testcase_23 | AC | 73 ms
51,088 KB |
testcase_24 | AC | 74 ms
51,100 KB |
testcase_25 | AC | 74 ms
51,276 KB |
testcase_26 | AC | 75 ms
51,336 KB |
testcase_27 | AC | 72 ms
51,356 KB |
testcase_28 | AC | 75 ms
51,304 KB |
testcase_29 | AC | 73 ms
51,268 KB |
testcase_30 | AC | 871 ms
52,412 KB |
testcase_31 | AC | 856 ms
52,424 KB |
testcase_32 | AC | 876 ms
52,536 KB |
testcase_33 | AC | 843 ms
52,692 KB |
testcase_34 | AC | 880 ms
52,480 KB |
testcase_35 | AC | 1,753 ms
52,500 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); int m = ni(); int[] a = na(n); int[] b = na(m); int mod = (int) 1e9 + 7; long sum = 0; for (int i = 0; i < n; i++) { if (a[i] == 0) continue; for (int j = 0; j < m; j++) { sum += (long) (a[i] - 1) * (b[j] + 1) + gcd(a[i], b[j]) + 1; sum %= mod; } } System.out.println(sum); } public static int gcd(int a, int b) { while (b > 0) { int c = a; a = b; b = c % b; } return a; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }