結果
問題 | No.616 へんなソート |
ユーザー | yuya178 |
提出日時 | 2017-12-16 01:01:40 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 172 ms / 2,000 ms |
コード長 | 4,980 bytes |
コンパイル時間 | 2,329 ms |
コンパイル使用メモリ | 83,248 KB |
実行使用メモリ | 44,184 KB |
最終ジャッジ日時 | 2024-05-08 12:41:46 |
合計ジャッジ時間 | 5,664 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
38,128 KB |
testcase_01 | AC | 55 ms
39,056 KB |
testcase_02 | AC | 55 ms
41,308 KB |
testcase_03 | AC | 57 ms
41,716 KB |
testcase_04 | AC | 58 ms
41,784 KB |
testcase_05 | AC | 53 ms
37,468 KB |
testcase_06 | AC | 58 ms
41,848 KB |
testcase_07 | AC | 56 ms
41,052 KB |
testcase_08 | AC | 57 ms
41,552 KB |
testcase_09 | AC | 59 ms
41,668 KB |
testcase_10 | AC | 57 ms
41,744 KB |
testcase_11 | AC | 58 ms
41,252 KB |
testcase_12 | AC | 84 ms
42,708 KB |
testcase_13 | AC | 145 ms
43,592 KB |
testcase_14 | AC | 61 ms
41,708 KB |
testcase_15 | AC | 58 ms
41,272 KB |
testcase_16 | AC | 61 ms
41,568 KB |
testcase_17 | AC | 134 ms
43,732 KB |
testcase_18 | AC | 118 ms
43,576 KB |
testcase_19 | AC | 120 ms
43,920 KB |
testcase_20 | AC | 57 ms
41,512 KB |
testcase_21 | AC | 62 ms
41,796 KB |
testcase_22 | AC | 105 ms
43,560 KB |
testcase_23 | AC | 54 ms
37,444 KB |
testcase_24 | AC | 53 ms
37,340 KB |
testcase_25 | AC | 54 ms
37,532 KB |
testcase_26 | AC | 94 ms
43,296 KB |
testcase_27 | AC | 91 ms
42,664 KB |
testcase_28 | AC | 172 ms
44,184 KB |
testcase_29 | AC | 172 ms
43,864 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(); } // Arrays.sort(a); long[] dp = new long[50001]; dp[0] = 1; // for(int i = 1; i < n; i++){ // long[] ndp = new long[50001]; // for(int j = 0; j <= i*(i-1)/2; j++){ // for(int k = 0; k <= i; k++){ // ndp[j+k] += dp[j]%MOD; // ndp[j+k] %= MOD; // } // } // // for(int j = 0; j < 10; j++){ // // out.println(ndp[j]); // // } // dp = ndp; // } for(int i = 1; i < n; i++){ long[] ndp = new long[50001]; for(int j = 0; j <= i*(i-1)/2; j++){ ndp[j] += dp[j]; ndp[j+i+1] -= dp[j]; // for(int k = 0; k <= i; k++){ // ndp[j+k] += dp[j]%MOD; // ndp[j+k] %= MOD; // } } for(int j = 1; j <= i*(i+1)/2; j++){ ndp[j] += ndp[j-1]; } for(int j = 0; j <= i*(i+1)/2; j++){ ndp[j] %= MOD; } dp = ndp; } long ans = 0; for(int i = 0; i <= K; i++){ ans += dp[i]%MOD; ans %= MOD; } // long res = 0; // for(int i = 0; i <= K; i++){ // out.println(dp[i]); // res += dp[i]%MOD; // res %= MOD; // ans += res%MOD; // ans %=MOD; // } out.println(ans); } 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)); } }