結果
問題 | No.1201 お菓子配り-4 |
ユーザー | uwi |
提出日時 | 2020-09-03 13:19:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,534 ms / 4,000 ms |
コード長 | 3,550 bytes |
コンパイル時間 | 4,020 ms |
コンパイル使用メモリ | 82,380 KB |
実行使用メモリ | 38,092 KB |
最終ジャッジ日時 | 2024-11-23 15:00:38 |
合計ジャッジ時間 | 16,534 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
37,936 KB |
testcase_01 | AC | 412 ms
37,812 KB |
testcase_02 | AC | 561 ms
37,944 KB |
testcase_03 | AC | 310 ms
38,016 KB |
testcase_04 | AC | 183 ms
37,812 KB |
testcase_05 | AC | 356 ms
37,980 KB |
testcase_06 | AC | 108 ms
37,688 KB |
testcase_07 | AC | 198 ms
37,976 KB |
testcase_08 | AC | 436 ms
37,776 KB |
testcase_09 | AC | 336 ms
38,056 KB |
testcase_10 | AC | 54 ms
36,868 KB |
testcase_11 | AC | 136 ms
37,740 KB |
testcase_12 | AC | 628 ms
37,812 KB |
testcase_13 | AC | 77 ms
37,620 KB |
testcase_14 | AC | 76 ms
37,404 KB |
testcase_15 | AC | 513 ms
37,660 KB |
testcase_16 | AC | 201 ms
37,820 KB |
testcase_17 | AC | 240 ms
38,092 KB |
testcase_18 | AC | 97 ms
38,036 KB |
testcase_19 | AC | 94 ms
37,812 KB |
testcase_20 | AC | 53 ms
36,756 KB |
testcase_21 | AC | 55 ms
36,892 KB |
testcase_22 | AC | 52 ms
36,792 KB |
testcase_23 | AC | 50 ms
36,892 KB |
testcase_24 | AC | 50 ms
36,828 KB |
testcase_25 | AC | 50 ms
37,036 KB |
testcase_26 | AC | 50 ms
37,052 KB |
testcase_27 | AC | 50 ms
36,928 KB |
testcase_28 | AC | 49 ms
37,036 KB |
testcase_29 | AC | 51 ms
37,084 KB |
testcase_30 | AC | 776 ms
37,788 KB |
testcase_31 | AC | 777 ms
37,676 KB |
testcase_32 | AC | 779 ms
37,924 KB |
testcase_33 | AC | 783 ms
37,808 KB |
testcase_34 | AC | 777 ms
38,068 KB |
testcase_35 | AC | 1,534 ms
37,820 KB |
ソースコード
package no1xxx; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class No1201_2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int m = ni(); int[] a = na(n); int[] b = na(m); long ans = 0; int mod = 1000000007; long asum = 0; for(int i = 0;i < n;i++)asum += a[i]-1; asum %= mod; long bsum = 0; for(int i = 0;i < m;i++)bsum += b[i]+1; bsum %= mod; ans += asum * bsum + (long)n*m; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ ans += gcd(a[i], b[j]); } } out.println(ans % mod); } public static int gcd(int a, int b) { while (b > 0) { int c = a; a = b; b = c % b; } return a; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new No1201_2().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }