結果
問題 | No.754 畳み込みの和 |
ユーザー | hiromi_ayase |
提出日時 | 2018-12-02 00:28:31 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 335 ms / 5,000 ms |
コード長 | 2,779 bytes |
コンパイル時間 | 2,434 ms |
コンパイル使用メモリ | 94,664 KB |
実行使用メモリ | 48,136 KB |
最終ジャッジ日時 | 2024-06-27 03:56:33 |
合計ジャッジ時間 | 4,146 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 328 ms
47,732 KB |
testcase_01 | AC | 335 ms
48,136 KB |
testcase_02 | AC | 330 ms
47,760 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); long[] a = nal(n + 1); long[] b = nal(n + 1); int mod = 1000000000 + 7; long bsum = 0; for (long v : b) { bsum += v; bsum %= mod; } long ret = 0; for (int i = 0; i <= n; i ++) { ret += bsum * a[i]; bsum += mod - b[n - i]; bsum %= mod; ret %= mod; } System.out.println(ret); } 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)); } }