結果

問題 No.115 遠足のおやつ
ユーザー amyuamyu
提出日時 2016-06-19 18:14:28
言語 Java21
(openjdk 21)
結果
AC  
実行時間 52 ms / 5,000 ms
コード長 4,154 bytes
コンパイル時間 2,279 ms
コンパイル使用メモリ 76,896 KB
実行使用メモリ 50,296 KB
最終ジャッジ日時 2023-08-31 00:40:32
合計ジャッジ時間 5,836 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
49,336 KB
testcase_01 AC 42 ms
49,236 KB
testcase_02 AC 52 ms
49,972 KB
testcase_03 AC 42 ms
49,468 KB
testcase_04 AC 50 ms
49,856 KB
testcase_05 AC 50 ms
49,836 KB
testcase_06 AC 43 ms
49,684 KB
testcase_07 AC 51 ms
50,036 KB
testcase_08 AC 43 ms
49,340 KB
testcase_09 AC 43 ms
49,360 KB
testcase_10 AC 43 ms
49,940 KB
testcase_11 AC 43 ms
49,332 KB
testcase_12 AC 42 ms
49,340 KB
testcase_13 AC 42 ms
49,236 KB
testcase_14 AC 51 ms
49,856 KB
testcase_15 AC 52 ms
49,672 KB
testcase_16 AC 51 ms
49,788 KB
testcase_17 AC 51 ms
49,748 KB
testcase_18 AC 43 ms
49,460 KB
testcase_19 AC 51 ms
49,736 KB
testcase_20 AC 52 ms
50,220 KB
testcase_21 AC 52 ms
49,916 KB
testcase_22 AC 50 ms
49,732 KB
testcase_23 AC 43 ms
49,356 KB
testcase_24 AC 51 ms
50,288 KB
testcase_25 AC 50 ms
50,296 KB
testcase_26 AC 50 ms
49,904 KB
testcase_27 AC 49 ms
49,936 KB
testcase_28 AC 51 ms
49,744 KB
testcase_29 AC 51 ms
49,788 KB
testcase_30 AC 50 ms
49,792 KB
testcase_31 AC 50 ms
49,872 KB
testcase_32 AC 50 ms
50,060 KB
testcase_33 AC 51 ms
49,868 KB
testcase_34 AC 50 ms
49,780 KB
testcase_35 AC 49 ms
49,676 KB
testcase_36 AC 50 ms
47,700 KB
testcase_37 AC 50 ms
49,744 KB
testcase_38 AC 50 ms
49,964 KB
testcase_39 AC 42 ms
49,336 KB
testcase_40 AC 42 ms
49,912 KB
testcase_41 AC 44 ms
49,560 KB
testcase_42 AC 51 ms
49,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main{
    static final Reader sc = new Reader();
    static final PrintWriter out = new PrintWriter(System.out,false);

    public static void main(String[] args) throws Exception {
    	int n = sc.nextInt();
    	int d = sc.nextInt();
    	int k = sc.nextInt();
        ArrayList<Integer> list = new ArrayList<Integer>();
    	if(d<k*(k+1)/2 || n*(n+1)/2-(n-k)*(n-k+1)/2<d){
            out.println(-1);
        }
        else{
            for(int i=1;i<=n;i++){
                //out.println(i+" "+((i+k)*(i+k-1)/2-i*(i+1)/2)+" "+(d-i)+" "+(n*(n+1)/2-(n-k+1)*(n-k+2)/2));
                if((((i+k-1)*(i+k)/2-i*(i+1)/2)<=(d-i)) && ((d-i)<=(n*(n+1)/2-(n-k+1)*(n-k+2)/2))){
                    list.add(i);
                    d-=i;
                    k--;
                }
            }
            for(int i=0;i<list.size();i++){
                out.print(list.get(i)+" ");
            }
            out.println();
        }
        out.flush();
        sc.close();
        out.close();
    }

    static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}

class Reader {

    private final InputStream in;
    private final byte[] buf = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    public Reader() { this(System.in);}
    public Reader(InputStream source) { this.in = source;}

    private boolean hasNextByte() {
        if (ptr < buflen) return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0) return false;
        return true;
    }

    private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    public boolean hasNext() {skip(); 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();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }

        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    public int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    public String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    public int[] nextIntArray(int n) {
        int[] res = new int[n];
        for (int i=0; i<n; i++) res[i] = nextInt();
        return res;
    }

    public char[] nextCharArray(int n) {
        char[] res = new char[n];
        for (int i=0; i<n; i++) res[i] = nextChar();
        return res;
    }

    public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}};
}
0