結果

問題 No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー EmKjpEmKjp
提出日時 2020-12-02 15:49:42
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 11,729 bytes
コンパイル時間 1,060 ms
コンパイル使用メモリ 119,072 KB
実行使用メモリ 28,632 KB
最終ジャッジ日時 2024-06-12 13:57:55
合計ジャッジ時間 5,602 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
27,008 KB
testcase_01 AC 24 ms
24,828 KB
testcase_02 AC 25 ms
26,996 KB
testcase_03 AC 25 ms
26,464 KB
testcase_04 AC 54 ms
24,880 KB
testcase_05 AC 37 ms
24,824 KB
testcase_06 AC 27 ms
24,828 KB
testcase_07 AC 48 ms
25,084 KB
testcase_08 AC 28 ms
27,248 KB
testcase_09 AC 47 ms
27,020 KB
testcase_10 AC 42 ms
25,080 KB
testcase_11 AC 47 ms
26,992 KB
testcase_12 AC 43 ms
27,288 KB
testcase_13 AC 38 ms
27,008 KB
testcase_14 AC 40 ms
26,900 KB
testcase_15 AC 39 ms
24,952 KB
testcase_16 AC 42 ms
26,888 KB
testcase_17 AC 29 ms
24,828 KB
testcase_18 AC 40 ms
24,952 KB
testcase_19 AC 33 ms
24,960 KB
testcase_20 AC 27 ms
24,960 KB
testcase_21 AC 32 ms
26,992 KB
testcase_22 AC 43 ms
25,228 KB
testcase_23 AC 44 ms
25,004 KB
testcase_24 AC 51 ms
25,264 KB
testcase_25 AC 27 ms
26,964 KB
testcase_26 AC 27 ms
24,880 KB
testcase_27 AC 27 ms
27,160 KB
testcase_28 AC 26 ms
26,924 KB
testcase_29 AC 26 ms
24,824 KB
testcase_30 AC 27 ms
27,120 KB
testcase_31 AC 25 ms
28,632 KB
testcase_32 AC 27 ms
24,992 KB
testcase_33 AC 25 ms
24,920 KB
testcase_34 AC 26 ms
25,084 KB
testcase_35 AC 24 ms
22,704 KB
testcase_36 AC 25 ms
24,932 KB
testcase_37 AC 24 ms
24,824 KB
testcase_38 AC 24 ms
24,692 KB
testcase_39 AC 24 ms
26,200 KB
testcase_40 AC 24 ms
22,968 KB
testcase_41 AC 24 ms
28,232 KB
testcase_42 AC 27 ms
25,152 KB
testcase_43 AC 26 ms
25,028 KB
testcase_44 AC 27 ms
24,952 KB
04_evil_A_01 RE -
04_evil_A_02 RE -
04_evil_A_03 RE -
04_evil_A_04 RE -
04_evil_A_05 RE -
04_evil_A_06 RE -
04_evil_A_07 RE -
04_evil_A_08 RE -
04_evil_A_09 RE -
04_evil_A_10 RE -
05_evil_B_01 RE -
05_evil_B_02 RE -
05_evil_B_03 RE -
05_evil_B_04 RE -
05_evil_B_05 RE -
05_evil_B_06 RE -
05_evil_B_07 RE -
05_evil_B_08 RE -
05_evil_B_09 RE -
05_evil_B_10 RE -
06_evil_C_01 RE -
06_evil_C_02 RE -
06_evil_C_03 RE -
06_evil_C_04 RE -
06_evil_C_05 RE -
06_evil_C_06 RE -
06_evil_C_07 RE -
06_evil_C_08 RE -
06_evil_C_09 RE -
06_evil_C_10 AC 24 ms
27,136 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;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;
using System.Threading;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var k = ni();
        var x = ni();
        var y = ni();
        x = Math.Min(x, 1023);
        y = Math.Min(y, 1023);
        var a = ni(k);

        //n = 4;
        //a = E.Range(0, 1024 / 4).ToArray();

        a = a.Distinct().ToArray();
        k = a.Length;

        if (n <= 15) {
            ModInt.SetMod998244353();
            var dp = new ModInt[n + 1, 1024]; // k, xor
            dp[0, 0] = 1;
            for (int i = 1; i <= n; i++) {
                foreach (var v in a) {
                    for (int j = 0; j < 1024; j++) {
                        dp[i, j ^ v] += dp[i - 1, j];
                    }
                }
            }

            for (int i = 0; i <= n; i++) {
                for (int j = 1; j < 1024; j++) {
                    dp[i, j] += dp[i, j - 1];
                }
            }
            var ans = new ModInt();

            for (int mask = 0; mask < (1 << (n - 1)); mask++) {
                int g = 0;
                ModInt t = 1;
                for (int i = 0; i < n; i++) {
                    int cnt = 1;
                    while ((mask & (1 << i)) != 0) {
                        i++;
                        cnt++;
                    }
                    if (cnt % 2 == 0) {
                        t *= k;
                    } else {
                        g++;
                    }
                }
                var sub = dp[g, y];
                if (x - 1 >= 0) sub -= dp[g, x - 1];
                sub *= t;

                if (PopCount((uint)mask) % 2 == 0) {
                    ans += sub;
                } else {
                    ans -= sub;
                }
            }
            cout.WriteLine(ans);
        } else {
            var memo = new long?[n, 1024, 1025];
            // O(n * 1024 * k * k)
            long dfs(int pos = 0, int xor = 0, int pre = -1) {
                if (pos == n) return (x <= xor && xor <= y) ? 1 : 0;
                ref var ret = ref memo[pos, xor, pre + 1];
                if (!ret.HasValue) {
                    long val = 0;
                    foreach (var p in a) {
                        if (pre == p) continue;
                        val += dfs(pos + 1, xor ^ p, p);
                    }
                    ret = val;
                }
                return ret.Value;
            }
            cout.WriteLine(dfs() % 998244353);
        }
    }

    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 partial struct ModInt : IEquatable<ModInt> {
    private static int mod = 0;
    private long _value;

    public ModInt(long x) {
        _value = x;
        Normalize();
    }

    private static long RegularMod(long x, int mod) {
        if (x >= mod) {
            if (x < 2 * mod) {
                return x - mod;
            }

            return x % mod;
        }
        if (x >= 0) {
            return x;
        }

        x = mod - RegularMod(-x, mod);
        return x == mod ? 0 : x;
    }

    public static int SetModValue(int m) {
        return mod = m;
    }
    public static int SetMod998244353() { return SetModValue(998244353); }
    public static int SetMod1000000007() { return SetModValue(1000000007); }

    private void Normalize() {
        _value = RegularMod(_value, mod);
    }

    public override string ToString() {
        return _value.ToString(CultureInfo.InvariantCulture);
    }

    public int ToInt() {
        return (int)_value;
    }

    public static bool operator ==(ModInt c1, ModInt c2) {
        return c1._value == c2._value;
    }

    public static bool operator !=(ModInt c1, ModInt c2) {
        return !(c1 == c2);
    }

    public static ModInt operator +(ModInt x, ModInt y) {
        return new ModInt(x._value + y._value);
    }
    public static ModInt operator -(ModInt x, ModInt y) {
        return new ModInt(x._value - y._value);
    }
    public static ModInt operator -(ModInt x) {
        return new ModInt(-x._value);
    }
    public static ModInt operator *(ModInt x, ModInt y) {
        return new ModInt(x._value * y._value);
    }
    public static ModInt operator /(ModInt x, ModInt y) {
        return new ModInt(x._value * Inverse(y._value, mod));
    }
    public static ModInt operator ++(ModInt x) {
        return x + 1;
    }
    public static ModInt operator --(ModInt x) {
        return x - 1;
    }
    public static ModInt Pow(ModInt x, long n) {
        ModInt r = 1;
        while (n > 0) {
            if ((n & 1) != 0) {
                r *= x;
            }

            x *= x;
            n >>= 1;
        }
        return r;
    }
    private static long ExtendedGcd(long a, long b, out long x, out long y) {
        if (b == 0) {
            x = 1; y = 0;
            return a;
        } else {
            var d = ExtendedGcd(b, a % b, out y, out x);
            y -= a / b * x;
            return d;
        }
    }

    private static long Inverse(long a, long mod) {
        long x = 0, y = 0;
        if (ExtendedGcd(a, mod, out x, out y) == 1) {
            return (x + mod) % mod;
        } else {
            throw new Exception("Invalid inverse " + a + " " + mod);
        }
    }

    public static implicit operator ModInt(long x) {
        return new ModInt(x);
    }

    public override bool Equals(object obj) {
        if (obj == null) {
            return false;
        }
        return _value.Equals(((ModInt)obj)._value);
    }

    public override int GetHashCode() {
        return _value.GetHashCode();
    }

    public bool Equals(ModInt other) {
        return _value.Equals(other._value);
    }
    object ToDump() { return _value; }
}


// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    static readonly int? StackSizeInMebiByte = null; //50;
    public static void StartAndJoin(Action action, int maxStackSize) {
        var thread = new Thread(new ThreadStart(action), maxStackSize);
        thread.Start();
        thread.Join();
    }

    public static void Main() {
#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 });
        if (StackSizeInMebiByte.HasValue) {
            StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
        } else {
            new Solver(Console.In, Console.Out).Run();
        }
        Console.Out.Flush();
#endif
    }

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

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    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
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

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

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

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    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 (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}
0