結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | k_6101 |
提出日時 | 2020-01-31 23:19:50 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 206 ms / 2,000 ms |
コード長 | 2,653 bytes |
コンパイル時間 | 3,024 ms |
コンパイル使用メモリ | 78,876 KB |
実行使用メモリ | 91,532 KB |
最終ジャッジ日時 | 2023-10-19 01:07:40 |
合計ジャッジ時間 | 7,287 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 137 ms
57,648 KB |
testcase_01 | AC | 173 ms
72,728 KB |
testcase_02 | AC | 159 ms
62,124 KB |
testcase_03 | AC | 200 ms
89,348 KB |
testcase_04 | AC | 165 ms
66,492 KB |
testcase_05 | AC | 151 ms
59,824 KB |
testcase_06 | AC | 169 ms
70,764 KB |
testcase_07 | AC | 189 ms
78,912 KB |
testcase_08 | AC | 175 ms
72,820 KB |
testcase_09 | AC | 194 ms
83,312 KB |
testcase_10 | AC | 204 ms
91,500 KB |
testcase_11 | AC | 167 ms
68,708 KB |
testcase_12 | AC | 149 ms
59,580 KB |
testcase_13 | AC | 176 ms
70,800 KB |
testcase_14 | AC | 157 ms
59,580 KB |
testcase_15 | AC | 174 ms
72,816 KB |
testcase_16 | AC | 204 ms
91,532 KB |
testcase_17 | AC | 206 ms
91,460 KB |
testcase_18 | AC | 137 ms
57,432 KB |
testcase_19 | AC | 137 ms
57,556 KB |
testcase_20 | AC | 136 ms
57,556 KB |
ソースコード
import static java.util.Comparator.comparing; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Map; import java.util.PriorityQueue; import java.util.Queue; import java.util.Scanner; import java.util.Set; import java.util.TreeSet; public class Main { public static void main(String[] args) { PrintWriter out = new PrintWriter(System.out); Solver solver = new Solver(System.in, out); solver.solve(); out.close(); } } class Solver { Scanner sc; PrintWriter out; public Solver(InputStream in, PrintWriter out) { sc = new Scanner(in); this.out = out; } // ========================================================== final long MOD = 1000000007; long[] A, wa; public void solve() { int N = ni(); long P = nl(); A = new long[N+1]; wa = new long[N+2]; A[0] = 0; A[1] = 1; wa[1] = 0; wa[2] = 1; for (int i = 2; i <= N; i++) { A[i] = ((P * A[i-1])% MOD + A[i-2])% MOD; wa[i+1] = (wa[i] + A[i]) % MOD; // out.println("A[" + i + "] = " + A[i]); // out.println("wa[" + (i+1) + "] = " + wa[i+1]); } long ans = 0; for (int i = 0; i < N; i++) { ans = (ans + (A[i] * wa[i+1]) % MOD) % MOD; // out.println("ans = " + ans + " A[" + i + "] = " + A[i] // + " wa[" + (i+1) + "] = " + wa[i+1]); } out.println(ans); } // ------------------------------------------ // 入力 // ------------------------------------------ public int ni() { return sc.nextInt(); } public long nl() { return sc.nextLong(); } public String ns() { return sc.next(); } public char[] nc() { return sc.next().toCharArray(); } public int[] ndi(int N) { int[] ans = new int[N]; for (int i = 0; i < N; i++) { ans[i] = ni(); } return ans; } public long[] ndl(int N) { long[] ans = new long[N]; for (int i = 0; i < N; i++) { ans[i] = nl(); } return ans; } public String[] nds(int N) { String[] ans = new String[N]; for (int i = 0; i < N; i++) { ans[i] = ns(); } return ans; } public char[][] ndc(int N) { char[][] ans = new char[N][]; for (int i = 0; i < N; i++) { ans[i] = nc(); } return ans; } public int[][] nddi(int N, int S) { int[][] ans = new int[N][S]; for (int i = 0; i < N; i++) { for (int j = 0; j < S; j++) { ans[i][j] = ni(); } } return ans; } }