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

• 問題: No.462 6日知らずのコンピュータ
• ユーザー: tanzaku
• 提出日時: 2016-12-13 01:53:38
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 53 ms / 2,000 ms
• コード長: 6,480 bytes
• コンパイル時間: 6,630 ms
• コンパイル使用メモリ: 85,832 KB
• 実行使用メモリ: 37,320 KB
• 最終ジャッジ日時: 2024-11-29 18:33:49
• 合計ジャッジ時間: 10,701 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 84

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.*;
public class _462 {
    private static final int mod = (int)1e9+7;
    final Random random = new Random(0);
    final IOFast io = new IOFast();
    /// MAIN CODE
    public void run() throws IOException {
//      int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
        int TEST_CASE = 1;
        while(TEST_CASE-- != 0) {
            n = io.nextInt();
//          if (n >= 10) throw new RuntimeException();
            k = io.nextInt();
            a = new long[k+2];
            for (int i = 1; i <= k; i++) a[i] = io.nextLong();
            a[k+1] = (1L<<n)-1;
            Arrays.sort(a);
            long[] fact = new long[100];
            fact[0] = 1;
            for (int i = 1; i < fact.length; i++) fact[i] = fact[i-1] * i % mod;
            long ans = 1;
            for (int i = 1; i < a.length; i++) {
//              dump(a[i-1], a[i], a[i-1]&a[i]);
                if ((a[i-1]&a[i]) != a[i-1]) {
                    ans = 0;
                    break;
                }
                ans = ans * fact[Long.bitCount(~a[i-1] & a[i])] % mod;
            }
//          dump(ans, dfs(0, 0));
            io.out.println(ans);
//          io.out.println(dfs(0, 0));
        }
    }
    
    int n, k;
    long[] a;
    long dfs(int idx, long v) {
        while (idx < a.length && a[idx] == v) idx++;
        if (v == (1L<<n)-1) return idx >= a.length ? 1 : 0;
        long res = 0;
        for (int i = 0; i < n; i++) {
            if ((v >>> i & 1) == 0) {
                res += dfs(idx, v | 1L<<i);
            }
        }
        return res;
    }
    
    /// TEMPLATE
    static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
    static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
    
    static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
    static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
    void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
    void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
    
    static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
    
    void main() throws IOException {
        //      IOFast.setFileIO("rle-size.in", "rle-size.out");
        try { run(); }
        catch (EndOfFileRuntimeException e) { }
        io.out.flush();
    }
    public static void main(String[] args) throws IOException { new _462().main(); }
    
    static class EndOfFileRuntimeException extends RuntimeException {
        private static final long serialVersionUID = -8565341110209207657L; }
    static
    public class IOFast {
        private InputStream in = System.in;
        private PrintWriter out = new PrintWriter(System.out);
        private static int pos, readLen;
        private static final byte[] buffer = new byte[1024 * 8];
        private static char[] str = new char[500*8*2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];
        static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = 
            isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
        public byte read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new 
            EndOfFileRuntimeException(); } } return buffer[pos++]; }
        public int nextInt() throws IOException {
            byte first = (byte)nextChar();
            boolean minus = false;
            int res = 0;
            if (first == '-') {
                minus = true;
            } else {
                res = first - '0';
            }
            while (true) {
                byte b = read();
                if (isSpace[b]) break;
                res = res * 10 + b - '0';
            }
            return minus ? -res : res;
        }
        public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if
            (str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
        public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
        int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == 
            len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } 
            catch(EndOfFileRuntimeException e) { ; } return len; }
        int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } 
            cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
        public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') 
            { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
        public String nextString() throws IOException { return new String(next()); }
        public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//      public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
//      public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
        public double nextDouble() throws IOException {
            double res = nextChar() - '0';
            while (true) {
                byte c = read();
                if (isSpace[c]) return res;
                if (c == '.') break;
                res = res * 10 + c - '0';
            }
            double d = 1;
            while (true) {
                byte c = read();
//              dump(c);
                if (!isDigit[c]) break;
                res = res * 10 + c - '0';
                d *= 10;
            }
//          dump(1);
            return res / d;
        }
        public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong
            (); } return res; }
        public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } 
            return res; }
        public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { 
            res[i] = nextIntArray(k); } return res; }
        public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < 
            n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
        public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = 
            nextDouble(); } return res; }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX