提出 #70487406

---

ソースコード 拡げる

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

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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 INF = 1001001001;

void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        const M = readInt;
        auto A = new int[M];
        auto B = new int[M];
        foreach (i; 0 .. M) {
          A[i] = readInt - 1;
          B[i] = readInt - 1;
        }
        auto P = new int[N];
        foreach (j; 0 .. N) P[j] = readInt - 1;
        
        auto invP = new int[N];
        invP[] = -1;
        foreach (j; 0 .. N) invP[P[j]] = j;
        foreach (i; 0 .. M) {
          A[i] = P[A[i]];
          B[i] = P[B[i]];
        }
        debug writefln("A = %s, B = %s", A, B);
        P = invP = null;
        
        auto graph = new int[][N];
        foreach (i; 0 .. M) {
          graph[A[i]] ~= B[i];
        }
        
        /*
          gs: l -> known
          hs: known -> r
        */
        auto fs = new int[N];
        auto gs = new int[N];
        auto hs = new int[N];
        fs[] = 1;
        gs[] = -INF;
        hs[] = -INF;
        foreach (u; 0 .. N) {
          chmax(fs[u], gs[u]);
          chmax(hs[u], fs[u]);
          if (u + 1 < N) {
            chmax(gs[u + 1], gs[u]);
            chmax(hs[u + 1], hs[u]);
          }
          foreach (v; graph[u]) {
            chmax(fs[v], fs[u] + 1);
            chmax(gs[v], fs[u]);
            chmax(fs[v], hs[u] + 1);
          }
        }
        debug {
          writeln(fs);
          writeln(gs);
          writeln(hs);
        }
        
        const ans = N - fs.maxElement;
        writeln(ans);
        
        debug {{
          int[][] pss;
          {
            auto ps = iota(N).array;
            do {
              bool topo = true;
              foreach (i; 0 .. M) {
                topo = topo && (ps[A[i]] < ps[B[i]]);
              }
              if (topo) {
                pss ~= ps.dup;
              }
            } while (ps.nextPermutation);
          }
          int brt = int.max;
          int hm;
          foreach (h; 0 .. 1 << N) {
            int cnt;
            foreach (ps; pss) {
              bool ok = true;
              foreach (u; 0 .. N) if (h >> u & 1) {
                ok = ok && (ps[u] == u);
              }
              if (ok) ++cnt;
            }
            assert(cnt >= 1);
            if (cnt == 1) {
              if (chmin(brt, popcnt(h))) hm = h;
            }
          }
          write("brt = ", brt, "; ");
          foreach (u; 0 .. N) write(hm >> u & 1);
          writeln;
          if (brt != ans) {
            stderr.writeln("FAIL");
            stderr.writeln(N, " ", M);
            foreach (i; 0 .. M) {
              stderr.writeln(A[i] + 1, " ", B[i] + 1);
            }
            foreach (u; 0 .. N) stderr.write(u + 1, " ");
            stderr.writeln;
            assert(false);
          }
        }}
      }
    }
  } catch (EOFException e) {
  }
}
/*
1 0
1

6 5
3 4
4 5
1 2
1 5
3 6
1 2 3 4 5 6
*/

提出情報

ジャッジ結果