結果

問題 No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-12-01 02:39:02
言語 D
(dmd 2.106.1)
結果
MLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,864 bytes
コンパイル時間 2,122 ms
コンパイル使用メモリ 161,660 KB
実行使用メモリ 792,752 KB
最終ジャッジ日時 2024-06-12 09:33:09
合計ジャッジ時間 11,711 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 MLE -
testcase_02 MLE -
testcase_03 MLE -
testcase_04 AC 33 ms
21,080 KB
testcase_05 MLE -
testcase_06 MLE -
testcase_07 MLE -
testcase_08 AC 3 ms
5,376 KB
testcase_09 AC 19 ms
11,136 KB
testcase_10 AC 13 ms
10,972 KB
testcase_11 AC 19 ms
11,036 KB
testcase_12 AC 16 ms
11,128 KB
testcase_13 AC 9 ms
6,784 KB
testcase_14 AC 15 ms
11,136 KB
testcase_15 AC 11 ms
10,752 KB
testcase_16 AC 16 ms
11,008 KB
testcase_17 AC 4 ms
5,376 KB
testcase_18 AC 16 ms
11,096 KB
testcase_19 AC 7 ms
5,504 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 9 ms
6,144 KB
testcase_22 AC 18 ms
11,136 KB
testcase_23 AC 22 ms
11,136 KB
testcase_24 AC 24 ms
11,136 KB
testcase_25 AC 3 ms
5,376 KB
testcase_26 AC 3 ms
5,376 KB
testcase_27 AC 5 ms
5,376 KB
testcase_28 AC 3 ms
5,376 KB
testcase_29 AC 3 ms
5,376 KB
testcase_30 AC 3 ms
5,376 KB
testcase_31 AC 4 ms
5,376 KB
testcase_32 AC 5 ms
5,376 KB
testcase_33 AC 3 ms
5,376 KB
testcase_34 AC 4 ms
5,376 KB
testcase_35 AC 3 ms
5,376 KB
testcase_36 AC 4 ms
5,376 KB
testcase_37 AC 3 ms
5,376 KB
testcase_38 AC 3 ms
5,376 KB
testcase_39 AC 4 ms
5,376 KB
testcase_40 AC 3 ms
5,376 KB
testcase_41 AC 4 ms
5,376 KB
testcase_42 AC 3 ms
5,376 KB
testcase_43 AC 3 ms
5,376 KB
testcase_44 AC 4 ms
5,376 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 TLE -
05_evil_B_02 TLE -
05_evil_B_03 TLE -
05_evil_B_04 TLE -
05_evil_B_05 TLE -
05_evil_B_06 TLE -
05_evil_B_07 TLE -
05_evil_B_08 TLE -
05_evil_B_09 TLE -
05_evil_B_10 TLE -
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 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


struct ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;

enum M = 1 << 10;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      int K = readInt();
      const X = readInt();
      const Y = readInt();
      auto A = new int[K];
      foreach (k; 0 .. K) {
        A[k] = readInt();
      }
      A = A.sort.uniq.array;
      K = cast(int)(A.length);
      
      auto crt = new Mint[][](M, K);
      foreach (k; 0 .. K) {
        crt[A[k]][k] += 1;
      }
      foreach (i; 1 .. N) {
        auto nxt = new Mint[][](M, K);
        foreach (x; 0 .. M) {
          const sum = crt[x].sum;
          if (sum) {
            foreach (k; 0 .. K) {
              nxt[x ^ A[k]][k] += (sum - crt[x][k]);
            }
          }
        }
        debug {
          writeln(nxt[0 .. 16]);
        }
        crt = nxt;
      }
      
      Mint ans;
      foreach (x; 0 .. M) {
        if (X <= x && x <= Y) {
          ans += crt[x].sum;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0