結果

問題 No.803 Very Limited Xor Subset
ユーザー 👑 hos.lyric
提出日時 2019-03-17 22:14:06
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 4 ms / 2,000 ms
コード長 3,971 bytes
コンパイル時間 1,645 ms
コンパイル使用メモリ 121,228 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-13 04:21:57
合計ジャッジ時間 2,511 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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)); }
enum MO = 10L^^9 + 7;
int N, M, X;
int[] A;
int[] T, L, R;
int[][] graph;
int[] color;
bool[] keep;
bool dfs(int u, int c) {
  color[u] = c;
  foreach (i; graph[u]) {
    const v = L[i] ^ R[i] ^ u;
    const cc = c ^ T[i];
    if (color[v] == -1) {
      color[v] = cc;
      keep[i] = true;
      if (!dfs(v, cc)) {
        return false;
      }
    } else {
      if (color[v] != cc) {
        return false;
      }
    }
  }
  return true;
}
void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      X = readInt();
      A = new int[N];
      foreach (j; 0 .. N) {
        A[j] = readInt();
      }
      T = new int[M];
      L = new int[M];
      R = new int[M];
      foreach (i; 0 .. M) {
        T[i] = readInt();
        L[i] = readInt() - 1;
        R[i] = readInt();
      }
      
      graph = new int[][N + 1];
      foreach (i; 0 .. M) {
        graph[L[i]] ~= i;
        graph[R[i]] ~= i;
      }
      color = new int[N + 1];
      color[] = -1;
      keep = new bool[M];
      bool ok = true;
      foreach (u; 0 .. N + 1) {
        if (color[u] == -1) {
          ok = ok && dfs(u, 0);
        }
      }
      
      long ans;
      if (ok) {
        debug {
          writeln("color = ", color);
          writeln("keep = ", keep);
        }
        int[][] a;
        foreach (pos; 0 .. 32) {
          auto row = new int[N + 1];
          foreach (j; 0 .. N) {
            row[j] = (A[j] >> pos) & 1;
          }
          row[N] = (X >> pos) & 1;
          a ~= row;
        }
        foreach (i; 0 .. M) {
          if (keep[i]) {
            auto row = new int[N + 1];
            foreach (j; L[i] .. R[i]) {
              row[j] = 1;
            }
            row[N] = T[i];
            a ~= row;
          }
        }
        const m = cast(int)(a.length);
        debug {
          writeln("a = ");
          foreach (i; 0 .. m) {
            writeln(a[i]);
          }
        }
        int r;
        foreach (h; 0 .. N) {
          foreach (i; r .. m) {
            if (a[i][h]) {
              swap(a[r], a[i]);
              break;
            }
          }
          if (r < m && a[r][h]) {
            foreach (i; r + 1 .. m) {
              if (a[i][h]) {
                foreach (j; h .. N + 1) {
                  a[i][j] ^= a[r][j];
                }
              }
            }
            ++r;
          }
        }
        debug {
          writeln("a = ");
          foreach (i; 0 .. m) {
            writeln(a[i]);
          }
          writeln("r = ", r);
        }
        bool zero = true;
        foreach (i; r .. m) {
          zero = zero && !a[i][N];
        }
        if (zero) {
          ans = 1;
          foreach (k; 0 .. N - r) {
            (ans *= 2) %= MO;
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0