#552579 (Java21) No.462 6日知らずのコンピュータ

• 問題: No.462 6日知らずのコンピュータ
• ユーザー: tenten
• 提出日時: 2020-09-12 21:04:39
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 137 ms / 2,000 ms
• コード長: 1,414 bytes
• コンパイル時間: 2,580 ms
• コンパイル使用メモリ: 80,504 KB
• 実行使用メモリ: 54,436 KB
• 最終ジャッジ日時: 2024-06-10 18:45:15
• 合計ジャッジ時間: 13,922 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	114 ms; 54,084 KB
testcase_01	AC	117 ms; 54,112 KB
testcase_02	AC	124 ms; 54,436 KB
testcase_03	AC	123 ms; 54,080 KB
testcase_04	AC	105 ms; 52,716 KB
testcase_05	AC	137 ms; 54,076 KB
testcase_06	AC	115 ms; 53,928 KB
testcase_07	AC	113 ms; 54,016 KB
testcase_08	AC	102 ms; 52,612 KB
testcase_09	AC	114 ms; 54,212 KB
testcase_10	AC	107 ms; 52,940 KB
testcase_11	AC	105 ms; 52,768 KB
testcase_12	AC	113 ms; 53,900 KB
testcase_13	AC	118 ms; 54,128 KB
testcase_14	AC	120 ms; 54,076 KB
testcase_15	AC	104 ms; 52,736 KB
testcase_16	AC	114 ms; 53,868 KB
testcase_17	AC	117 ms; 54,056 KB
testcase_18	AC	111 ms; 53,780 KB
testcase_19	AC	102 ms; 52,900 KB
testcase_20	AC	110 ms; 53,620 KB
testcase_21	AC	104 ms; 52,836 KB
testcase_22	AC	106 ms; 52,980 KB
testcase_23	AC	120 ms; 53,928 KB
testcase_24	AC	105 ms; 54,332 KB
testcase_25	AC	124 ms; 53,868 KB
testcase_26	AC	117 ms; 53,956 KB
testcase_27	AC	116 ms; 54,224 KB
testcase_28	AC	115 ms; 53,920 KB
testcase_29	AC	117 ms; 54,004 KB
testcase_30	AC	113 ms; 53,896 KB
testcase_31	AC	114 ms; 54,136 KB
testcase_32	AC	105 ms; 52,600 KB
testcase_33	AC	120 ms; 53,964 KB
testcase_34	AC	110 ms; 52,892 KB
testcase_35	AC	113 ms; 53,964 KB
testcase_36	AC	102 ms; 52,768 KB
testcase_37	AC	115 ms; 54,188 KB
testcase_38	AC	116 ms; 54,040 KB
testcase_39	AC	116 ms; 53,804 KB
testcase_40	AC	119 ms; 53,884 KB
testcase_41	AC	109 ms; 52,832 KB
testcase_42	AC	122 ms; 54,132 KB
testcase_43	AC	122 ms; 53,868 KB
testcase_44	AC	117 ms; 54,224 KB
testcase_45	AC	115 ms; 53,648 KB
testcase_46	AC	116 ms; 53,800 KB
testcase_47	AC	123 ms; 54,076 KB
testcase_48	AC	123 ms; 53,932 KB
testcase_49	AC	112 ms; 53,748 KB
testcase_50	AC	119 ms; 53,960 KB
testcase_51	AC	114 ms; 54,016 KB
testcase_52	AC	109 ms; 52,936 KB
testcase_53	AC	123 ms; 54,244 KB
testcase_54	AC	114 ms; 54,196 KB
testcase_55	AC	115 ms; 53,972 KB
testcase_56	AC	119 ms; 54,420 KB
testcase_57	AC	115 ms; 53,256 KB
testcase_58	AC	115 ms; 53,964 KB
testcase_59	AC	118 ms; 53,980 KB
testcase_60	AC	127 ms; 54,188 KB
testcase_61	AC	105 ms; 52,948 KB
testcase_62	AC	113 ms; 54,052 KB
testcase_63	AC	123 ms; 54,164 KB
testcase_64	AC	120 ms; 53,908 KB
testcase_65	AC	114 ms; 53,668 KB
testcase_66	AC	109 ms; 53,068 KB
testcase_67	AC	119 ms; 54,020 KB
testcase_68	AC	120 ms; 53,888 KB
testcase_69	AC	104 ms; 52,548 KB
testcase_70	AC	103 ms; 52,856 KB
testcase_71	AC	118 ms; 53,932 KB
testcase_72	AC	129 ms; 54,000 KB
testcase_73	AC	129 ms; 54,264 KB
testcase_74	AC	104 ms; 52,652 KB
testcase_75	AC	123 ms; 54,120 KB
testcase_76	AC	115 ms; 53,828 KB
testcase_77	AC	121 ms; 54,084 KB
testcase_78	AC	111 ms; 52,904 KB
testcase_79	AC	114 ms; 54,128 KB
testcase_80	AC	117 ms; 53,908 KB
testcase_81	AC	114 ms; 54,296 KB
testcase_82	AC	119 ms; 53,216 KB
testcase_83	AC	122 ms; 54,180 KB
testcase_84	AC	115 ms; 53,872 KB
testcase_85	AC	117 ms; 54,132 KB
testcase_86	AC	120 ms; 54,068 KB

ソースコード

import java.util.*;

public class Main {
    static final int MOD = 1000000007;
	public static void main (String[] args) {
    	Scanner sc = new Scanner(System.in);
    	int n = sc.nextInt();
    	int k = sc.nextInt();
    	Num[] numbers = new Num[k + 2];
    	numbers[0] = new Num(0);
    	for (int i = 1; i <= k; i++) {
    	    numbers[i] = new Num(sc.nextLong());
    	}
    	numbers[k + 1] = new Num((1L << n) - 1);
    	Arrays.sort(numbers);
    	long ans = 1;
    	for (int i = 1; i <= k + 1; i++) {
    	    if ((numbers[i - 1].number & numbers[i].number) != numbers[i - 1].number) {
    	        System.out.println(0);
    	        return;
    	    }
    	    ans *= kaijo(numbers[i].getPop() - numbers[i - 1].getPop());
    	    ans %= MOD;
    	}
    	System.out.println(ans);
	}
	
	static class Num implements Comparable<Num> {
	    long number;
	    int pop;
	    
	    public Num(long number) {
	        this.number = number;
	        while (number > 0) {
	            pop += number % 2;
	            number /= 2;
	        }
	    }
	    
	    public int getPop() {
	        return pop;
	    }
	    
	    public int compareTo(Num another) {
	        return pop - another.pop;
	    }
	    
	    public String toString() {
	        return number + ":" + pop;
	    }
	}
	
	static long kaijo(long x) {
	    if (x == 0) {
	        return 1;
	    } else {
	        return x * kaijo(x - 1) % MOD;
	    }
	}
}