結果
問題 | No.916 Encounter On A Tree |
ユーザー | uwi |
提出日時 | 2019-10-25 21:44:47 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,921 bytes |
コンパイル時間 | 5,380 ms |
コンパイル使用メモリ | 78,508 KB |
実行使用メモリ | 51,972 KB |
最終ジャッジ日時 | 2023-09-30 18:03:35 |
合計ジャッジ時間 | 10,532 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,368 KB |
testcase_01 | AC | 43 ms
49,212 KB |
testcase_02 | AC | 42 ms
49,348 KB |
testcase_03 | AC | 73 ms
51,548 KB |
testcase_04 | AC | 42 ms
49,240 KB |
testcase_05 | AC | 72 ms
51,764 KB |
testcase_06 | AC | 42 ms
49,588 KB |
testcase_07 | AC | 72 ms
51,644 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 43 ms
49,280 KB |
testcase_11 | WA | - |
testcase_12 | AC | 47 ms
49,228 KB |
testcase_13 | WA | - |
testcase_14 | AC | 42 ms
49,184 KB |
testcase_15 | WA | - |
testcase_16 | AC | 42 ms
49,280 KB |
testcase_17 | AC | 74 ms
51,748 KB |
testcase_18 | AC | 42 ms
49,228 KB |
testcase_19 | AC | 72 ms
51,960 KB |
testcase_20 | AC | 43 ms
49,288 KB |
testcase_21 | AC | 72 ms
51,648 KB |
testcase_22 | AC | 42 ms
49,096 KB |
testcase_23 | AC | 73 ms
51,536 KB |
testcase_24 | AC | 42 ms
49,236 KB |
testcase_25 | AC | 73 ms
51,928 KB |
testcase_26 | AC | 43 ms
49,260 KB |
testcase_27 | AC | 62 ms
50,212 KB |
testcase_28 | AC | 43 ms
49,236 KB |
testcase_29 | AC | 73 ms
51,708 KB |
testcase_30 | AC | 43 ms
49,344 KB |
testcase_31 | AC | 44 ms
49,248 KB |
testcase_32 | AC | 43 ms
49,364 KB |
testcase_33 | AC | 43 ms
49,220 KB |
testcase_34 | AC | 55 ms
50,040 KB |
testcase_35 | AC | 49 ms
50,152 KB |
testcase_36 | WA | - |
testcase_37 | AC | 72 ms
51,520 KB |
testcase_38 | AC | 54 ms
50,176 KB |
testcase_39 | AC | 42 ms
49,192 KB |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 43 ms
49,336 KB |
testcase_43 | AC | 43 ms
49,208 KB |
testcase_44 | AC | 44 ms
49,492 KB |
testcase_45 | AC | 49 ms
50,108 KB |
testcase_46 | AC | 43 ms
49,296 KB |
testcase_47 | WA | - |
testcase_48 | AC | 44 ms
49,228 KB |
testcase_49 | WA | - |
testcase_50 | AC | 42 ms
49,508 KB |
testcase_51 | WA | - |
testcase_52 | AC | 42 ms
49,200 KB |
testcase_53 | WA | - |
testcase_54 | AC | 42 ms
49,632 KB |
testcase_55 | AC | 42 ms
49,232 KB |
testcase_56 | AC | 42 ms
49,340 KB |
testcase_57 | AC | 42 ms
49,224 KB |
testcase_58 | WA | - |
testcase_59 | AC | 43 ms
49,268 KB |
testcase_60 | AC | 43 ms
49,280 KB |
ソースコード
package contest191025; 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 C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int D = ni(); int L = ni(), R = ni(); int K = ni(); int DL = Integer.numberOfTrailingZeros(Integer.highestOneBit(L)) + 1; int DR = Integer.numberOfTrailingZeros(Integer.highestOneBit(R)) + 1; // DL + DR - 2*lca = k int dk = DL + DR - K; int mod = 1000000007; if(dk % 2 != 0) { out.println(0); return; } dk /= 2; if(1 <= dk && dk <= DL && dk <= DR) { long ans = 1; for(int i = 1;i <= D;i++) { if(i == DR) { if(i == DL) { ans = ans * (1L<<DR-1)%mod; ans = ans * (1L<<(DR-dk-1))%mod; for(int j = 1;j <= (1<<i-1)-2;j++) { ans = ans * j % mod; } }else { ans = ans * (1L<<(DR-dk-1))%mod; for(int j = 1;j <= (1<<i-1)-1;j++) { ans = ans * j % mod; } } }else { for(int j = 1;j <= (1<<i-1);j++) { ans = ans * j % mod; } } } out.println(ans); }else { out.println(0); } } 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 C().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)); } }