結果
問題 | No.1331 Moving Penguin |
ユーザー |
![]() |
提出日時 | 2023-04-12 08:27:34 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 477 ms / 1,500 ms |
コード長 | 2,439 bytes |
コンパイル時間 | 2,624 ms |
コンパイル使用メモリ | 87,912 KB |
実行使用メモリ | 45,956 KB |
最終ジャッジ日時 | 2024-10-08 05:40:03 |
合計ジャッジ時間 | 21,386 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 49 |
ソースコード
import java.io.*;import java.util.*;import java.util.stream.*;public class Main {static final int MOD = 1000000007;static final int LIMIT = 300;public static void main(String[] args) throws Exception {Scanner sc = new Scanner();int n = sc.nextInt();int[] values = new int[n];for (int i = 0; i < n; i++) {values[i] = sc.nextInt();}int[] dp = new int[n + 1];dp[0] = 1;int[][] sums = new int[LIMIT][LIMIT];for (int i = 0; i < n; i++) {for (int j = 1; j < LIMIT; j++) {dp[i] += sums[j][i % j];dp[i] %= MOD;}if (values[i] < LIMIT) {sums[values[i]][i % values[i]] += dp[i];sums[values[i]][i % values[i]] %= MOD;} else {for (int j = 1; i + j * values[i] < n; j++) {dp[i + j * values[i]] += dp[i];dp[i + j * values[i]] %= MOD;}}if (values[i] > 1) {dp[i + 1] += dp[i];dp[i + 1] %= MOD;}}System.out.println(dp[n - 1]);}}class Utilities {static String arrayToLineString(Object[] arr) {return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));}static String arrayToLineString(int[] arr) {return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));}}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 int[] nextIntArray() throws Exception {return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();}public String next() throws Exception {while (!st.hasMoreTokens()) {st = new StringTokenizer(br.readLine());}return st.nextToken();}}