結果

問題 No.1463 Hungry Kanten
ユーザー watarimaycry2watarimaycry2
提出日時 2021-04-02 23:58:44
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,283 bytes
コンパイル時間 2,884 ms
コンパイル使用メモリ 89,092 KB
実行使用メモリ 121,864 KB
最終ジャッジ日時 2024-06-06 09:29:19
合計ジャッジ時間 13,720 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
36,948 KB
testcase_01 AC 55 ms
36,928 KB
testcase_02 AC 274 ms
50,588 KB
testcase_03 AC 1,977 ms
84,612 KB
testcase_04 AC 60 ms
37,180 KB
testcase_05 TLE -
testcase_06 AC 57 ms
36,992 KB
testcase_07 AC 59 ms
37,396 KB
testcase_08 AC 59 ms
37,200 KB
testcase_09 AC 56 ms
37,140 KB
testcase_10 AC 84 ms
38,160 KB
testcase_11 AC 105 ms
38,932 KB
testcase_12 AC 113 ms
39,876 KB
testcase_13 AC 91 ms
38,716 KB
testcase_14 AC 193 ms
44,564 KB
testcase_15 AC 118 ms
40,404 KB
testcase_16 AC 278 ms
50,548 KB
testcase_17 AC 461 ms
57,084 KB
testcase_18 AC 271 ms
48,240 KB
testcase_19 AC 1,548 ms
90,520 KB
testcase_20 AC 1,430 ms
72,872 KB
testcase_21 AC 107 ms
39,264 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
    //Don't have to see. start------------------------------------------
    static class InputIterator{
        ArrayList<String> inputLine = new ArrayList<>(1024);
        int index = 0; int max; String read;
        InputIterator(){
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            try{
                while((read = br.readLine()) != null){
                    inputLine.addAll(Arrays.asList(read.split(" ")));
                }
            }catch(IOException e){}
            max = inputLine.size();
        }
        boolean hasNext(){return (index < max);}
        String next(){
            if(hasNext()){
                return inputLine.get(index++);
            }else{
                throw new IndexOutOfBoundsException("There is no more input");
            }
        }
    }
    static HashMap<Integer, String> CONVSTR = new HashMap<>();
    static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
    static PrintWriter out = new PrintWriter(System.out);
    static void flush(){out.flush();}
    static void myout(Object t){out.println(t);}
    static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
    static String next(){return ii.next();}
    static boolean hasNext(){return ii.hasNext();}
    static int nextInt(){return Integer.parseInt(next());}
    static long nextLong(){return Long.parseLong(next());}
    static double nextDouble(){return Double.parseDouble(next());}
    static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
    static ArrayList<String> nextStrArray(int size){
        ArrayList<String> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(next());
        }
        return ret;
    }
    static ArrayList<Integer> nextIntArray(int size){
        ArrayList<Integer> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(Integer.parseInt(next()));
        }
        return ret;
    }
    static ArrayList<Long> nextLongArray(int size){
        ArrayList<Long> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(Long.parseLong(next()));
        }
        return ret;
    }
    @SuppressWarnings("unchecked")
    static String myconv(Object list, int no){//only join
        String joinString = CONVSTR.get(no);
        if(list instanceof String[]){
            return String.join(joinString, (String[])list);
        }else if(list instanceof ArrayList){
            return String.join(joinString, (ArrayList)list);
        }else{
            throw new ClassCastException("Don't join");
        }
    }
    static ArrayList<String> myconv(String str, int no){//only split
        String splitString = CONVSTR.get(no);
        return new ArrayList<String>(Arrays.asList(str.split(splitString)));
    }
    public static void main(String[] args){
        CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
        solve();flush();
    }
    //Don't have to see. end------------------------------------------

    static void solve(){//Here is the main function
        int N = nextInt();
        int K = nextInt();
        ArrayList<BigInteger> list = new ArrayList<>();
        for(int i = 0; i < N; i++){
            list.add(new BigInteger(next()));
        }
        HashSet<String> used = new HashSet<>();
        for(int i = 1; i < (1 << N); i++){
            ArrayList<BigInteger> select = new ArrayList<>();
            for(int j = 0; j < N; j++){
                if((i & (1 << j)) != 0){
                    select.add(list.get(j));
                }
            }
            if(select.size() >= K){
                BigInteger plus = new BigInteger("0");
                BigInteger multi = new BigInteger("1");
                for(int j = 0; j < select.size(); j++){
                    plus = plus.add(select.get(j));
                    multi = multi.multiply(select.get(j));
                }
                used.add(plus.toString());
                used.add(multi.toString());
            }
        }
        myout(used.size());
    }
    //Method addition frame start



    //Method addition frame end
}
0