#407387 (C#(csc)) No.939 and or

• 問題: No.939 and or
• ユーザー: EmKjp
• 提出日時: 2019-12-10 22:59:31
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 29 ms / 2,000 ms
• コード長: 4,899 bytes
• コンパイル時間: 5,167 ms
• コンパイル使用メモリ: 114,736 KB
• 実行使用メモリ: 18,176 KB
• 最終ジャッジ日時: 2024-06-24 02:33:36
• 合計ジャッジ時間: 4,001 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	24 ms; 18,176 KB
testcase_01	AC	24 ms; 18,176 KB
testcase_02	AC	24 ms; 18,048 KB
testcase_03	AC	23 ms; 18,048 KB
testcase_04	AC	24 ms; 18,048 KB
testcase_05	AC	24 ms; 18,048 KB
testcase_06	AC	24 ms; 17,920 KB
testcase_07	AC	24 ms; 18,176 KB
testcase_08	AC	24 ms; 18,176 KB
testcase_09	AC	24 ms; 17,920 KB
testcase_10	AC	29 ms; 18,048 KB
testcase_11	AC	24 ms; 18,048 KB
testcase_12	AC	24 ms; 18,176 KB
testcase_13	AC	24 ms; 17,920 KB
testcase_14	AC	24 ms; 18,176 KB
testcase_15	AC	25 ms; 17,792 KB
testcase_16	AC	24 ms; 17,920 KB
testcase_17	AC	24 ms; 17,920 KB
testcase_18	AC	24 ms; 17,792 KB
testcase_19	AC	24 ms; 18,048 KB
testcase_20	AC	24 ms; 18,176 KB
testcase_21	AC	24 ms; 18,048 KB
testcase_22	AC	24 ms; 17,920 KB
testcase_23	AC	24 ms; 17,920 KB
testcase_24	AC	25 ms; 17,920 KB
testcase_25	AC	25 ms; 18,176 KB
testcase_26	AC	24 ms; 17,920 KB
testcase_27	AC	24 ms; 17,920 KB
testcase_28	AC	24 ms; 17,664 KB
testcase_29	AC	24 ms; 18,048 KB
testcase_30	AC	24 ms; 18,176 KB
testcase_31	AC	24 ms; 18,048 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

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

using E = System.Linq.Enumerable;

internal partial class Solver {
    private static int PopCount(ulong x) {
        x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL);
        x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);
        x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fUL;
        x += x >> 8;
        x += x >> 16;
        x += x >> 32;
        return (int)(x & 0x7FLU);
    }

    public void Run() {
        var a = nl();
        var b = nl();

        cout.WriteLine(Solve((ulong)a, (ulong)b));
    }

    private long Solve(ulong and, ulong or) {
        if ((or & and) != and) return 0;
        if (and == or) return 1;
        var rank = PopCount(or) - PopCount(and);
        return 1L << (rank - 1);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            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;
        }
    }
}