結果
問題 | No.616 へんなソート |
ユーザー | yuya178 |
提出日時 | 2017-12-16 01:21:29 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 328 ms / 2,000 ms |
コード長 | 4,015 bytes |
コンパイル時間 | 2,354 ms |
コンパイル使用メモリ | 76,976 KB |
実行使用メモリ | 55,648 KB |
最終ジャッジ日時 | 2023-08-21 07:27:35 |
合計ジャッジ時間 | 8,121 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
49,900 KB |
testcase_01 | AC | 76 ms
54,724 KB |
testcase_02 | AC | 81 ms
54,744 KB |
testcase_03 | AC | 124 ms
54,704 KB |
testcase_04 | AC | 111 ms
55,088 KB |
testcase_05 | AC | 43 ms
49,408 KB |
testcase_06 | AC | 121 ms
55,540 KB |
testcase_07 | AC | 98 ms
55,072 KB |
testcase_08 | AC | 102 ms
54,824 KB |
testcase_09 | AC | 107 ms
54,976 KB |
testcase_10 | AC | 115 ms
55,100 KB |
testcase_11 | AC | 126 ms
55,320 KB |
testcase_12 | AC | 132 ms
55,024 KB |
testcase_13 | AC | 277 ms
55,368 KB |
testcase_14 | AC | 157 ms
55,556 KB |
testcase_15 | AC | 114 ms
54,716 KB |
testcase_16 | AC | 141 ms
55,072 KB |
testcase_17 | AC | 288 ms
55,400 KB |
testcase_18 | AC | 243 ms
55,556 KB |
testcase_19 | AC | 207 ms
54,916 KB |
testcase_20 | AC | 109 ms
55,400 KB |
testcase_21 | AC | 146 ms
55,416 KB |
testcase_22 | AC | 182 ms
55,404 KB |
testcase_23 | AC | 43 ms
49,348 KB |
testcase_24 | AC | 43 ms
49,412 KB |
testcase_25 | AC | 42 ms
49,472 KB |
testcase_26 | AC | 200 ms
55,648 KB |
testcase_27 | AC | 170 ms
55,408 KB |
testcase_28 | AC | 315 ms
54,700 KB |
testcase_29 | AC | 328 ms
55,316 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; int inf = Integer.MAX_VALUE; void solve(){ int n = ni(); int K = ni(); long[] a = new long[n]; for(int i = 0; i < n; i++){ a[i] = nl(); } long[] dp = new long[50001]; Arrays.fill(dp,1); for(int i = 1; i < n; i++){ long[] ndp = new long[50001]; for(int j = 0; j <= 50000; j++){ if(j-i-1>=0) ndp[j] += dp[j] - dp[j-i-1]; else ndp[j] += dp[j]; } for(int j = 1; j <= 50000; j++){ ndp[j] += ndp[j-1]; } for(int j = 0; j <= 50000; j++){ ndp[j] %= MOD; } dp = ndp; } out.println(dp[K]%MOD); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b) && b != ' ')){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }