#include <bits/stdc++.h> using namespace std; #define PB push_back #define LL long long #define int LL #define FOR(i,a,b) for (int i = (a); i <= (b); i++) #define FORD(i,a,b) for (int i = (a); i >= (b); i--) #define REP(i,n) FOR(i,0,(int)(n)-1) #define st first #define nd second #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define VI vector<int> #define PII pair<int,int> #define LD long double template<class T> ostream &operator<<(ostream &os, vector<T> V){ os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]"; } template<int N> ostream &operator<<(ostream &os, bitset<N> V){ os<<"[";for(int i = 0; i < N; i++)os<<V[i];return os<<"]"; } template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) { return os << "(" << P.st << "," << P.nd << ")"; } template<class C> void mini(C& a4, C b4) { a4 = min(a4, b4); } template<class C> void maxi(C& a4, C b4) { a4 = max(a4, b4); } template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";} template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...); } #ifdef LOCAL #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (__VA_ARGS__) #define cerr if(0)cout #endif vector<PII> edges; int n,m; bool get_bit(int state, int bit){ return (state >> bit) & 1; } int get_ans(int state, int current_m){ if(current_m == m){ // debug(bitset<4>(state)); return 1; } int a = edges[current_m].st; int b = edges[current_m].nd; bool bit_a = get_bit(state, a); bool bit_b = get_bit(state, b); if(bit_a == bit_b){ return get_ans(state, current_m + 1); } if(bit_a == 0){ // bit_a becomes 1 // bit_b becomes 0 int r1 = get_ans((state | (1LL << a)) ^ (1LL << b), current_m + 1); int r2 = get_ans(state, current_m + 1); return r1 ^ r2; } return 0; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(11); cerr << fixed << setprecision(6); cin >> n >> m; edges.resize(m); REP(i,m) { cin >> edges[i].st >> edges[i].nd; edges[i].st--; edges[i].nd--; } reverse(ALL(edges)); // for each interval length FOR(l,1,n){ debug(l); // for each interval start int res = 0; FOR(start,0,n-l){ if(start + l - 1 >= n){ break; } int state = 0; FOR(i,start,start+l-1){ state |= 1LL << i; } res ^= get_ans(state, 0); } cout << res << " "; } }
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 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 | #include <bits/stdc++.h> using namespace std; #define PB push_back #define LL long long #define int LL #define FOR(i,a,b) for (int i = (a); i <= (b); i++) #define FORD(i,a,b) for (int i = (a); i >= (b); i--) #define REP(i,n) FOR(i,0,(int)(n)-1) #define st first #define nd second #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define VI vector<int> #define PII pair<int,int> #define LD long double template<class T> ostream &operator<<(ostream &os, vector<T> V){ os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]"; } template<int N> ostream &operator<<(ostream &os, bitset<N> V){ os<<"[";for(int i = 0; i < N; i++)os<<V[i];return os<<"]"; } template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) { return os << "(" << P.st << "," << P.nd << ")"; } template<class C> void mini(C& a4, C b4) { a4 = min(a4, b4); } template<class C> void maxi(C& a4, C b4) { a4 = max(a4, b4); } template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";} template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...); } #ifdef LOCAL #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (__VA_ARGS__) #define cerr if(0)cout #endif vector<PII> edges; int n,m; bool get_bit(int state, int bit){ return (state >> bit) & 1; } int get_ans(int state, int current_m){ if(current_m == m){ // debug(bitset<4>(state)); return 1; } int a = edges[current_m].st; int b = edges[current_m].nd; bool bit_a = get_bit(state, a); bool bit_b = get_bit(state, b); if(bit_a == bit_b){ return get_ans(state, current_m + 1); } if(bit_a == 0){ // bit_a becomes 1 // bit_b becomes 0 int r1 = get_ans((state | (1LL << a)) ^ (1LL << b), current_m + 1); int r2 = get_ans(state, current_m + 1); return r1 ^ r2; } return 0; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(11); cerr << fixed << setprecision(6); cin >> n >> m; edges.resize(m); REP(i,m) { cin >> edges[i].st >> edges[i].nd; edges[i].st--; edges[i].nd--; } reverse(ALL(edges)); // for each interval length FOR(l,1,n){ debug(l); // for each interval start int res = 0; FOR(start,0,n-l){ if(start + l - 1 >= n){ break; } int state = 0; FOR(i,start,start+l-1){ state |= 1LL << i; } res ^= get_ans(state, 0); } cout << res << " "; } } |