結果

問題 No.1055 牛歩
コンテスト
ユーザー hos.lyric
提出日時 2020-05-15 22:49:36
言語 D
(dmd 2.109.1)
結果
TLE  
実行時間 -
コード長 5,522 bytes
コンパイル時間 805 ms
コンパイル使用メモリ 122,756 KB
実行使用メモリ 34,252 KB
最終ジャッジ日時 2024-06-22 07:04:03
合計ジャッジ時間 5,473 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample -- * 5
other TLE * 1 -- * 69
権限があれば一括ダウンロードができます

ソースコード

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)); }

// T, S: monoid
// opTT: T * T -> T
// opST: S * T * int -> T
//   (s t_a) ... (s t_{b-1}) = opST(s, t_a ... t_{b-1}, b - a)
// opSS: S * S -> S
// query(a, b, s): t_a <- s t_a, ..., t_{b-1} <- s t_{b-1};
//   returns t_a ... t_{b-1}
class SegmentTree(T, S, alias opTT, alias opST, alias opSS) {
  import std.functional : binaryFun;
  alias opTTFun = binaryFun!opTT;
  alias opSTFun = opST;
  alias opSSFun = binaryFun!opSS;
  const(T) idT;
  const(S) idS;

  int n;
  T[] ts;
  S[] ss;
  this(int n_, const(T) idT, const(S) idS) {
    this.idT = idT;
    this.idS = idS;
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ss = new S[n << 1];
    ts[] = idT;
    ss[] = idS;
  }
  ref T at(int a) {
    return ts[n + a];
  }
  void build() {
    foreach_reverse (a; 1 .. n) ts[a] = opTTFun(ts[a << 1], ts[a << 1 | 1]);
  }
  T query(int a, int b, const(S) s) {
    return query(1, 0, n, a, b, s);
  }

 private:
  T query(int u, int l, int r, int a, int b, const(S) s) {
    if (a < l) a = l;
    if (b > r) b = r;
    if (a >= b) return idT;
    if (a == l && b == r) {
      ts[u] = opSTFun(s, ts[u], r - l);
      ss[u] = opSSFun(s, ss[u]);
      return ts[u];
    }
    const int uL = u << 1, uR = u << 1 | 1;
    const int mid = (l + r) >> 1;
    // speed-up: if (ss[u] != idS)
    {
      ts[uL] = opSTFun(ss[u], ts[uL], mid - l);
      ts[uR] = opSTFun(ss[u], ts[uR], r - mid);
      ss[uL] = opSSFun(ss[u], ss[uL]);
      ss[uR] = opSSFun(ss[u], ss[uR]);
      ss[u] = idS;
    }
    const T resL = query(uL, l, mid, a, b, s);
    const T resR = query(uR, mid, r, a, b, s);
    ts[u] = opTTFun(ts[uL], ts[uR]);
    return opTTFun(resL, resR);
  }
}



void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto A = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt();
      }
      const Q = readInt();
      auto B = new int[Q];
      foreach (q; 0 .. Q) {
        B[q] = readInt() - 1;
      }
      
      auto qss = new int[][M];
      foreach (q; 0 .. Q) {
        qss[B[q]] ~= q;
      }
      debug {
        writeln("qss = ", qss);
      }
      
      bool ans;
      auto seg = new SegmentTree!(int, int, max, (s, t, sz) => ((s == -2) ? t : s), max)(Q, 0, -2);
      foreach (i; 0 .. M) {
        const len = cast(int)(qss[i].length);
        qss[i] ~= Q;
        {
          const mx = seg.query(0, qss[i][0], -2);
          if (!(mx < A[i])) {
            goto failed;
          }
        }
        seg.query(0, qss[i][0], A[i]);
        int a = A[i];
        foreach (j; 0 .. len) {
          const mx = seg.query(qss[i][j], qss[i][j + 1], -2);
          if (mx < a - 1) {
            debug {
              writeln(i, " ", qss[i][j], ": -");
            }
            --a;
          } else if (mx < a + 1) {
            debug {
              writeln(i, " ", qss[i][j], ": +");
            }
            ++a;
          } else {
            goto failed;
          }
          seg.query(qss[i][j], qss[i][j + 1], a);
        }
      }
      {
        const mx = seg.query(0, Q, -2);
        if (!(mx < N + 1)) {
          goto failed;
        }
      }
      ans = true;
     failed:
      
      // debug {
        bool brt;
        auto nums = new int[Q];
        nums[] = 0;
        foreach (i; 0 .. M) {
          const len = cast(int)(qss[i].length) - 1;
          // const len = cast(int)(qss[i].length);
          // qss[i] ~= Q;
          foreach (q; 0 .. qss[i][0]) {
            if (!(nums[q] < A[i])) {
              goto failedBrute;
            }
          }
          nums[0 .. qss[i][0]] = A[i];
          int a = A[i];
          foreach (j; 0 .. len) {
            const mx = nums[qss[i][j] .. qss[i][j + 1]].maxElement;
            if (mx < a - 1) {
              // writeln(i, " ", qss[i][j], ": -");
              --a;
            } else if (mx < a + 1) {
              // writeln(i, " ", qss[i][j], ": +");
              ++a;
            } else {
              goto failedBrute;
            }
            nums[qss[i][j] .. qss[i][j + 1]] = a;
          }
        }
        if (!(nums.maxElement < N + 1)) {
          goto failedBrute;
        }
        brt = true;
       failedBrute:
        // writeln("brt = ", brt);
        assert(brt == ans);
      // }
      
      writeln(ans ? "YES" : "NO");
    }
  } catch (EOFException e) {
  }
}
0