結果
問題 | No.616 へんなソート |
ユーザー | hiromi_ayase |
提出日時 | 2017-12-19 07:02:10 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 632 ms / 2,000 ms |
コード長 | 2,897 bytes |
コンパイル時間 | 2,400 ms |
コンパイル使用メモリ | 81,196 KB |
実行使用メモリ | 53,820 KB |
最終ジャッジ日時 | 2023-08-22 19:26:36 |
合計ジャッジ時間 | 7,089 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
50,672 KB |
testcase_01 | AC | 67 ms
50,680 KB |
testcase_02 | AC | 67 ms
50,720 KB |
testcase_03 | AC | 66 ms
50,948 KB |
testcase_04 | AC | 69 ms
50,700 KB |
testcase_05 | AC | 66 ms
50,952 KB |
testcase_06 | AC | 69 ms
51,096 KB |
testcase_07 | AC | 67 ms
50,704 KB |
testcase_08 | AC | 69 ms
50,688 KB |
testcase_09 | AC | 74 ms
50,816 KB |
testcase_10 | AC | 66 ms
50,756 KB |
testcase_11 | AC | 67 ms
50,712 KB |
testcase_12 | AC | 101 ms
53,632 KB |
testcase_13 | AC | 294 ms
53,536 KB |
testcase_14 | AC | 120 ms
53,680 KB |
testcase_15 | AC | 67 ms
50,708 KB |
testcase_16 | AC | 69 ms
50,996 KB |
testcase_17 | AC | 196 ms
53,744 KB |
testcase_18 | AC | 119 ms
53,584 KB |
testcase_19 | AC | 115 ms
53,688 KB |
testcase_20 | AC | 68 ms
50,604 KB |
testcase_21 | AC | 69 ms
50,956 KB |
testcase_22 | AC | 110 ms
53,820 KB |
testcase_23 | AC | 65 ms
49,004 KB |
testcase_24 | AC | 65 ms
48,520 KB |
testcase_25 | AC | 66 ms
50,588 KB |
testcase_26 | AC | 70 ms
50,932 KB |
testcase_27 | AC | 74 ms
50,716 KB |
testcase_28 | AC | 632 ms
53,428 KB |
testcase_29 | AC | 630 ms
53,432 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int K = ni(); int[] a = na(n); long[][] dp = new long[2][K + n + 1]; dp[0][0] = 1; long mod = 1000000000 + 7; for (int i = 0; i < n; i ++) { int from = i % 2; int to = (i + 1) % 2; for (int j = 0; j <= K; j ++) { dp[to][j] += dp[from][j]; dp[to][j] %= mod; dp[to][j + i + 1] += mod - dp[from][j]; dp[to][j + i + 1] %= mod; } long now = 0; for (int j = 0; j <= K; j ++) { now += mod + dp[to][j]; now %= mod; dp[to][j] = now; } Arrays.fill(dp[from], 0); } long sum = 0; for (int i = 0; i <= K; i ++) { sum += dp[n % 2][i]; sum %= mod; } System.out.println(sum); } 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)); } }