結果
問題 | No.911 ラッキーソート |
ユーザー | uwi |
提出日時 | 2019-10-18 21:45:23 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 108 ms / 2,000 ms |
コード長 | 3,862 bytes |
コンパイル時間 | 4,604 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 37,416 KB |
最終ジャッジ日時 | 2023-09-07 21:47:53 |
合計ジャッジ時間 | 10,168 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
33,352 KB |
testcase_01 | AC | 37 ms
33,316 KB |
testcase_02 | AC | 38 ms
33,784 KB |
testcase_03 | AC | 37 ms
33,412 KB |
testcase_04 | AC | 38 ms
33,504 KB |
testcase_05 | AC | 38 ms
33,728 KB |
testcase_06 | AC | 39 ms
33,616 KB |
testcase_07 | AC | 38 ms
33,544 KB |
testcase_08 | AC | 39 ms
33,872 KB |
testcase_09 | AC | 38 ms
33,424 KB |
testcase_10 | AC | 37 ms
33,480 KB |
testcase_11 | AC | 37 ms
33,360 KB |
testcase_12 | AC | 38 ms
33,712 KB |
testcase_13 | AC | 104 ms
37,080 KB |
testcase_14 | AC | 108 ms
37,220 KB |
testcase_15 | AC | 106 ms
36,780 KB |
testcase_16 | AC | 107 ms
37,264 KB |
testcase_17 | AC | 101 ms
36,988 KB |
testcase_18 | AC | 106 ms
37,396 KB |
testcase_19 | AC | 105 ms
37,416 KB |
testcase_20 | AC | 105 ms
36,824 KB |
testcase_21 | AC | 108 ms
37,220 KB |
testcase_22 | AC | 105 ms
36,696 KB |
testcase_23 | AC | 104 ms
37,048 KB |
testcase_24 | AC | 104 ms
36,676 KB |
testcase_25 | AC | 104 ms
36,172 KB |
testcase_26 | AC | 82 ms
35,540 KB |
testcase_27 | AC | 71 ms
35,552 KB |
testcase_28 | AC | 72 ms
34,788 KB |
testcase_29 | AC | 49 ms
33,980 KB |
testcase_30 | AC | 42 ms
33,528 KB |
testcase_31 | AC | 38 ms
33,708 KB |
testcase_32 | AC | 37 ms
33,612 KB |
testcase_33 | AC | 37 ms
33,520 KB |
testcase_34 | AC | 37 ms
33,404 KB |
testcase_35 | AC | 38 ms
33,520 KB |
testcase_36 | AC | 37 ms
33,492 KB |
testcase_37 | AC | 38 ms
33,612 KB |
testcase_38 | AC | 106 ms
37,024 KB |
testcase_39 | AC | 104 ms
36,844 KB |
testcase_40 | AC | 47 ms
33,476 KB |
testcase_41 | AC | 106 ms
37,012 KB |
testcase_42 | AC | 99 ms
36,172 KB |
testcase_43 | AC | 104 ms
36,868 KB |
testcase_44 | AC | 106 ms
36,956 KB |
testcase_45 | AC | 106 ms
36,932 KB |
testcase_46 | AC | 102 ms
37,104 KB |
testcase_47 | AC | 101 ms
37,232 KB |
testcase_48 | AC | 105 ms
36,872 KB |
ソースコード
package contest191018; 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 D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { // 00101001 // 00101010 // 異なる箇所 dでひっくり返れば良いのでそこが0または1で固定 int n = ni(); long L = nl(), R = nl(); long[] a = new long[n]; for(int i = 0;i < n;i++) { a[i] = nl(); } long mz = 0; long mo = 0; for(int i = 0;i < n-1;i++) { int h = Long.numberOfTrailingZeros(Long.highestOneBit(a[i]^a[i+1])); if(a[i] < a[i+1]) { mz |= 1L<<h; }else { mo |= 1L<<h; } } if((mo&mz) != 0) { out.println(0); return; } out.println(count(R, mz, mo) - count(L-1, mz, mo)); } long count(long R, long mz, long mo) { R++; long ans = 0; for(int i = 61;i >= 0;i--) { if(R<<~i<0) { long val = R>>>i+1<<i+1; if((val&mz)>>>i != 0)continue; if((~val&mo)>>>i != 0)continue; ans += 1L<<i-Long.bitCount((mz|mo)&(1L<<i)-1); } } return ans; } 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 D().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)); } }