結果

問題 No.1296 OR or NOR
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-11-20 22:19:49
言語 D
(dmd 2.099.1)
結果
AC  
実行時間 1,971 ms / 3,000 ms
コード長 3,788 bytes
コンパイル時間 1,471 ms
使用メモリ 68,564 KB
最終ジャッジ日時 2023-02-23 18:47:54
合計ジャッジ時間 28,196 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
6,252 KB
testcase_01 AC 2 ms
6,252 KB
testcase_02 AC 290 ms
63,716 KB
testcase_03 AC 296 ms
63,728 KB
testcase_04 AC 927 ms
63,664 KB
testcase_05 AC 905 ms
63,592 KB
testcase_06 AC 334 ms
63,072 KB
testcase_07 AC 327 ms
62,780 KB
testcase_08 AC 327 ms
63,000 KB
testcase_09 AC 365 ms
68,564 KB
testcase_10 AC 397 ms
68,324 KB
testcase_11 AC 325 ms
63,516 KB
testcase_12 AC 310 ms
65,400 KB
testcase_13 AC 343 ms
65,816 KB
testcase_14 AC 1,971 ms
65,720 KB
testcase_15 AC 1,686 ms
63,672 KB
testcase_16 AC 1,703 ms
63,648 KB
testcase_17 AC 321 ms
62,940 KB
testcase_18 AC 309 ms
63,080 KB
testcase_19 AC 319 ms
63,036 KB
testcase_20 AC 157 ms
11,904 KB
testcase_21 AC 160 ms
12,104 KB
testcase_22 AC 146 ms
12,156 KB
testcase_23 AC 147 ms
12,264 KB
testcase_24 AC 158 ms
12,256 KB
testcase_25 AC 162 ms
11,960 KB
testcase_26 AC 155 ms
12,216 KB
testcase_27 AC 164 ms
12,048 KB
testcase_28 AC 150 ms
12,280 KB
testcase_29 AC 159 ms
12,096 KB
testcase_30 AC 1,797 ms
63,544 KB
testcase_31 AC 1,769 ms
63,552 KB
testcase_32 AC 1,804 ms
63,584 KB
testcase_33 AC 1,744 ms
64,532 KB
testcase_34 AC 1,768 ms
64,644 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)); }


enum E = 60;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      const Q = readInt();
      auto B = new long[Q];
      foreach (q; 0 .. Q) {
        B[q] = readLong();
      }
      
      debug {
        foreach (i; 0 .. N) {
          // writefln("%60b %20s", A[i], A[i]);
        }
        auto brt = new int[Q];
        brt[] = N + 1;
        foreach (p; 0 .. 1 << N) {
          long x;
          foreach (i; 0 .. N) {
            x |= A[i];
            if (p & 1 << i) {
              x ^= (1L << E) - 1;
            }
          }
          // writefln("%0*b %s: %60b %20s", N, p, popcnt(p), x, x);
          foreach (q; 0 .. Q) {
            if (x == B[q]) {
              chmin(brt[q], popcnt(p));
            }
          }
        }
        foreach (q; 0 .. Q) {
          if (brt[q] > N) {
            brt[q] = -1;
          }
        }
        writeln("brt = ", brt);
      }
      
      auto prev = new int[E][N + 1];
      prev[0][] = -1;
      foreach (i; 0 .. N) {
        prev[i + 1][] = prev[i][];
        foreach (e; 0 .. E) {
          if ((A[i] >> e) & 1) {
            prev[i + 1][e] = i;
          }
        }
      }
      
      foreach (q; 0 .. Q) {
        int ans;
        long mask = (1L << E) - 1;
        long tar = B[q];
        for (int i = N; ; ) {
          int jm = -1;
          foreach (e; 0 .. E) {
            if ((mask >> e) & 1) {
              chmax(jm, prev[i][e]);
            }
          }
          if (jm == -1) {
            if (!(tar & mask)) {
              // OK
            } else if (!(~tar & mask)) {
              debug {
                writeln("special i = ", i);
              }
              if (i == 0) {
                ans = -1;
              } else {
                ++ans;
              }
            } else {
              ans = -1;
            }
            break;
          } else {
            const force = A[jm] & mask;
            debug {
              // writefln("i = %s, mask = %s, tar = %s: jm = %s, force = %s", i, mask, tar, jm, force);
            }
            if (!(~tar & force)) {
              mask &= ~force;
              tar = tar & mask;
            } else if (!(tar & force)) {
              ++ans;
              mask &= ~force;
              tar = ~tar & mask;
            } else {
              ans = -1;
              break;
            }
            i = jm;
          }
        }
        writeln(ans);
        debug {
          assert(brt[q] == ans);
        }
      }
    }
  } catch (EOFException e) {
  }
}
0