結果

問題 No.1789 Tree Growing
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-12-18 00:22:37
言語 D
(dmd 2.106.1)
結果
TLE  
実行時間 -
コード長 5,604 bytes
コンパイル時間 930 ms
コンパイル使用メモリ 127,020 KB
実行使用メモリ 18,440 KB
最終ジャッジ日時 2023-09-04 15:24:00
合計ジャッジ時間 22,054 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
10,772 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 3 ms
4,380 KB
testcase_03 AC 5 ms
4,380 KB
testcase_04 AC 3 ms
4,376 KB
testcase_05 AC 3 ms
4,376 KB
testcase_06 AC 7 ms
4,380 KB
testcase_07 AC 7 ms
4,380 KB
testcase_08 AC 4 ms
4,380 KB
testcase_09 AC 5 ms
4,376 KB
testcase_10 AC 4 ms
4,376 KB
testcase_11 AC 12 ms
4,376 KB
testcase_12 AC 4 ms
4,376 KB
testcase_13 AC 10 ms
4,380 KB
testcase_14 AC 8 ms
4,380 KB
testcase_15 AC 27 ms
4,380 KB
testcase_16 AC 10 ms
4,380 KB
testcase_17 AC 36 ms
4,380 KB
testcase_18 AC 27 ms
4,380 KB
testcase_19 AC 17 ms
4,380 KB
testcase_20 AC 41 ms
4,380 KB
testcase_21 AC 96 ms
5,936 KB
testcase_22 AC 49 ms
4,376 KB
testcase_23 AC 57 ms
4,376 KB
testcase_24 AC 75 ms
6,208 KB
testcase_25 AC 191 ms
14,220 KB
testcase_26 AC 191 ms
13,784 KB
testcase_27 AC 181 ms
11,668 KB
testcase_28 AC 167 ms
13,160 KB
testcase_29 AC 219 ms
12,856 KB
testcase_30 AC 246 ms
14,436 KB
testcase_31 AC 270 ms
14,556 KB
testcase_32 AC 255 ms
14,576 KB
testcase_33 AC 267 ms
14,748 KB
testcase_34 AC 323 ms
17,912 KB
testcase_35 AC 226 ms
13,452 KB
testcase_36 AC 315 ms
14,508 KB
testcase_37 AC 314 ms
16,764 KB
testcase_38 AC 296 ms
14,508 KB
testcase_39 AC 232 ms
14,508 KB
testcase_40 AC 294 ms
14,516 KB
testcase_41 AC 362 ms
16,800 KB
testcase_42 AC 345 ms
18,440 KB
testcase_43 AC 432 ms
16,752 KB
testcase_44 AC 377 ms
18,216 KB
testcase_45 AC 356 ms
17,136 KB
testcase_46 AC 437 ms
18,188 KB
testcase_47 AC 466 ms
17,408 KB
testcase_48 AC 488 ms
17,280 KB
testcase_49 AC 448 ms
17,052 KB
testcase_50 AC 439 ms
17,012 KB
testcase_51 AC 430 ms
17,748 KB
testcase_52 AC 463 ms
17,344 KB
testcase_53 AC 469 ms
16,812 KB
testcase_54 AC 238 ms
17,296 KB
testcase_55 AC 210 ms
14,572 KB
testcase_56 AC 327 ms
18,208 KB
testcase_57 AC 434 ms
14,520 KB
testcase_58 AC 283 ms
17,596 KB
testcase_59 AC 305 ms
14,048 KB
testcase_60 TLE -
testcase_61 -- -
testcase_62 -- -
testcase_63 -- -
testcase_64 -- -
testcase_65 -- -
testcase_66 -- -
testcase_67 -- -
testcase_68 -- -
testcase_69 -- -
testcase_70 -- -
testcase_71 -- -
testcase_72 -- -
testcase_73 -- -
testcase_74 -- -
testcase_75 -- -
testcase_76 -- -
testcase_77 -- -
testcase_78 -- -
testcase_79 -- -
testcase_80 -- -
testcase_81 -- -
testcase_82 -- -
testcase_83 -- -
testcase_84 -- -
testcase_85 -- -
testcase_86 -- -
testcase_87 -- -
権限があれば一括ダウンロードができます

ソースコード

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


// Dijkstra
class MinCostFlow(Capa, Cost, Capa CAPA_EPS = 0) {
  int n, m;
  int[][] g;
  int[] as, bs;
  Capa[] capa;
  Cost[] cost, pot;
  Capa tof;
  Cost toc;
  this(int n) {
    this.n = n; m = 0; g = new int[][n]; as = []; bs = []; capa = []; cost = [];
  }
  int addEdge(int u, int v, Capa w, Cost c) {
    debug {
      // writeln("addEdge ", u, " ", v, " ", w, " ", c);
    }
    const i = m;
    g[u] ~= m; as ~= u; bs ~= v; capa ~= w; cost ~= c; ++m;
    g[v] ~= m; as ~= v; bs ~= u; capa ~= 0; cost ~= -c; ++m;
    return i;
  }
  bool solve(int source, int sink, Capa flow) {
    pot = new Cost[n];
    pot[] = 0;
    for (; ; ) {
      bool cont;
      foreach (u; 0 .. n) foreach (i; g[u]) if (capa[i] > CAPA_EPS) {
        const v = bs[i];
        if (pot[v] > pot[u] + cost[i]) {
          pot[v] = pot[u] + cost[i];
          cont = true;
        }
      }
      if (!cont) break;
    }
    auto dist = new Cost[n];
    auto prei = new int[n];
    auto vis = new bool[n];
    for (tof = 0, toc = 0; tof + CAPA_EPS < flow; ) {
      alias Entry = Tuple!(Cost, "c", int, "u");
      BinaryHeap!(Array!Entry, "a > b") que;
      dist[] = -1;
      prei[] = -1;
      vis[] = false;
      dist[source] = 0;
      prei[source] = -2;
      que.insert(Entry(0, source));
      for (; !que.empty(); ) {
        const c = que.front.c;
        const u = que.front.u;
        que.removeFront;
        if (vis[u]) continue;
        vis[u] = true;
        foreach (i; g[u]) if (capa[i] > CAPA_EPS) {
          const v = bs[i];
          if (vis[v]) continue;
          const cc = c + cost[i] + pot[u] - pot[v];
          if (prei[v] == -1 || dist[v] > cc) {
            dist[v] = cc;
            prei[v] = i;
            que.insert(Entry(cc, v));
          }
        }
      }
      if (!vis[sink]) return false;
      Capa f = flow - tof;
      for (int v = sink; v != source; ) {
        const i = prei[v];
        if (f > capa[i]) f = capa[i];
        v = as[i];
      }
      for (int v = sink; v != source; ) {
        const i = prei[v];
        capa[i] -= f; capa[i ^ 1] += f;
        v = as[i];
      }
      tof += f;
      toc += f * (dist[sink] - pot[source] + pot[sink]);
      pot[] += dist[];
    }
    return true;
  }
}


int[2] N;
int[][2] A, B;

int[][][2] G;

int[int] cache;
int calc(int u0, int p0, int u1, int p1) {
  const key = u0 | p0 << 8 | u1 << 16 | p1 << 24;
  auto ptr = key in cache;
  if (ptr) {
    return *ptr;
  }
  int[2] vsLens;
  int[][2] vss;
  foreach (h; 0 .. 2) {
    const u = (h == 0) ? u0 : u1;
    const p = (h == 0) ? p0 : p1;
    foreach (i; G[h][u]) {
      const v = A[h][i] ^ B[h][i] ^ u;
      if (v != p) {
        vss[h] ~= v;
      }
    }
    vsLens[h] = cast(int)(vss[h].length);
  }
  auto mcf = new MinCostFlow!(int, int)(2 + vsLens[0] + vsLens[1]);
  foreach (x; 0 .. vsLens[0]) {
    mcf.addEdge(0, 2 + x, 1, 0);
  }
  foreach (y; 0 .. vsLens[1]) {
    mcf.addEdge(2 + vsLens[0] + y, 1, 1, 0);
  }
  foreach (x; 0 .. vsLens[0]) foreach (y; 0 .. vsLens[1]) {
    const score = calcSub(vss[0][x], u0, vss[1][y], u1);
    if (score >= 0) {
      mcf.addEdge(2 + x, 2 + vsLens[0] + y, 1, -(1 + score));
    }
  }
  const status = mcf.solve(0, 1, vsLens[0]);
  const ret = status ? -mcf.toc : -1;
  return cache[key] = ret;
}

int[int] cacheSub;
int calcSub(int u0, int p0, int u1, int p1) {
  const key = u0 | p0 << 8 | u1 << 16 | p1 << 24;
  auto ptr = key in cacheSub;
  if (ptr) {
    return *ptr;
  }
  int ret = calc(u0, p0, u1, p1);
  foreach (i; G[1][u1]) {
    const v1 = A[1][i] ^ B[1][i] ^ u1;
    if (v1 != p1) {
      const res = calcSub(u0, p0, v1, u1);
      if (res >= 0) {
        chmax(ret, 1 + res);
      }
    }
  }
  return cacheSub[key] = ret;
}


void main() {
  try {
    for (; ; ) {
      foreach (h; 0 .. 2) {
        N[h] = readInt;
        A[h] = new int[N[h] - 1];
        B[h] = new int[N[h] - 1];
        foreach (i; 0 .. N[h] - 1) {
          A[h][i] = readInt - 1;
          B[h][i] = readInt - 1;
        }
      }
      
      foreach (h; 0 .. 2) {
        G[h] = new int[][N[h]];
        foreach (i; 0 .. N[h] - 1) {
          G[h][A[h][i]] ~= i;
          G[h][B[h][i]] ~= i;
        }
      }
      
      cache.clear;
      cacheSub.clear;
      int ans = -1;
      foreach (r0; 0 .. N[0]) foreach (r1; 0 .. N[1]) {
        chmax(ans, calc(r0, N[0], r1, N[1]));
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0