結果
問題 | No.462 6日知らずのコンピュータ |
ユーザー | uwi |
提出日時 | 2016-12-13 00:05:16 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 45 ms / 2,000 ms |
コード長 | 3,467 bytes |
コンパイル時間 | 6,059 ms |
コンパイル使用メモリ | 82,052 KB |
実行使用メモリ | 49,764 KB |
最終ジャッジ日時 | 2023-08-19 21:49:09 |
合計ジャッジ時間 | 12,147 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge10 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,324 KB |
testcase_01 | AC | 42 ms
49,380 KB |
testcase_02 | AC | 42 ms
49,356 KB |
testcase_03 | AC | 43 ms
49,464 KB |
testcase_04 | AC | 43 ms
49,340 KB |
testcase_05 | AC | 41 ms
49,420 KB |
testcase_06 | AC | 43 ms
49,380 KB |
testcase_07 | AC | 43 ms
49,608 KB |
testcase_08 | AC | 43 ms
49,764 KB |
testcase_09 | AC | 43 ms
49,348 KB |
testcase_10 | AC | 42 ms
49,520 KB |
testcase_11 | AC | 42 ms
49,316 KB |
testcase_12 | AC | 43 ms
49,256 KB |
testcase_13 | AC | 42 ms
49,264 KB |
testcase_14 | AC | 44 ms
49,548 KB |
testcase_15 | AC | 43 ms
49,516 KB |
testcase_16 | AC | 43 ms
49,260 KB |
testcase_17 | AC | 43 ms
49,452 KB |
testcase_18 | AC | 43 ms
49,244 KB |
testcase_19 | AC | 43 ms
49,368 KB |
testcase_20 | AC | 43 ms
49,388 KB |
testcase_21 | AC | 43 ms
49,256 KB |
testcase_22 | AC | 43 ms
49,376 KB |
testcase_23 | AC | 44 ms
49,400 KB |
testcase_24 | AC | 43 ms
49,308 KB |
testcase_25 | AC | 43 ms
49,368 KB |
testcase_26 | AC | 43 ms
49,312 KB |
testcase_27 | AC | 43 ms
49,732 KB |
testcase_28 | AC | 43 ms
49,500 KB |
testcase_29 | AC | 43 ms
49,696 KB |
testcase_30 | AC | 43 ms
49,264 KB |
testcase_31 | AC | 43 ms
49,256 KB |
testcase_32 | AC | 43 ms
49,396 KB |
testcase_33 | AC | 43 ms
49,312 KB |
testcase_34 | AC | 43 ms
49,300 KB |
testcase_35 | AC | 44 ms
49,408 KB |
testcase_36 | AC | 43 ms
49,388 KB |
testcase_37 | AC | 44 ms
49,292 KB |
testcase_38 | AC | 43 ms
49,328 KB |
testcase_39 | AC | 43 ms
49,328 KB |
testcase_40 | AC | 42 ms
49,380 KB |
testcase_41 | AC | 44 ms
49,364 KB |
testcase_42 | AC | 43 ms
49,364 KB |
testcase_43 | AC | 43 ms
49,332 KB |
testcase_44 | AC | 42 ms
49,412 KB |
testcase_45 | AC | 43 ms
49,404 KB |
testcase_46 | AC | 43 ms
49,448 KB |
testcase_47 | AC | 43 ms
49,552 KB |
testcase_48 | AC | 43 ms
49,372 KB |
testcase_49 | AC | 43 ms
49,360 KB |
testcase_50 | AC | 43 ms
49,564 KB |
testcase_51 | AC | 45 ms
49,276 KB |
testcase_52 | AC | 43 ms
49,364 KB |
testcase_53 | AC | 43 ms
49,188 KB |
testcase_54 | AC | 43 ms
49,272 KB |
testcase_55 | AC | 44 ms
49,316 KB |
testcase_56 | AC | 44 ms
49,480 KB |
testcase_57 | AC | 45 ms
49,300 KB |
testcase_58 | AC | 43 ms
49,392 KB |
testcase_59 | AC | 45 ms
49,412 KB |
testcase_60 | AC | 44 ms
49,760 KB |
testcase_61 | AC | 44 ms
49,240 KB |
testcase_62 | AC | 43 ms
49,408 KB |
testcase_63 | AC | 43 ms
49,228 KB |
testcase_64 | AC | 43 ms
49,404 KB |
testcase_65 | AC | 43 ms
49,216 KB |
testcase_66 | AC | 43 ms
49,344 KB |
testcase_67 | AC | 44 ms
49,220 KB |
testcase_68 | AC | 42 ms
49,192 KB |
testcase_69 | AC | 43 ms
49,296 KB |
testcase_70 | AC | 43 ms
49,380 KB |
testcase_71 | AC | 44 ms
49,292 KB |
testcase_72 | AC | 42 ms
49,368 KB |
testcase_73 | AC | 43 ms
49,404 KB |
testcase_74 | AC | 42 ms
49,312 KB |
testcase_75 | AC | 43 ms
49,696 KB |
testcase_76 | AC | 42 ms
49,304 KB |
testcase_77 | AC | 43 ms
49,196 KB |
testcase_78 | AC | 43 ms
49,312 KB |
testcase_79 | AC | 43 ms
49,356 KB |
testcase_80 | AC | 42 ms
49,360 KB |
testcase_81 | AC | 43 ms
49,364 KB |
testcase_82 | AC | 41 ms
49,328 KB |
testcase_83 | AC | 42 ms
49,308 KB |
testcase_84 | AC | 43 ms
49,372 KB |
testcase_85 | AC | 42 ms
49,248 KB |
testcase_86 | AC | 42 ms
49,372 KB |
ソースコード
package adv2016; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class N462 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int mod = 1000000007; long[] f = new long[100]; f[0] = 1; for(int i = 1;i < 100;i++)f[i] = f[i-1] * i % mod; int n = ni(), K = ni(); long[] a = new long[K+2]; for(int i = 0;i < K;i++){ a[i+1] = nl(); } a[K+1] = (1L<<n)-1; Arrays.sort(a); long ret = 1; for(int i = 0;i <= K;i++){ if((a[i+1]&a[i]) != a[i]){ out.println(0); return; } ret = ret * f[Long.bitCount(a[i+1]-a[i])] % mod; } out.println(ret); } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new N462().run(); } private byte[] inbuf = new byte[1024]; public 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))){ // when nextLine, (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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }