// clang-format off #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r) for(auto i=(l);i<=(r);++i) #define REP(i,n) FOR(i,0,(n)-1) #define ssize(x) int(x.size()) template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<"("<<p.first<<", "<<p.second<<")";} template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<"}";} #ifdef DEBUG #define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n' #else #define debug(...) {} #endif // clang-format on // Global variables using mask_t = uint64_t; int n, nmoves; vector<pair<mask_t, mask_t>> moves; vector<pair<uint64_t, size_t>> dq; LL score = 0; void count_masks(const mask_t& start_mask) { dq.emplace_back(start_mask, 0); while (!dq.empty()) { auto [mask, pos] = std::move(dq.back()); dq.pop_back(); for (auto it = moves.begin() + pos; true;) { if (it == moves.end()) { ++score; break; } const auto& [a, b] = *(it++); if ((bool)(mask & a) == (bool)(mask & b)) continue; if (mask & a) break; // (a) 0 (b) 1: take sum of two cases dq.emplace_back((mask | a) ^ b, it - moves.begin()); } } } int main() { cin.tie(0)->sync_with_stdio(0); cin >> n >> nmoves; moves.resize(nmoves); for (auto& x : moves) { cin >> x.first >> x.second; x.first = (mask_t)1 << (x.first - 1); x.second = (mask_t)1 << (x.second - 1); } reverse(moves.begin(), moves.end()); FOR (k, 1, n) { mask_t mask = ((mask_t)1 << k) - 1; score = 0; REP (iteration, n + 1 - k) { count_masks(mask); mask <<= 1; } cout << (score & 1) << " "; } cout << "\n"; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 | // clang-format off #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r) for(auto i=(l);i<=(r);++i) #define REP(i,n) FOR(i,0,(n)-1) #define ssize(x) int(x.size()) template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<"("<<p.first<<", "<<p.second<<")";} template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<"}";} #ifdef DEBUG #define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n' #else #define debug(...) {} #endif // clang-format on // Global variables using mask_t = uint64_t; int n, nmoves; vector<pair<mask_t, mask_t>> moves; vector<pair<uint64_t, size_t>> dq; LL score = 0; void count_masks(const mask_t& start_mask) { dq.emplace_back(start_mask, 0); while (!dq.empty()) { auto [mask, pos] = std::move(dq.back()); dq.pop_back(); for (auto it = moves.begin() + pos; true;) { if (it == moves.end()) { ++score; break; } const auto& [a, b] = *(it++); if ((bool)(mask & a) == (bool)(mask & b)) continue; if (mask & a) break; // (a) 0 (b) 1: take sum of two cases dq.emplace_back((mask | a) ^ b, it - moves.begin()); } } } int main() { cin.tie(0)->sync_with_stdio(0); cin >> n >> nmoves; moves.resize(nmoves); for (auto& x : moves) { cin >> x.first >> x.second; x.first = (mask_t)1 << (x.first - 1); x.second = (mask_t)1 << (x.second - 1); } reverse(moves.begin(), moves.end()); FOR (k, 1, n) { mask_t mask = ((mask_t)1 << k) - 1; score = 0; REP (iteration, n + 1 - k) { count_masks(mask); mask <<= 1; } cout << (score & 1) << " "; } cout << "\n"; return 0; } |