結果

問題 No.1295 木と駒
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-11-21 02:58:43
言語 D
(dmd 2.106.1)
結果
WA  
実行時間 -
コード長 5,375 bytes
コンパイル時間 1,164 ms
コンパイル使用メモリ 131,700 KB
実行使用メモリ 47,204 KB
最終ジャッジ日時 2024-06-22 10:00:53
合計ジャッジ時間 13,853 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 1 ms
6,940 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 1 ms
6,940 KB
testcase_14 WA -
testcase_15 AC 304 ms
15,248 KB
testcase_16 AC 288 ms
15,780 KB
testcase_17 AC 294 ms
15,648 KB
testcase_18 WA -
testcase_19 AC 277 ms
18,352 KB
testcase_20 AC 321 ms
46,068 KB
testcase_21 AC 292 ms
26,192 KB
testcase_22 AC 287 ms
20,280 KB
testcase_23 AC 294 ms
32,596 KB
testcase_24 AC 296 ms
32,804 KB
testcase_25 AC 276 ms
18,408 KB
testcase_26 AC 260 ms
47,048 KB
testcase_27 AC 262 ms
46,452 KB
testcase_28 AC 366 ms
43,852 KB
testcase_29 AC 264 ms
46,248 KB
testcase_30 AC 265 ms
46,636 KB
testcase_31 AC 266 ms
47,204 KB
testcase_32 AC 331 ms
35,772 KB
testcase_33 AC 293 ms
15,220 KB
testcase_34 AC 330 ms
15,148 KB
testcase_35 AC 299 ms
15,236 KB
testcase_36 AC 287 ms
15,180 KB
testcase_37 AC 293 ms
15,260 KB
testcase_38 AC 304 ms
15,088 KB
testcase_39 AC 291 ms
15,072 KB
testcase_40 AC 298 ms
15,196 KB
testcase_41 AC 285 ms
18,448 KB
testcase_42 AC 291 ms
20,512 KB
testcase_43 AC 283 ms
18,384 KB
testcase_44 AC 286 ms
18,512 KB
testcase_45 AC 283 ms
19,916 KB
testcase_46 AC 286 ms
18,060 KB
testcase_47 AC 288 ms
17,952 KB
testcase_48 AC 280 ms
18,200 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)); }


int N;
int[] A, B;

int[][] G;
int home(int u) {
  if (G[u].empty) {
    return -1;
  }
  const i = G[u][0];
  return A[i] ^ B[i] ^ u;
}

int[] par;
// 0: come back, 1: go
alias Result = int[2];
Result[] dp, DP;

void dfs(int u, int p) {
  par[u] = p;
  foreach (i; G[u]) {
    const v = A[i] ^ B[i] ^ u;
    if (v != p) {
      dfs(v, u);
    }
  }
  // init
  Result[] rs;
  foreach (i; G[u]) {
    const v = A[i] ^ B[i] ^ u;
    if (v != p) {
      // add dp[v]
      rs ~= dp[v];
    }
  }
  // calc dp[u]
  const len = cast(int)(rs.length);
  dp[u][0] = (p != -1 && p == home(u)) ? 1 : 0;
  foreach (j; 0 .. len) {
    dp[u][0] &= rs[j][0];
  }
  dp[u][1] = 1;
  if (len >= 1) {
    int okL = 1, okR = 1;
    okL &= (p != (A[G[u][0]] ^ B[G[u][0]] ^ u)) ? 1 : 0;
    okL &= rs[0][1];
    foreach (j; 1 .. len) {
      okL &= rs[j][0];
    }
    foreach (j; 0 .. len - 1) {
      okR &= rs[j][0];
    }
    okR &= rs[len - 1][1];
    dp[u][1] &= okL | okR;
  }
}

void DFS(int u, int p) {
  // init
  alias Entry = Tuple!(Result, "r", int, "v");
  Entry[] es;
  foreach (i; G[u]) {
    const v = A[i] ^ B[i] ^ u;
    /*
    if (v != p) {
      // add dp[v]
    }
    */
    if (v != p) {
      es ~= Entry(dp[v], v);
    } else {
      es ~= Entry(DP[u], -1);
    }
  }
  /*
  if (p != -1) {
    // add DP[u]
  }
  */
  /*
  foreach (i; G[u]) {
    const v = A[i] ^ B[i] ^ u;
    if (v != p) {
      // calc DP[v], removing dp[v]
    }
  }
  */
  const len = cast(int)(es.length);
  auto sums = new int[len + 1];
  foreach (j; 0 .. len) {
    sums[j + 1] = sums[j] + es[j].r[0];
  }
  foreach (j; 0 .. len) {
    const v = es[j].v;
    if (v != -1) {
      DP[v][0] = (home(u) == v) ? 1 : 0;
      DP[v][0] &= (sums[j] + (sums[len] - sums[j + 1]) >= len - 1) ? 1 : 0;
      DP[v][1] = 1;
      if (len - 1 >= 1) {
        int okL = 1, okR = 1;
        if (j == 0) {
          okL &= (sums[len] - sums[2] >= len - 2) ? 1 : 0;
          okL &= es[1].r[1];
        } else {
          okL &= ((sums[j] - sums[1]) + (sums[len] - sums[j + 1]) >= len - 2) ? 1 : 0;
          okL &= es[0].r[1];
        }
        if (j == len - 1) {
          okR &= (sums[len - 2] >= len - 2) ? 1 : 0;
          okR &= es[len - 2].r[1];
        } else {
          okR &= (sums[j] + (sums[len - 1] - sums[j + 1]) >= len - 2) ? 1 : 0;
          okR &= es[len - 1].r[1];
        }
        DP[v][1] &= okL | okR;
      }
    }
  }
  foreach (i; G[u]) {
    const v = A[i] ^ B[i] ^ u;
    if (v != p) {
      DFS(v, u);
    }
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new int[N];
      B = new int[N];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      G = new int[][N];
      foreach (i; 0 .. N - 1) {
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      foreach (u; 0 .. N) {
        G[u].sort!((i0, i1) => ((A[i0] ^ B[i0] ^ u) < (A[i1] ^ B[i1] ^ u)));
      }
      debug {
        writeln("G = ", G);
      }
      
      const rt = 0;
      par = new int[N];
      dp = new Result[N];
      dfs(rt, -1);
      DP = new Result[N];
      DFS(rt, -1);
      debug {
        writeln("rt = ", rt);
        writeln("dp = ", dp);
        writeln("DP = ", DP);
      }
      foreach (u; 0 .. N) {
        // init
        Result[] rs;
        foreach (i; G[u]) {
          const v = A[i] ^ B[i] ^ u;
          /*
          if (v != par[u]) {
            // add dp[v]
          }
          */
          if (v != par[u]) {
            rs ~= dp[v];
          } else {
            rs ~= DP[u];
          }
        }
        /*
        if (u != rt) {
          // add DP[u]
        }
        */
        debug {
          writeln(u, ": ", rs);
        }
        // calc ans, rooted at u
        const len = cast(int)(rs.length);
        int ans = 1;
        if (len >= 1) {
          int okL = 1, okR = 1;
          okL &= rs[0][1];
          foreach (j; 1 .. len) {
            okL &= rs[j][0];
          }
          foreach (j; 0 .. len - 1) {
            okR &= rs[j][0];
          }
          okR &= rs[len - 1][1];
          ans &= okL | okR;
        }
        writeln(ans ? "Yes" : "No");
      }
    }
  } catch (EOFException e) {
  }
}
0