結果

問題 No.2726 Rooted Tree Nim
ユーザー ir5
提出日時 2024-07-09 23:37:13
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,480 bytes
コンパイル時間 5,023 ms
コンパイル使用メモリ 156,668 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-09 23:37:23
合計ジャッジ時間 10,330 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 5 WA * 8
権限があれば一括ダウンロードができます

ソースコード

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; }
};
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;
RetType run() {
  int sum = 0;
  for (auto p : edges) {
    if (p.a > p.b) swap(p.a, p.b);
    if (p.a == 1) sum ^= vals[p.b - 1] % (k + 1);
  }
  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);
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0