結果

問題 No.2726 Rooted Tree Nim
ユーザー ir5ir5
提出日時 2024-07-10 00:04:27
言語 C++23(gcc13)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 552 ms / 2,000 ms
コード長 4,576 bytes
コンパイル時間 3,925 ms
コンパイル使用メモリ 162,284 KB
実行使用メモリ 55,316 KB
最終ジャッジ日時 2024-07-10 00:04:37
合計ジャッジ時間 10,574 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 331 ms
5,376 KB
testcase_02 AC 321 ms
17,024 KB
testcase_03 AC 552 ms
55,220 KB
testcase_04 AC 525 ms
55,316 KB
testcase_05 AC 324 ms
36,780 KB
testcase_06 AC 350 ms
36,960 KB
testcase_07 AC 395 ms
41,216 KB
testcase_08 AC 390 ms
41,216 KB
testcase_09 AC 261 ms
12,800 KB
testcase_10 AC 278 ms
12,484 KB
testcase_11 AC 270 ms
16,128 KB
testcase_12 AC 373 ms
37,120 KB
testcase_13 AC 298 ms
12,604 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

namespace solver {

template<typename T1, typename T2> struct In2 {
  T1 a; T2 b;
  friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};

template<typename T1, typename T2, typename T3> struct In3 {
  T1 a; T2 b; T3 c;
  friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};

using EdgeCost = ll;
struct E {
  int fr, to, eid; EdgeCost cost;
  E(int fr_, int to_, int eid_, EdgeCost cost_) : fr(fr_), to(to_), eid(eid_), cost(cost_) {}
  friend ostream &operator<<(ostream &os, const E &e) { os << "(" << e.fr << " -> " << e.to << ")"; return os; }
};
using V = vector<E>;
struct G {
  int n, e_count;
  vector<V> adj, rev;
  G(int n_) : n(n_), e_count(0), adj(n), rev(n) {}

  void add_directed_edge(int fr, int to, EdgeCost cost = (EdgeCost)1) {
    assert(0 <= fr && fr < n); assert(0 <= to && to < n); E e(fr, to, e_count++, cost); adj[fr].push_back(e); rev[to].push_back(e);
  }
  void add_undirected_edge(int fr, int to, EdgeCost cost = (EdgeCost)1) {
    assert(0 <= fr && fr < n); assert(0 <= to && to < n); E e1(fr, to, e_count, cost), e2(to, fr, e_count++, cost);
    adj[fr].push_back(e1); rev[to].push_back(e1); adj[to].push_back(e2); rev[to].push_back(e2);
  }
};

template<typename T>
void vec_unique(vector<T>& v) {
  ranges::sort(v);
  auto result = ranges::unique(v);
  v.erase(result.begin(), result.end());
}

int mex(vector<int> v) {
  vec_unique(v);
  dump(v);
  int res = 0;
  for (int x : v) {
    if (x != res) return res;
    res++;
  }
  return res;
}

void experiment() {
  int n, k; cin >> n >> k;
  vector<vector<int>> g(n, vector<int>(n));

  for (int y : range(n)) {
    for (int x : range(n - y)) {
      vector<int> ns;
      for (int i : range(1, k + 1)) {
        {
          int nx = x - i, ny = y;
          if (nx >= 0 && ny >= 0) {
            ns.push_back(g[ny][nx]);
          }
        }
        {
          int nx = x + i, ny = y - i;
          if (nx >= 0 && ny >= 0) {
            ns.push_back(g[ny][nx]);
          }
        }
      }
      g[y][x] = mex(ns);
    }
  }

  for (int y : range(n)) dump(g[y]);
}

int n, k;
vector<In2<int, int>> edges;
vector<int> vals;

void read() {
  cin >> n >> k;
  take(edges, n - 1);
  take(vals, n);
}

using RetType = string;

int dfs(G& g, int now, int par, int depth) {
  int sum = (depth & 1) ? (vals[now - 1] % (k + 1)) : 0;

  for (auto e : g.adj[now]) if (e.to != par) {
    sum ^= dfs(g, e.to, now, depth + 1);
  }

  return sum;
}

RetType run() {
  G g(n + 1);
  for (auto p : edges) {
    g.add_undirected_edge(p.a, p.b);
  }
  int sum = dfs(g, 1, -1, 0);

  return sum ? "K" : "P";
}

}  // namespace

template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }

int main(int argc, char** argv) {
  // solver::experiment();
  // return 0;
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase;
  cin >> testcase;
  while (testcase--) {
    solver::read();
    run(solver::run);
  }
}
0