結果

問題 No.916 Encounter On A Tree
ユーザー uwiuwi
提出日時 2019-10-25 21:44:47
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,921 bytes
コンパイル時間 4,073 ms
コンパイル使用メモリ 80,556 KB
実行使用メモリ 52,032 KB
最終ジャッジ日時 2024-07-23 11:43:48
合計ジャッジ時間 9,649 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
49,900 KB
testcase_01 AC 53 ms
50,324 KB
testcase_02 AC 54 ms
50,168 KB
testcase_03 AC 86 ms
51,444 KB
testcase_04 AC 55 ms
50,292 KB
testcase_05 AC 87 ms
51,412 KB
testcase_06 AC 55 ms
50,308 KB
testcase_07 AC 88 ms
51,356 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 54 ms
50,048 KB
testcase_11 WA -
testcase_12 AC 54 ms
50,140 KB
testcase_13 WA -
testcase_14 AC 55 ms
50,248 KB
testcase_15 WA -
testcase_16 AC 54 ms
50,288 KB
testcase_17 AC 89 ms
51,456 KB
testcase_18 AC 54 ms
50,112 KB
testcase_19 AC 88 ms
51,388 KB
testcase_20 AC 53 ms
49,984 KB
testcase_21 AC 88 ms
51,460 KB
testcase_22 AC 55 ms
50,396 KB
testcase_23 AC 88 ms
51,456 KB
testcase_24 AC 54 ms
50,484 KB
testcase_25 AC 87 ms
51,576 KB
testcase_26 AC 54 ms
50,280 KB
testcase_27 AC 74 ms
51,320 KB
testcase_28 AC 54 ms
50,068 KB
testcase_29 AC 85 ms
51,416 KB
testcase_30 AC 54 ms
50,080 KB
testcase_31 AC 54 ms
50,020 KB
testcase_32 AC 54 ms
49,960 KB
testcase_33 AC 57 ms
50,284 KB
testcase_34 AC 67 ms
50,752 KB
testcase_35 AC 60 ms
50,288 KB
testcase_36 WA -
testcase_37 AC 86 ms
51,348 KB
testcase_38 AC 68 ms
50,792 KB
testcase_39 AC 54 ms
50,296 KB
testcase_40 WA -
testcase_41 WA -
testcase_42 AC 53 ms
50,244 KB
testcase_43 AC 54 ms
50,136 KB
testcase_44 AC 54 ms
50,076 KB
testcase_45 AC 59 ms
50,192 KB
testcase_46 AC 53 ms
50,284 KB
testcase_47 WA -
testcase_48 AC 54 ms
50,256 KB
testcase_49 WA -
testcase_50 AC 54 ms
50,268 KB
testcase_51 WA -
testcase_52 AC 54 ms
50,492 KB
testcase_53 WA -
testcase_54 AC 55 ms
50,032 KB
testcase_55 AC 55 ms
50,352 KB
testcase_56 AC 57 ms
50,288 KB
testcase_57 AC 55 ms
49,972 KB
testcase_58 WA -
testcase_59 AC 56 ms
50,276 KB
testcase_60 AC 58 ms
50,264 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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)); }
}
0