結果

問題 No.1153 ねこちゃんゲーム
ユーザー keijakkeijak
提出日時 2021-06-22 09:10:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 6,514 bytes
コンパイル時間 3,655 ms
コンパイル使用メモリ 234,972 KB
実行使用メモリ 270,356 KB
最終ジャッジ日時 2024-06-23 05:51:11
合計ジャッジ時間 49,472 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 6 ms
5,376 KB
testcase_03 AC 6 ms
5,376 KB
testcase_04 AC 6 ms
5,376 KB
testcase_05 AC 6 ms
5,376 KB
testcase_06 RE -
testcase_07 AC 967 ms
137,436 KB
testcase_08 AC 942 ms
137,600 KB
testcase_09 RE -
testcase_10 AC 950 ms
137,384 KB
testcase_11 RE -
testcase_12 AC 955 ms
137,472 KB
testcase_13 AC 936 ms
137,392 KB
testcase_14 RE -
testcase_15 AC 984 ms
137,468 KB
testcase_16 RE -
testcase_17 AC 981 ms
147,316 KB
testcase_18 AC 995 ms
157,720 KB
testcase_19 RE -
testcase_20 AC 1,049 ms
178,176 KB
testcase_21 AC 1,029 ms
178,128 KB
testcase_22 AC 937 ms
145,068 KB
testcase_23 AC 970 ms
152,952 KB
testcase_24 AC 1,081 ms
152,696 KB
testcase_25 AC 1,036 ms
168,024 KB
testcase_26 AC 1,101 ms
167,880 KB
testcase_27 AC 1,100 ms
236,560 KB
testcase_28 AC 1,331 ms
270,356 KB
testcase_29 TLE -
testcase_30 AC 1,454 ms
257,852 KB
testcase_31 RE -
testcase_32 TLE -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
  for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;
using u64 = unsigned long long;

template <typename T, typename U>
inline bool chmax(T &a, U b) {
  return a < b and ((a = std::move(b)), true);
}
template <typename T, typename U>
inline bool chmin(T &a, U b) {
  return a > b and ((a = std::move(b)), true);
}
template <typename T>
inline int ssize(const T &a) {
  return (int)std::size(a);
}

template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (auto &x : a) is >> x;
  return is;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) {
  return os << "(" << a.first << ", " << a.second << ")";
}
template <typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
                        std::string_view ends = "\n",
                        std::ostream &os = std::cout) {
  auto b = std::begin(a), e = std::end(a);
  for (auto it = std::begin(a); it != e; ++it) {
    if (it != b) os << sep;
    os << *it;
  }
  return os << ends;
}
template <typename T, typename = void>
struct is_iterable : std::false_type {};
template <typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
                                  decltype(std::end(std::declval<T>()))>>
    : std::true_type {};

template <typename T, typename = std::enable_if_t<
                          is_iterable<T>::value &&
                          !std::is_same<T, std::string_view>::value &&
                          !std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
  return print_seq(a, ", ", "", (os << "{")) << "}";
}

void print() { std::cout << "\n"; }
template <class T>
void print(const T &x) {
  std::cout << x << "\n";
}
template <typename Head, typename... Tail>
void print(const Head &head, Tail... tail) {
  std::cout << head << " ";
  print(tail...);
}

void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T &value, Ts &...args) {
  std::cin >> value;
  read_from_cin(args...);
}
#define VAR(type, ...) \
  type __VA_ARGS__;    \
  read_from_cin(__VA_ARGS__);

#ifdef ENABLE_DEBUG
#include "debug_dump.hpp"
#else
#define DUMP(...)
#endif

using namespace std;

struct Edge {
  int to;
};

template <typename Task>
class InplaceRerooting {
 public:
  using NV = typename Task::NodeValue;
  using EV = typename Task::EdgeValue;

  Task task;
  int n;                             // number of nodes
  std::vector<std::vector<Edge>> g;  // graph (tree)
  std::vector<NV> sub;               // values for each subtree rooted at i
  std::vector<NV> full;              // values for each entire tree rooted at i
  int base_root;                     // base root node where we start DFS

  explicit InplaceRerooting(Task task, std::vector<std::vector<Edge>> g,
                            int r = 0)
      : task(move(task)),
        n((int)g.size()),
        g(move(g)),
        sub(n),
        full(n),
        base_root(r) {}

  const std::vector<NV> &run() {
    pull_up(base_root, -1);
    NV leaf_val = task.add_node(task.id(), base_root);
    push_down(base_root, -1, leaf_val);
    return full;
  }

 private:
  NV pull_up(int v, int par) {
    EV res = task.id();
    for (auto &e : g[v]) {
      int u = e.to;
      if (u == par) continue;
      auto sub = task.add_edge(pull_up(u, v), e);
      task.merge_inplace(res, std::move(sub));
    }
    return (sub[v] = task.add_node(res, v));
  }

  void push_down(int v, int par, NV upper_sub) {
    int m = g[v].size();
    EV agg = task.id();

    for (int i = 0; i < m; ++i) {
      auto &e = g[v][i];
      int u = e.to;
      if (u == par) {
        task.merge_inplace(agg, task.add_edge(upper_sub, e));
      } else {
        task.merge_inplace(agg, task.add_edge(sub[u], e));
      }
    }
    full[v] = task.add_node(agg, v);

    for (int i = 0; i < m; ++i) {
      auto &e = g[v][i];
      int u = e.to;
      if (u == par) continue;
      EV edge_value = task.add_edge(sub[u], e);
      task.subtract_inplace(agg, edge_value);
      NV next_upper_sub = task.add_node(agg, v);
      push_down(u, v, std::move(next_upper_sub));
      task.merge_inplace(agg, std::move(edge_value));
    }
  }
};

struct InplaceTask {
  struct NodeValue {
    unsigned nimber;
    map<unsigned, set<int>> nexts;
  };
  struct EdgeValue {
    map<unsigned, set<int>> nimbers;
  };

  EdgeValue id() const { return {}; }

  NodeValue add_node(const EdgeValue &e, int node) const {
    NodeValue res;
    unsigned mex = 0;
    for (auto &[g, tos] : e.nimbers) {
      if (tos.empty()) continue;
      if (g == mex) {
        res.nexts[g].insert(ALL(tos));
        mex++;
      } else if (g > mex) {
        break;
      }
    }
    res.nimber = mex;
    return res;
  }

  EdgeValue add_edge(NodeValue val, const Edge &edge) const {
    EdgeValue res;
    res.nimbers[val.nimber].insert(edge.to);
    return res;
  }

  void merge_inplace(EdgeValue &agg, const EdgeValue &x) const {
    for (auto &[g, tos] : x.nimbers) {
      agg.nimbers[g].insert(ALL(tos));
    }
  }

  void subtract_inplace(EdgeValue &agg, const EdgeValue &x) const {
    for (auto &[g, tos] : x.nimbers) {
      for (auto to : tos) {
        agg.nimbers[g].erase(to);
        if (agg.nimbers[g].empty()) {
          agg.nimbers.erase(g);
        }
      }
    }
  }
};

pair<int, int> solve() {
  int n, m;
  cin >> n >> m;
  vector<int> a(m);
  REP(i, m) {
    cin >> a[i];
    --a[i];
  }
  vector<vector<Edge>> g(n);
  REP(i, n - 1) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    g[u].push_back({v});
    g[v].push_back({u});
  }

  InplaceTask task;
  InplaceRerooting<InplaceTask> solver(task, g);
  auto res = solver.run();

  unsigned ag = 0;
  unsigned maxg = 0;
  int mi = -1;
  REP(i, m) {
    auto node = res[a[i]];
    ag ^= node.nimber;
    if (chmax(maxg, node.nimber)) {
      mi = i;
    }
  }
  if (ag == 0) {
    return {-1, -1};
  }
  unsigned tg = (ag ^ maxg);
  assert(tg < maxg);
  DUMP(mi);
  assert(mi >= 0);
  auto nv = res[a.at(mi)];
  assert(not nv.nexts[tg].empty());
  int to = *nv.nexts[tg].begin();
  return {mi + 1, to + 1};
}

int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  auto [i, v] = solve();
  cout << i << " " << v << "\n";
}
0