結果

問題 No.616 へんなソート
ユーザー yuya178yuya178
提出日時 2017-12-16 01:21:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 291 ms / 2,000 ms
コード長 4,015 bytes
コンパイル時間 2,202 ms
コンパイル使用メモリ 80,796 KB
実行使用メモリ 43,800 KB
最終ジャッジ日時 2024-05-08 12:46:05
合計ジャッジ時間 7,142 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
38,020 KB
testcase_01 AC 78 ms
39,596 KB
testcase_02 AC 102 ms
42,852 KB
testcase_03 AC 111 ms
43,688 KB
testcase_04 AC 141 ms
43,612 KB
testcase_05 AC 44 ms
37,332 KB
testcase_06 AC 116 ms
43,612 KB
testcase_07 AC 123 ms
43,100 KB
testcase_08 AC 109 ms
43,644 KB
testcase_09 AC 117 ms
43,520 KB
testcase_10 AC 108 ms
43,492 KB
testcase_11 AC 101 ms
43,476 KB
testcase_12 AC 148 ms
43,320 KB
testcase_13 AC 265 ms
43,596 KB
testcase_14 AC 126 ms
43,288 KB
testcase_15 AC 105 ms
43,124 KB
testcase_16 AC 118 ms
43,620 KB
testcase_17 AC 234 ms
43,560 KB
testcase_18 AC 187 ms
43,300 KB
testcase_19 AC 197 ms
43,524 KB
testcase_20 AC 114 ms
43,388 KB
testcase_21 AC 125 ms
43,436 KB
testcase_22 AC 180 ms
43,800 KB
testcase_23 AC 46 ms
37,148 KB
testcase_24 AC 48 ms
37,140 KB
testcase_25 AC 46 ms
37,132 KB
testcase_26 AC 190 ms
43,704 KB
testcase_27 AC 163 ms
43,484 KB
testcase_28 AC 283 ms
43,344 KB
testcase_29 AC 291 ms
43,704 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)); }
 
}
0