結果

問題 No.1189 Sum is XOR
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-08-22 14:15:03
言語 D
(dmd 2.105.2)
結果
AC  
実行時間 29 ms / 2,000 ms
コード長 3,712 bytes
コンパイル時間 1,629 ms
コンパイル使用メモリ 154,696 KB
実行使用メモリ 12,072 KB
最終ジャッジ日時 2023-09-04 09:09:00
合計ジャッジ時間 4,003 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
12,072 KB
testcase_01 AC 28 ms
11,052 KB
testcase_02 AC 26 ms
10,920 KB
testcase_03 AC 12 ms
5,884 KB
testcase_04 AC 10 ms
5,620 KB
testcase_05 AC 16 ms
6,012 KB
testcase_06 AC 25 ms
11,628 KB
testcase_07 AC 13 ms
6,060 KB
testcase_08 AC 6 ms
4,380 KB
testcase_09 AC 6 ms
4,376 KB
testcase_10 AC 5 ms
4,380 KB
testcase_11 AC 8 ms
5,336 KB
testcase_12 AC 25 ms
11,368 KB
testcase_13 AC 24 ms
7,072 KB
testcase_14 AC 16 ms
5,916 KB
testcase_15 AC 9 ms
4,380 KB
testcase_16 AC 9 ms
5,020 KB
testcase_17 AC 8 ms
4,384 KB
testcase_18 AC 10 ms
5,584 KB
testcase_19 AC 20 ms
6,408 KB
testcase_20 AC 21 ms
6,356 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

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 E = 10;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      
      Mint ans;
      if (K <= E) {
        auto freq = new int[1 << E];
        foreach (i; 0 .. N) {
          ++freq[A[i]];
        }
        auto dp = new Mint[][](K + 1, 1 << E);
        dp[0][0] = 1;
        foreach (p; 1 .. 1 << E) {
          const sup = ((1 << E) - 1) ^ p;
          foreach_reverse (k; 0 .. K) {
            for (int q = sup; ; --q &= sup) {
              dp[k + 1][q | p] += dp[k][q] * freq[p];
              if (!q) {
                break;
              }
            }
          }
        }
        ans = dp[K].sum;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0