結果

問題 No.916 Encounter On A Tree
ユーザー EmKjpEmKjp
提出日時 2019-10-25 22:43:28
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 80 ms / 2,000 ms
コード長 5,820 bytes
コンパイル時間 5,703 ms
コンパイル使用メモリ 109,580 KB
実行使用メモリ 30,528 KB
最終ジャッジ日時 2023-10-11 07:03:51
合計ジャッジ時間 11,164 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
20,772 KB
testcase_01 AC 58 ms
20,888 KB
testcase_02 AC 79 ms
28,468 KB
testcase_03 AC 79 ms
30,436 KB
testcase_04 AC 78 ms
26,416 KB
testcase_05 AC 79 ms
30,396 KB
testcase_06 AC 79 ms
28,300 KB
testcase_07 AC 80 ms
30,432 KB
testcase_08 AC 60 ms
23,244 KB
testcase_09 AC 64 ms
22,284 KB
testcase_10 AC 58 ms
20,760 KB
testcase_11 AC 59 ms
18,748 KB
testcase_12 AC 78 ms
28,420 KB
testcase_13 AC 78 ms
26,316 KB
testcase_14 AC 78 ms
28,340 KB
testcase_15 AC 78 ms
30,396 KB
testcase_16 AC 62 ms
22,172 KB
testcase_17 AC 79 ms
28,500 KB
testcase_18 AC 58 ms
20,904 KB
testcase_19 AC 80 ms
28,380 KB
testcase_20 AC 78 ms
26,380 KB
testcase_21 AC 80 ms
30,388 KB
testcase_22 AC 79 ms
28,392 KB
testcase_23 AC 79 ms
28,364 KB
testcase_24 AC 78 ms
28,380 KB
testcase_25 AC 79 ms
30,528 KB
testcase_26 AC 68 ms
24,344 KB
testcase_27 AC 69 ms
24,212 KB
testcase_28 AC 64 ms
24,288 KB
testcase_29 AC 79 ms
30,420 KB
testcase_30 AC 79 ms
28,456 KB
testcase_31 AC 79 ms
28,368 KB
testcase_32 AC 79 ms
28,404 KB
testcase_33 AC 69 ms
26,332 KB
testcase_34 AC 63 ms
22,180 KB
testcase_35 AC 60 ms
19,180 KB
testcase_36 AC 79 ms
28,328 KB
testcase_37 AC 79 ms
28,396 KB
testcase_38 AC 64 ms
22,236 KB
testcase_39 AC 80 ms
28,572 KB
testcase_40 AC 79 ms
28,368 KB
testcase_41 AC 57 ms
20,860 KB
testcase_42 AC 58 ms
24,836 KB
testcase_43 AC 58 ms
20,880 KB
testcase_44 AC 57 ms
20,792 KB
testcase_45 AC 60 ms
19,260 KB
testcase_46 AC 58 ms
20,864 KB
testcase_47 AC 57 ms
22,880 KB
testcase_48 AC 57 ms
20,972 KB
testcase_49 AC 59 ms
22,900 KB
testcase_50 AC 57 ms
20,804 KB
testcase_51 AC 57 ms
20,896 KB
testcase_52 AC 57 ms
22,800 KB
testcase_53 AC 57 ms
20,788 KB
testcase_54 AC 57 ms
20,788 KB
testcase_55 AC 57 ms
20,896 KB
testcase_56 AC 58 ms
22,900 KB
testcase_57 AC 58 ms
20,832 KB
testcase_58 AC 57 ms
20,784 KB
testcase_59 AC 57 ms
20,844 KB
testcase_60 AC 59 ms
22,768 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    const int mod = 1000000000 + 7;

    private int GetDepth(int x) {
        for (int depth = 1; depth < 30; depth++) {
            var lower = 1 << (depth - 1);
            var upper = lower * 2;
            if (lower <= x && x < upper) return depth;
        }
        throw new Exception();
    }
    public void Run() {
        var d = ni();
        var l = ni();
        var r = ni();
        var k = ni();

        var depthL = GetDepth(l) - 1;
        var depthR = GetDepth(r) - 1;

        var diff = Math.Abs(depthL - depthR);
        var fact = new long[(1 << d) + 10];
        fact[0] = fact[1] = 1;
        for (int i = 2; i < fact.Length; i++) {
            fact[i] = fact[i - 1] * i % mod;
        }

        long choose = 1;

        for (int i = 0; i < d; i++) {
            var p = 1 << i;
            if (depthL == i) p--;
            if (depthR == i) p--;
            choose *= fact[p];
            choose %= mod;
        }
        long ans = 0;
        if ((k - diff) >= 0 && (k - diff) % 2 == 0) {
            var x = (k - diff) / 2;

            //new { x, diff }.Dump();
            var lcpDepth = Math.Min(depthL, depthR) - x;
            if (lcpDepth >= 0) {
                if (x == 0) {
                    ans = choose;
                    ans *= 1 << lcpDepth;
                    ans %= mod;
                    ans *= 1 << diff;
                    ans %= mod;
                } else {
                    ans = 2 * choose;
                    ans %= mod;
                    ans *= 1 << lcpDepth;
                    ans %= mod;
                    var freeDepthL = Math.Max(x - 1, 0);
                    var freeDepthR = Math.Max(x + diff - 1, 0);
                    ans *= 1L << freeDepthL;
                    ans %= mod;
                    ans *= 1L << freeDepthR;
                    ans %= mod;
                }
            }
        }

        cout.WriteLine(ans);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}
0