結果

問題 No.916 Encounter On A Tree
ユーザー uwiuwi
提出日時 2019-10-25 21:46:12
言語 Java
(openjdk 23)
結果
AC  
実行時間 88 ms / 2,000 ms
コード長 4,063 bytes
コンパイル時間 5,717 ms
コンパイル使用メモリ 80,192 KB
実行使用メモリ 51,740 KB
最終ジャッジ日時 2024-07-23 15:48:25
合計ジャッジ時間 9,970 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 56
権限があれば一括ダウンロードができます

ソースコード

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(dk == DL) {
						ans = ans * (1L<<(DR-dk))%mod;
						for(int j = 1;j <= (1<<i-1)-1;j++) {
							ans = ans * j % mod;
						}
					}else 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