結果
問題 | No.616 へんなソート |
ユーザー | 37zigen |
提出日時 | 2018-08-28 00:25:08 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 304 ms / 2,000 ms |
コード長 | 2,740 bytes |
コンパイル時間 | 3,716 ms |
コンパイル使用メモリ | 74,292 KB |
実行使用メモリ | 181,880 KB |
最終ジャッジ日時 | 2023-09-19 09:41:29 |
合計ジャッジ時間 | 7,661 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,192 KB |
testcase_01 | AC | 44 ms
49,236 KB |
testcase_02 | AC | 45 ms
49,036 KB |
testcase_03 | AC | 45 ms
49,016 KB |
testcase_04 | AC | 46 ms
48,908 KB |
testcase_05 | AC | 45 ms
48,944 KB |
testcase_06 | AC | 47 ms
49,028 KB |
testcase_07 | AC | 46 ms
48,924 KB |
testcase_08 | AC | 48 ms
48,924 KB |
testcase_09 | AC | 50 ms
49,292 KB |
testcase_10 | AC | 45 ms
48,892 KB |
testcase_11 | AC | 46 ms
49,012 KB |
testcase_12 | AC | 56 ms
49,848 KB |
testcase_13 | AC | 149 ms
86,588 KB |
testcase_14 | AC | 57 ms
50,124 KB |
testcase_15 | AC | 46 ms
49,504 KB |
testcase_16 | AC | 48 ms
48,944 KB |
testcase_17 | AC | 105 ms
67,976 KB |
testcase_18 | AC | 71 ms
53,848 KB |
testcase_19 | AC | 72 ms
53,864 KB |
testcase_20 | AC | 47 ms
49,140 KB |
testcase_21 | AC | 48 ms
49,692 KB |
testcase_22 | AC | 57 ms
49,896 KB |
testcase_23 | AC | 45 ms
49,272 KB |
testcase_24 | AC | 45 ms
49,040 KB |
testcase_25 | AC | 45 ms
49,144 KB |
testcase_26 | AC | 46 ms
48,932 KB |
testcase_27 | AC | 45 ms
48,936 KB |
testcase_28 | AC | 304 ms
181,852 KB |
testcase_29 | AC | 302 ms
181,880 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.Comparator; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { new Main().run(); } final long MOD = 1_000_000_000 + 7; void run() { Scanner sc = new Scanner(); int N = sc.nextInt(); int K = sc.nextInt(); long[] A = new long[N]; for (int i = 0; i < N; ++i) A[i] = sc.nextLong(); long[][] dp = new long[N + 1][K + 1]; dp[0][0] = 1; for (int i = 0; i < N; ++i) { long sum = 0; for (int j = 0; j <= K; ++j) { sum = (sum + dp[i][j]) % MOD; if (j - i - 1 >= 0) sum = (sum - dp[i][j - i - 1] + MOD) % MOD; dp[i + 1][j] = (dp[i + 1][j] + sum) % MOD; } } long ans = 0; for (int i = 0; i <= K; ++i) ans = (ans + dp[N][i]) % MOD; System.out.println(ans); } void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } } }