結果
問題 | No.1295 木と駒 |
ユーザー |
![]() |
提出日時 | 2020-11-20 23:28:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,057 ms / 2,000 ms |
コード長 | 20,962 bytes |
コンパイル時間 | 3,171 ms |
コンパイル使用メモリ | 153,640 KB |
最終ジャッジ日時 | 2025-01-16 03:25:53 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 48 |
コンパイルメッセージ
main.cpp: In member function ‘void yosupo::Printer::flush()’: main.cpp:245:16: warning: ignoring return value of ‘ssize_t write(int, const void*, size_t)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 245 | ::write(fd, line, pos); | ~~~~~~~^~~~~~~~~~~~~~~
ソースコード
//#pragma GCC optimize("Ofast")//#pragma GCC target("avx")//#undef LOCAL#include <unistd.h>#include <algorithm>#include <array>#include <cctype>#include <cstring>#include <string>#include <type_traits>#include <vector>namespace yosupo {namespace internal {int ceil_pow2(int n) {int x = 0;while ((1U << x) < (unsigned int)(n)) x++;return x;}} // namespace internalint bsf(unsigned int n) { return __builtin_ctz(n); }int bsf(unsigned long n) { return __builtin_ctzl(n); }int bsf(unsigned long long n) { return __builtin_ctzll(n); }int bsr(unsigned int n) {return 8 * (int)sizeof(unsigned int) - 1 - __builtin_clz(n);}int bsr(unsigned long n) {return 8 * (int)sizeof(unsigned long) - 1 - __builtin_clzl(n);}int bsr(unsigned long long n) {return 8 * (int)sizeof(unsigned long long) - 1 - __builtin_clzll(n);}} // namespace yosupo#include <cassert>#include <numeric>#include <type_traits>namespace yosupo {namespace internal {template <class T>using is_signed_int128 =typename std::conditional<std::is_same<T, __int128_t>::value ||std::is_same<T, __int128>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int128 =typename std::conditional<std::is_same<T, __uint128_t>::value ||std::is_same<T, unsigned __int128>::value,std::true_type,std::false_type>::type;template <class T>using make_unsigned_int128 =typename std::conditional<std::is_same<T, __int128_t>::value,__uint128_t,unsigned __int128>;template <class T>using is_integral =typename std::conditional<std::is_integral<T>::value ||internal::is_signed_int128<T>::value ||internal::is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_signed_int = typename std::conditional<(is_integral<T>::value &&std::is_signed<T>::value) ||is_signed_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<(is_integral<T>::value &&std::is_unsigned<T>::value) ||is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int128<T>::value,make_unsigned_int128<T>,typename std::conditional<std::is_signed<T>::value,std::make_unsigned<T>,std::common_type<T>>::type>::type;template <class T>using is_integral_t = std::enable_if_t<is_integral<T>::value>;template <class T>using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;template <class T>using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;template <class T> using to_unsigned_t = typename to_unsigned<T>::type;} // namespace internal} // namespace yosuponamespace yosupo {struct Scanner {public:Scanner(FILE* fp) : fd(fileno(fp)) {}void read() {}template <class H, class... T> void read(H& h, T&... t) {bool f = read_single(h);assert(f);read(t...);}int read_unsafe() { return 0; }template <class H, class... T> int read_unsafe(H& h, T&... t) {bool f = read_single(h);if (!f) return 0;return 1 + read_unsafe(t...);}private:static constexpr size_t SIZE = 1 << 15;bool read_single(std::string& ref) {if (!skip_space()) return false;ref = "";while (true) {char c = top();if (c <= ' ') break;ref += c;st++;}return true;}bool read_single(double& ref) {std::string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}template <class T, internal::is_signed_int_t<T>* = nullptr>bool read_single(T& sref) {using U = internal::to_unsigned_t<T>;if (!skip_space(50)) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}U ref = 0;do {ref = 10 * ref + (line[st++] & 0x0f);} while (line[st] >= '0');sref = neg ? -ref : ref;return true;}template <class U, internal::is_unsigned_int_t<U>* = nullptr>bool read_single(U& ref) {if (!skip_space(50)) return false;ref = 0;do {ref = 10 * ref + (line[st++] & 0x0f);} while (line[st] >= '0');return true;}int fd = -1;char line[SIZE];size_t st = 0, ed = 0;bool eof = false;bool reread() {if (ed - st >= 50) return true;if (st > SIZE / 2) {std::memmove(line, line + st, ed - st);ed -= st;st = 0;}if (eof) return false;auto u = ::read(fd, line + ed, SIZE - ed);if (u == 0) {eof = true;line[ed] = '\0';u = 1;}ed += u;return true;}char top() {if (st == ed) {bool f = reread();assert(f);}return line[st];}bool skip_space(unsigned int token_len = 0) {while (true) {while (st != ed && line[st] <= ' ') st++;if (ed - st > token_len) return true;for (auto i = st; i < ed; i++) {if (line[i] <= ' ') return true;}if (!reread()) return false;}}};struct Printer {public:template <bool F = false> void write() {}template <bool F = false, class H, class... T>void write(const H& h, const T&... t) {if (F) write_single(' ');write_single(h);write<true>(t...);}template <class... T> void writeln(const T&... t) {write(t...);write_single('\n');}Printer(FILE* _fp) : fd(fileno(_fp)) {}~Printer() { flush(); }void flush() {::write(fd, line, pos);pos = 0;}private:static std::array<std::array<char, 2>, 100> small;static std::array<unsigned long long, 20> tens;static int calc_len(unsigned long long x) {int i = (bsr(x) * 3 + 3) / 10;if (x < tens[i])return i;elsereturn i + 1;}static constexpr size_t SIZE = 1 << 15;int fd;char line[SIZE];size_t pos = 0;void write_single(const char& val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, internal::is_signed_int_t<T>* = nullptr>void write_single(const T& val) {using U = internal::to_unsigned_t<T>;if (val == 0) {write_single('0');return;}if (pos > SIZE - 50) flush();U uval = val;if (val < 0) {write_single('-');uval = -uval;}write_unsigned(uval);}template <class U, internal::is_unsigned_int_t<U>* = nullptr>void write_single(U uval) {if (uval == 0) {write_single('0');return;}if (pos > SIZE - 50) flush();write_unsigned(uval);}template <class U,internal::is_unsigned_int_t<U>* = nullptr,std::enable_if_t<sizeof(U) == 4>* = nullptr>void write_unsigned(U uval) {write_unsigned(uint64_t(uval));}template <class U,internal::is_unsigned_int_t<U>* = nullptr,std::enable_if_t<sizeof(U) == 8>* = nullptr>void write_unsigned(U uval) {size_t len = calc_len(uval);pos += len;char* ptr = line + pos;while (uval >= 100) {ptr -= 2;memcpy(ptr, small[uval % 100].data(), 2);uval /= 100;}if (uval >= 10) {memcpy(ptr - 2, small[uval].data(), 2);} else {*(ptr - 1) = char('0' + uval);}}void write_single(const std::string& s) {for (char c : s) write_single(c);}void write_single(const char* s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write_single(s[i]);}template <class T> void write_single(const std::vector<T>& val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write_single(' ');write_single(val[i]);}}};std::array<std::array<char, 2>, 100> Printer::small = [] {std::array<std::array<char, 2>, 100> table;for (int i = 0; i <= 99; i++) {table[i][1] = char('0' + (i % 10));table[i][0] = char('0' + (i / 10 % 10));}return table;}();std::array<unsigned long long, 20> Printer::tens = [] {std::array<unsigned long long, 20> table;for (int i = 0; i < 20; i++) {table[i] = 1;for (int j = 0; j < i; j++) {table[i] *= 10;}}return table;}();} // namespace yosupo#include <array>#include <cassert>#include <chrono>#include <cstdint>#include <type_traits>namespace yosupo {struct Xoshiro256StarStar {public:using result_type = uint64_t;Xoshiro256StarStar() : Xoshiro256StarStar(0) {}explicit Xoshiro256StarStar(uint64_t seed) {for (int i = 0; i < 4; i++) {uint64_t z = (seed += 0x9e3779b97f4a7c15);z = (z ^ (z >> 30)) * 0xbf58476d1ce4e5b9;z = (z ^ (z >> 27)) * 0x94d049bb133111eb;s[i] = z ^ (z >> 31);}}static constexpr result_type min() { return 0; }static constexpr result_type max() { return -1; }result_type operator()() {const uint64_t result_starstar = rotl(s[1] * 5, 7) * 9;const uint64_t t = s[1] << 17;s[2] ^= s[0];s[3] ^= s[1];s[1] ^= s[2];s[0] ^= s[3];s[2] ^= t;s[3] = rotl(s[3], 45);return result_starstar;}private:static uint64_t rotl(const uint64_t x, int k) {return (x << k) | (x >> (64 - k));}std::array<uint64_t, 4> s;};namespace internal {template <class G> uint64_t uniform(uint64_t upper, G& gen) {static_assert(std::is_same<uint64_t, typename G::result_type>::value, "");static_assert(G::min() == 0, "");static_assert(G::max() == uint64_t(-1), "");if (!(upper & (upper + 1))) {return gen() & upper;}int log = bsr(upper);uint64_t mask = (log == 63) ? ~0ULL : (1ULL << (log + 1)) - 1;while (true) {uint64_t r = gen() & mask;if (r <= upper) return r;}}} // namespace internalXoshiro256StarStar& global_gen() {static Xoshiro256StarStar gen(std::chrono::steady_clock::now().time_since_epoch().count());return gen;}template <class T, class G> T uniform(T lower, T upper, G& gen) {return T(lower + internal::uniform(uint64_t(upper) - uint64_t(lower), gen));}template <class T> T uniform(T lower, T upper) {return uniform(lower, upper, global_gen());}template <class G> bool uniform_bool(G& gen) {return internal::uniform(1, gen) == 1;}bool uniform_bool() { return uniform_bool(global_gen()); }template <class T, class G>std::pair<T, T> uniform_pair(T lower, T upper, G& gen) {assert(upper - lower >= 1);T a, b;do {a = uniform(lower, upper, gen);b = uniform(lower, upper, gen);} while (a == b);if (a > b) std::swap(a, b);return {a, b};}template <class T> std::pair<T, T> uniform_pair(T lower, T upper) {return uniform_pair(lower, upper, global_gen());}} // namespace yosupousing namespace yosupo;#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <complex>#include <cstdio>#include <cstring>#include <iostream>#include <map>#include <numeric>#include <queue>#include <set>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using uint = unsigned int;using ll = long long;using ull = unsigned long long;constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }template <class T> using V = vector<T>;template <class T> using VV = V<V<T>>;#ifdef LOCALostream& operator<<(ostream& os, __int128_t x) {if (x < 0) {os << "-";x *= -1;}if (x == 0) {return os << "0";}string s;while (x) {s += char(x % 10 + '0');x /= 10;}reverse(s.begin(), s.end());return os << s;}ostream& operator<<(ostream& os, __uint128_t x) {if (x == 0) {return os << "0";}string s;while (x) {s += char(x % 10 + '0');x /= 10;}reverse(s.begin(), s.end());return os << s;}template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p);template <class T> ostream& operator<<(ostream& os, const V<T>& v);template <class T> ostream& operator<<(ostream& os, const deque<T>& v);template <class T, size_t N>ostream& operator<<(ostream& os, const array<T, N>& a);template <class T> ostream& operator<<(ostream& os, const set<T>& s);template <class T, class U>ostream& operator<<(ostream& os, const map<T, U>& m);template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {return os << "P(" << p.first << ", " << p.second << ")";}template <class T> ostream& operator<<(ostream& os, const V<T>& v) {os << "[";bool f = false;for (auto d : v) {if (f) os << ", ";f = true;os << d;}return os << "]";}template <class T> ostream& operator<<(ostream& os, const deque<T>& v) {os << "[";bool f = false;for (auto d : v) {if (f) os << ", ";f = true;os << d;}return os << "]";}template <class T, size_t N>ostream& operator<<(ostream& os, const array<T, N>& a) {os << "[";bool f = false;for (auto d : a) {if (f) os << ", ";f = true;os << d;}return os << "]";}template <class T> ostream& operator<<(ostream& os, const set<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}template <class T, class U>ostream& operator<<(ostream& os, const map<T, U>& s) {os << "{";bool f = false;for (auto p : s) {if (f) os << ", ";f = true;os << p.first << ": " << p.second;}return os << "}";}struct PrettyOS {ostream& os;bool first;template <class T> auto operator<<(T&& x) {if (!first) os << ", ";first = false;os << x;return *this;}};template <class... T> void dbg0(T&&... t) {(PrettyOS{cerr, true} << ... << t);}#define dbg(...) \do { \cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \dbg0(__VA_ARGS__); \cerr << endl; \} while (false);#else#define dbg(...)#endifScanner sc = Scanner(stdin);Printer pr = Printer(stdout);V<bool> naive(VV<int> g) {int n = int(g.size());using P = pair<int, int>;V<bool> ans(n);for (int i = 0; i < n; i++) {queue<P> que;set<P> reach;reach.insert({1 << i, i});que.push({1 << i, i});while (que.size()) {int f, p;tie(f, p) = que.front(); que.pop();if (f == (1 << n) - 1) {ans[i] = true;break;}int a = n, b = n;for (int d : g[p]) {if (f & (1 << d)) {a = min(a, d);} else {b = min(b, d);}}if (a != n) {P np = {f | (1 << a), a};if (!reach.count(np)) {reach.insert(np);que.push(np);}}if (b != n) {P np = {f | (1 << b), b};if (!reach.count(np)) {reach.insert(np);que.push(np);}}}}return ans;}V<bool> solve(VV<int> g) {int n = int(g.size());for (int i = 0; i < n; i++) {sort(g[i].begin(), g[i].end(), greater<int>());}V<int> memo(n, -1);auto dual_ok = [&](auto self, int p, int b) -> bool {assert(b != -1);if (b != g[p].back()) return false;if (memo[p] != -1) return memo[p];memo[p] = true;for (int d: g[p]) {if (d == b) continue;if (!self(self, d, p)) {memo[p] = false;break;}}return memo[p];};V<int> dual_ngs(n, -1);for (int p = 0; p < n; p++) {for (int d: g[p]) {if (d == g[p].front() || d == g[p].back()) continue;if (dual_ok(dual_ok, d, p)) continue;if (dual_ngs[p] != -1) {dual_ngs[p] = -2;break;}dual_ngs[p] = d;}}using P = pair<int, int>;map<P, int> s_memo;auto single_ok = [&](auto self, int p, int b) -> bool {P key = {p, b};if (s_memo.count(key)) return s_memo[key];if (g[p].size() == 1) {if (b != -1) return true;return s_memo[key] = self(self, g[p][0], p);}if (g[p].size() == 2 && b != -1) {int d = g[p][0] ^ g[p][1] ^ b;return s_memo[key] = self(self, d, p);}if (b != g[p].front() && b != g[p].back()) {if (!self(self, g[p].front(), p) || !self(self, g[p].back(), p)) {return s_memo[key] = false;}if (!dual_ok(dual_ok, g[p].front(), p) && !dual_ok(dual_ok, g[p].back(), p)) {return s_memo[key] = false;}return s_memo[key] = (dual_ngs[p] == -1 || dual_ngs[p] == b);}int x = (b != g[p].front() ? g[p].front() : g[p][1]);int y = (b != g[p].back() ? g[p].back() : g[p][g[p].size() - 2]);if (b == g[p].back()) {if (!self(self, x, p) || !dual_ok(dual_ok, y, p)) {return s_memo[key] = false;}} else {if (!self(self, x, p) || !self(self, y, p)) {return s_memo[key] = false;}if (!dual_ok(dual_ok, x, p) && !dual_ok(dual_ok, y, p)) {return s_memo[key] = false;}}for (int d: g[p]) {if (d == x || d == y || d == b) continue;if (!dual_ok(dual_ok, d, p)) return s_memo[key] = false;}return s_memo[key] = true;};V<bool> ans(n);for (int i = 0; i < n; i++) {ans[i] = single_ok(single_ok, i, -1);}return ans;}void test() {int n = uniform(2, 5);V<int> perm(n);iota(perm.begin(), perm.end(), 0);shuffle(perm.begin(), perm.end(), global_gen());VV<int> g(n);for (int i = 1; i < n; i++) {int p = uniform(0, i - 1);g[perm[p]].push_back(perm[i]);g[perm[i]].push_back(perm[p]);}auto solve_ans = solve(g);auto naive_ans = naive(g);if (solve_ans != naive_ans) {dbg(g);for (int i = 0; i < n; i++) {for (int d: g[i]) {if (i < d) dbg(i, d);}}dbg(solve_ans, naive_ans);assert(false);}}int main() {//while (true) test();int n;sc.read(n);VV<int> g(n);for (int i = 0; i < n - 1; i++) {int a, b;sc.read(a, b);a--;b--;g[a].push_back(b);g[b].push_back(a);}//auto ans = solve(g);auto ans = solve(g);for (int i = 0; i < n; i++) {if (ans[i]) {pr.writeln("Yes");} else {pr.writeln("No");}}return 0;}